Secure computations through checking suits of playing cards

DOI10.1007/978-3-031-20796-9_9MaRDI QIDQ6166876zbMATH OpenFDO

Authors Daiki Miyahara, Takaaki Mizuki

Publication date 3 August 2023

Published in Frontiers of Algorithmic Wisdom (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

secure computationreal-life hands-on cryptographycard-based cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Secure computation of any Boolean function based on any deck of cards
• Efficient and secure multiparty computations using a standard deck of playing cards
• Securely computing the \(n\)-variable equality function with \(2n\) cards
• Securely computing the \(n\)-variable equality function with \(2n\) cards
• Necessary and sufficient numbers of cards for securely computing two-bit output functions
• Card-based protocols for securely computing the conjunction of multiple variables
• A secure additive protocol for card players
• Card-based cryptographic protocols with a standard deck of cards using private operations
• Bounds on secret key exchange using a random deal of cards
• Securely computing XOR with 10 cards

Cites work

• scientific article; zbMATH DE number 1339969 (Why is no real title available?)
• scientific article; zbMATH DE number 1024066 (Why is no real title available?)
• A secure three-input and protocol with a standard deck of minimal cards
• A single shuffle is enough for secure card-based computation of any Boolean circuit
• Card-based cryptographic protocols using a minimal number of cards
• Card-based cryptographic protocols with a standard deck of cards using private operations
• Card-based cryptography meets formal verification
• Card-based zero-knowledge proof protocols for graph problems and their computational model
• Card-minimal protocols for three-input functions with standard playing cards
• Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles
• Efficient and secure multiparty computations using a standard deck of playing cards
• Efficient card-based protocols for generating a hidden random permutation without fixed points
• Efficient card-based zero-knowledge proof for Sudoku
• How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition
• Information leakage due to operative errors in card-based protocols
• More Efficient Match-Making and Satisfiability The Five Card Trick
• Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle
• Physical zero-knowledge proof for ripple effect
• Practical card-based implementations of Yao's millionaire protocol
• Public-PEZ Cryptography
• 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
• Two standard decks of playing cards are sufficient for a ZKP for Sudoku

Cited in

(7)

• Computations with a deck of cards
• Practical construction for secure trick-taking games even with cards set aside
• Secure computation of any Boolean function based on any deck of cards
• A secure additive protocol for card players
• Card-based secure ranking computations
• Card-based protocol against actively revealing card attack
• scientific article; zbMATH DE number 5575521 (Why is no real title available?)

This page was built for publication: Secure computations through checking suits of playing cards

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