Analyzing execution time of card-based protocols

DOI10.1007/978-3-319-92435-9_11zbMath1465.68092OpenAlexW2807078326MaRDI QIDQ1799370

Itaru Ueda, Yu-ichi Hayashi, Daiki Miyahara, Hideaki Sone, Takaaki Mizuki

Publication date: 18 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-92435-9_11

zbMATH Keywords

cryptographycard-based protocolsreal-life hands-on cryptographysecure multi-party computations

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)

Related Items (3)

Zero-knowledge proof protocol for cryptarithmetic using dihedral cards ⋮ Card-minimal protocols for three-input functions with standard playing cards ⋮ Single-shuffle card-based protocol with eight cards per gate

This page was built for publication: Analyzing execution time of card-based protocols