Analyzing execution time of card-based protocols

DOI10.1007/978-3-319-92435-9_11MaRDI QIDQ1799370zbMATH OpenOpenAlexFDO

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

Publication date 18 October 2018

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

zbMATH Keywords

cryptographysecure multi-party computationscard-based protocolsreal-life hands-on cryptography

Mathematics Subject Classification ID

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

Recommendations

• Efficient and secure multiparty computations using a standard deck of playing cards
• Card-based cryptography meets formal verification
• Card-based cryptographic protocols using a minimal number of cards
• Analysis of information leakage due to operative errors in card-based protocols
• Card-based protocols for any Boolean function

Cited in

(3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1799370)