A secure three-input and protocol with a standard deck of minimal cards
From MaRDI portal
Publication:2117094
DOI10.1007/978-3-030-79416-3_14OpenAlexW3174835700MaRDI QIDQ2117094FDOQ2117094
Daiki Miyahara, Hiroto Koyama, Takaaki Mizuki, Hideaki Sone
Publication date: 21 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-79416-3_14
Cites Work
- The minimum number of cards in practical card-based protocols
- 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
- Title not available (Why is that?)
- More Efficient Match-Making and Satisfiability The Five Card Trick
- Title not available (Why is that?)
- Six-Card Secure AND and Four-Card Secure XOR
- Physical zero-knowledge proof for ripple effect
- Physical Zero-Knowledge Proof for Suguru Puzzle
- Analysis of information leakage due to operative errors in card-based protocols
- Efficient and secure multiparty computations using a standard deck of playing cards
- Voting with a Logarithmic Number of Cards
- AND protocols using only uniform shuffles
- Card-Based Protocols for Any Boolean Function
- Card-based Protocols Using Triangle Cards
- Title not available (Why is that?)
Cited In (8)
- Single-shuffle card-based protocol with eight cards per gate
- An improved physical ZKP for Nonogram
- Secure computations through checking suits of playing cards
- Two standard decks of playing cards are sufficient for a ZKP for Sudoku
- Card-Based Secure Sorting Protocol
- Card-minimal protocols for three-input functions with standard playing cards
- Physical ZKP for Makaro using a standard deck of cards
- Card-based cryptographic protocols with a standard deck of cards using private operations
This page was built for publication: A secure three-input and protocol with a standard deck of minimal cards
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117094)
