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

DOI10.1007/978-3-030-79987-8_33OpenAlexW3174631320MaRDI QIDQ2115886FDOQ2115886

Hibiki Ono, Yoshifumi Manabe

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)

Cites Work

• Computations with a deck of cards
• Secure multiparty computations without computers
• The minimum number of cards in practical card-based protocols
• Interactive physical ZKP for connectivity: applications to Nurikabe and Hitori
• A physical ZKP for Slitherlink: how to perform physical topology-preserving computation
• Efficient card-based zero-knowledge proof for Sudoku
• Card-based protocols for secure ranking computations
• A single shuffle is enough for secure card-based computation of any Boolean circuit
• Practical card-based implementations of Yao's millionaire protocol
• Interactive physical zero-knowledge proof for Norinori
• Card-Based Cryptographic Protocols Using a Minimal Number of Cards
• Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points
• Title not available (Why is that?)
• The Five-Card Trick Can Be Done with Four Cards
• More Efficient Match-Making and Satisfiability The Five Card Trick
• Six-Card Secure AND and Four-Card Secure XOR
• Physical zero-knowledge proof for ripple effect
• Card-based protocols for securely computing the conjunction of multiple variables
• Physical zero-knowledge proof for Makaro
• Physical Zero-Knowledge Proof for Suguru Puzzle
• Four cards are sufficient for a card-based three-input voting protocol utilizing private permutations
• The six-card trick: secure computation of three-input equality
• Card-based protocols using unequal division shuffles
• Necessary and sufficient numbers of cards for securely computing two-bit output functions
• Voting with a Logarithmic Number of Cards
• Efficient generation of a card-based uniformly distributed random derangement
• AND protocols using only uniform shuffles
• Card-Based Protocols for Any Boolean Function
• Title not available (Why is that?)
• Securely computing the \(n\)-variable equality function with \(2n\) cards

Cited In (5)

• Physical zero-knowledge proof protocol for Topswops
• Zero-knowledge proof protocol for cryptarithmetic using dihedral cards
• Card-minimal protocols for symmetric Boolean functions of more than seven inputs
• A card-minimal three-input and protocol using two shuffles
• 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)