Card-based cryptographic protocols for three-input functions using private operations

DOI10.1007/978-3-030-79987-8_33MaRDI QIDQ2115886zbMATH OpenOpenAlexFDO

Authors Yoshifumi Manabe, Hibiki Ono

Publication date 22 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-79987-8_33

zbMATH Keywords

symmetric functionsBoolean functionscard-based cryptographic protocolshalf addermulti-party secure computation

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Recommendations

• Card-minimal protocols for three-input functions with standard playing cards
• Card-based cryptographic protocols with a standard deck of cards using private operations
• A secure three-input and protocol with a standard deck of minimal cards
• Card-based protocols for any Boolean function

Cites work

• scientific article; zbMATH DE number 1024066 (Why is no real title available?)
• A physical ZKP for Slitherlink: how to perform physical topology-preserving computation
• A single shuffle is enough for secure card-based computation of any Boolean circuit
• AND protocols using only uniform shuffles
• Card-based cryptographic protocols using a minimal number of cards
• Card-based protocols for any Boolean function
• Card-based protocols for secure ranking computations
• Card-based protocols for securely computing the conjunction of multiple variables
• Card-based protocols using unequal division shuffles
• Computations with a deck of cards
• Efficient card-based protocols for generating a hidden random permutation without fixed points
• Efficient card-based zero-knowledge proof for Sudoku
• Efficient generation of a card-based uniformly distributed random derangement
• Four cards are sufficient for a card-based three-input voting protocol utilizing private permutations
• Interactive physical ZKP for connectivity: applications to Nurikabe and Hitori
• Interactive physical zero-knowledge proof for Norinori
• More Efficient Match-Making and Satisfiability The Five Card Trick
• Necessary and sufficient numbers of cards for securely computing two-bit output functions
• Physical Zero-Knowledge Proof for Suguru Puzzle
• Physical zero-knowledge proof for Makaro
• Physical zero-knowledge proof for ripple effect
• Practical card-based implementations of Yao's millionaire protocol
• Secure multiparty computations without computers
• Securely computing XOR with 10 cards
• 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
• The six-card trick: secure computation of three-input equality
• Voting with a Logarithmic Number of Cards

Cited in

(5)

• Zero-knowledge proof protocol for cryptarithmetic using dihedral cards
• Physical zero-knowledge proof protocol for Topswops
• A card-minimal three-input and protocol using two shuffles
• Card-minimal protocols for symmetric Boolean functions of more than seven inputs
• Card-based cryptographic protocols with a standard deck of cards using private operations

This page was built for publication: Card-based cryptographic protocols for three-input functions using private operations

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