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

DOI10.1007/978-3-030-89543-3_55MaRDI QIDQ2695338zbMATH OpenOpenAlexFDO

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

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)

Cites work

• AND protocols using only uniform shuffles
• Card-based cryptographic protocols for three-input functions using private operations
• Card-based cryptographic protocols using a minimal number of cards
• Card-based cryptography meets formal verification
• Card-based protocols for securely computing the conjunction of multiple variables
• Card-based protocols using unequal division shuffles
• How to implement a non-uniform or non-closed shuffle
• More Efficient Match-Making and Satisfiability The Five Card Trick
• Securely computing the \(n\)-variable equality function with \(2n\) cards
• Six-Card Secure AND and Four-Card Secure XOR
• The five-card trick can be done with four cards
• The minimum number of cards in practical card-based protocols

Cited in

(3)

• Card-minimal protocols for symmetric Boolean functions of more than seven inputs
• Card-Based Secure Sorting Protocol
• The landscape of computing symmetric n-variable functions with 2n cards

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

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