Card-minimal protocols for three-input functions with standard playing cards

DOI10.1007/978-3-031-17433-9_19zbMATH Open1515.94073OpenAlexW4312774652MaRDI QIDQ6103095FDOQ6103095

Authors: Rikuo Haga, Yu-ichi Hayashi, Daiki Miyahara, Takaaki Mizuki 

Publication date: 2 June 2023

Published in: Progress in Cryptology - AFRICACRYPT 2022 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-17433-9_19

Recommendations

• Another use of the five-card trick: card-minimal secure three-input majority function evaluation
• Card-based protocols for any Boolean function
• Computations with a deck of cards
• Secure multi-party computation using polarizing cards
• Card-based cryptographic protocols using a minimal number of cards

zbMATH Keywords

secure computationcard-based cryptographystandard deck of playing cards

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Interactive physical ZKP for connectivity: applications to Nurikabe and Hitori
• Card-based cryptography meets formal verification
• Practical card-based implementations of Yao's millionaire protocol
• Card-based cryptographic protocols using a minimal number of cards
• Six-Card Secure AND and Four-Card Secure XOR
• Foundations for actively secure card-based cryptography
• How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition
• Efficient and secure multiparty computations using a standard deck of playing cards
• Card-based cryptographic protocols with a standard deck of cards using private operations
• Analyzing execution time of card-based protocols
• How to implement a non-uniform or non-closed shuffle
• A secure three-input and protocol with a standard deck of minimal cards
• Efficient generation of a card-based uniformly distributed random derangement
• Title not available (Why is that?)
• Two standard decks of playing cards are sufficient for a ZKP for Sudoku
• Zero-knowledge proof protocol for cryptarithmetic using dihedral cards
• Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle
• Information leakage due to operative errors in card-based protocols
• Physical zero-knowledge proof for ripple effect
• Another use of the five-card trick: card-minimal secure three-input majority function evaluation

Cited In (9)

• Card-based protocols for any Boolean function
• Card-based protocols using triangle cards
• The six-card trick: secure computation of three-input equality
• Single-shuffle card-based protocol with eight cards per gate
• Secure computations through checking suits of playing cards
• Physical zero-knowledge proof protocol for Topswops
• Another use of the five-card trick: card-minimal secure three-input majority function evaluation
• Four cards are sufficient for a card-based three-input voting protocol utilizing private permutations
• Six-Card Secure AND and Four-Card Secure XOR

This page was built for publication: Card-minimal protocols for three-input functions with standard playing cards

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