Card-based protocols for any Boolean function

DOI10.1007/978-3-319-17142-5_11MaRDI QIDQ2948458zbMATH OpenOpenAlexFDO

Authors Takuya Nishida, Takaaki Mizuki, Hideaki Sone, Yu-ichi Hayashi

Publication date 30 September 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Card-minimal protocols for three-input functions with standard playing cards
• Computations with a deck of cards
• Secure multi-party computation using polarizing cards
• Securely computing the \(n\)-variable equality function with \(2n\) cards
• Six-Card Secure AND and Four-Card Secure XOR

Cited in

(31)

• Securely computing XOR with 10 cards
• Card-based protocols using triangle cards
• Card-based protocols with single-card encoding
• Card-based cryptographic protocols for three-input functions using private operations
• A secure three-input and protocol with a standard deck of minimal cards
• Single-shuffle card-based protocol with eight cards per gate
• Physical ZKP protocols for Nurimisaki and Kurodoko
• Secure computation of any Boolean function based on any deck of cards
• Efficient card-based protocols for generating a hidden random permutation without fixed points
• Card-based cryptographic protocols using a minimal number of cards
• Efficient private PEZ protocols for symmetric functions
• Card-based cryptography meets formal verification
• A single shuffle is enough for secure card-based computation of any Boolean circuit
• Card-based overwriting protocol for equality function and applications
• The landscape of computing symmetric n-variable functions with 2n cards
• Securely computing the \(n\)-variable equality function with \(2n\) cards
• Barrington plays cards: the complexity of card-based protocols
• Analysis of information leakage due to operative errors in card-based protocols
• Card-based protocols using unequal division shuffles
• Analyzing execution time of card-based protocols
• Secure multi-party computation using polarizing cards
• Necessary and sufficient numbers of cards for securely computing two-bit output functions
• Card-minimal protocols for three-input functions with standard playing cards
• Visualizing differentially private mechanisms with physical cards
• Card-minimal protocols for symmetric Boolean functions of more than seven inputs
• Multi-party computation based on physical coins
• Six-Card Secure AND and Four-Card Secure XOR
• Secure Multiparty Computations Using the 15 Puzzle
• Single-shuffle card-based protocols with six cards per gate
• Card-based cryptographic protocols with a standard deck of cards using private operations
• Multi-party computation with small shuffle complexity using regular polygon cards

This page was built for publication: Card-based protocols for any Boolean function

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