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

DOI10.1007/978-3-031-17715-6_25MaRDI QIDQ6109494

Daiki Miyahara, Hayato Shikata, Takaaki Mizuki, Kodai Toyoda

Publication date: 28 July 2023

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

zbMATH Keywords

symmetric functionreal-life hands-on cryptographysecure computationcard-based cryptography

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Physical zero-knowledge proof protocol for Topswops ⋮ Single-shuffle card-based protocol with eight cards per gate

Cites Work

• Private computation using a PEZ dispenser.
• The minimum number of cards in practical card-based protocols
• The six-card trick: secure computation of three-input equality
• Secure multi-party computation using polarizing cards
• Card-based cryptographic protocols for three-input functions using private operations
• Card-based cryptographic protocols with a standard deck of cards using private operations
• Efficient private PEZ protocols for symmetric functions
• Basing cryptographic protocols on tamper-evident seals
• Information leakage due to operative errors in card-based protocols
• A card-minimal three-input and protocol using two shuffles
• Card-Based Cryptographic Protocols Using a Minimal Number of Cards
• Card-Based Protocols for Any Boolean Function
• The Five-Card Trick Can Be Done with Four Cards
• More Efficient Match-Making and Satisfiability The Five Card Trick
• Voting with a Logarithmic Number of Cards
• 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
• Another use of the five-card trick: card-minimal secure three-input majority function evaluation
• Public-PEZ Cryptography

This page was built for publication: Card-minimal protocols for symmetric Boolean functions of more than seven inputs