The six-card trick: secure computation of three-input equality

DOI10.1007/978-3-030-12146-4_8MaRDI QIDQ1736040zbMATH OpenOpenAlexFDO

Authors Kazumasa Shinagawa, Takaaki Mizuki

Publication date 29 March 2019

Full work available at URL https://doi.org/10.1007/978-3-030-12146-4_8

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Securely computing the \(n\)-variable equality function with \(2n\) cards
• Card-based protocols for securely computing the conjunction of multiple variables
• The five-card trick can be done with four cards
• Card-minimal protocols for three-input functions with standard playing cards
• Card-based cryptographic protocols using a minimal number of cards

Cited in

(13)

• Card-based cryptographic protocols for three-input functions using private operations
• Card-based cryptographic protocols with a standard deck of cards using private operations
• Card-based cryptography with invisible ink
• Card-based protocols using triangle cards
• The five-card trick can be done with four cards
• Securely computing the \(n\)-variable equality function with \(2n\) cards
• Card-minimal protocols for symmetric Boolean functions of more than seven inputs
• Single-shuffle card-based protocol with eight cards per gate
• Another use of the five-card trick: card-minimal secure three-input majority function evaluation
• Card-based protocol against actively revealing card attack
• The landscape of computing symmetric n-variable functions with 2n cards
• Cyclic equalizability of words and its application to card-based cryptography
• Card-based overwriting protocol for equality function and applications

This page was built for publication: The six-card trick: secure computation of three-input equality

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