Secure multi-party computation using polarizing cards

DOI10.1007/978-3-319-22425-1_17MaRDI QIDQ1800599zbMATHOpenAlexFDO

Authors Kazumasa Shinagawa, Takaaki Mizuki, Koji Nuida, Naoki Kanayama, Takashi Nishide, Goichiro Hanaoka, Eiji Okamoto, Jacob C. N. Schuldt

Publication date 24 October 2018

Full work available at URL https://doi.org/10.1007/978-3-319-22425-1_17

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Six-Card Secure AND and Four-Card Secure XOR
• Card-based protocols for any Boolean function
• Card-based cryptographic protocols using a minimal number of cards
• Securely computing XOR with 10 cards
• Computations with a deck of cards

Cited in

(12)

• Card-based protocols for any Boolean function
• Efficient and secure multiparty computations using a standard deck of playing cards
• Securely computing XOR with 10 cards
• An improved physical ZKP for nonogram and nonogram color
• Card-based secure ranking computations
• Card-minimal protocols for three-input functions with standard playing cards
• Card-based cryptography meets formal verification
• Card-minimal protocols for symmetric Boolean functions of more than seven inputs
• Card-based protocols using triangle cards
• Multi-party computation based on physical coins
• Multi-party computation with small shuffle complexity using regular polygon cards
• Four cards are sufficient for a card-based three-input voting protocol utilizing private permutations

This page was built for publication: Secure multi-party computation using polarizing cards

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