A card-minimal three-input and protocol using two shuffles

DOI10.1007/978-3-030-89543-3_55OpenAlexW3209751283MaRDI QIDQ2695338

Yu Sasaki, Takaaki Mizuki, Kodai Toyoda, Daiki Miyahara, Raimu Isuzugawa

Publication date: 30 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-89543-3_55

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Related Items (1)

Card-minimal protocols for symmetric Boolean functions of more than seven inputs

Cites Work

• The minimum number of cards in practical card-based protocols
• Card-based protocols using unequal division shuffles
• How to implement a non-uniform or non-closed shuffle
• Card-based cryptographic protocols for three-input functions using private operations
• Card-based cryptography meets formal verification
• AND protocols using only uniform shuffles
• Card-Based Cryptographic Protocols Using a Minimal Number of Cards
• The Five-Card Trick Can Be Done with Four Cards
• More Efficient Match-Making and Satisfiability The Five Card Trick
• Six-Card Secure AND and Four-Card Secure XOR
• Securely computing the \(n\)-variable equality function with \(2n\) cards
• Card-based protocols for securely computing the conjunction of multiple variables

This page was built for publication: A card-minimal three-input and protocol using two shuffles