Efficient card-based protocols for generating a hidden random permutation without fixed points
From MaRDI portal
Recommendations
Cites work
- A colouring protocol for the generalized Russian cards problem
- Bounds on secret key exchange using a random deal of cards
- Card-based protocols for any Boolean function
- Combinatorial solutions providing improved security for the generalized Russian cards problem
- Computations with a deck of cards
- scientific article; zbMATH DE number 1024066 (Why is no real title available?)
- More Efficient Match-Making and Satisfiability The Five Card Trick
- Secure multiparty computations without computers
- Securely computing XOR with 10 cards
- Six-Card Secure AND and Four-Card Secure XOR
- The five-card trick can be done with four cards
- Unconditional secure communication: a Russian cards protocol
- Voting with a Logarithmic Number of Cards
Cited in
(31)- Card-based cryptographic protocols for three-input functions using private operations
- Card-based cryptographic protocols with a standard deck of cards using private operations
- Zero-knowledge proof protocol for cryptarithmetic using dihedral cards
- 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
- Efficient generation of a card-based uniformly distributed random derangement
- Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle
- Card-based zero-knowledge proof protocols for graph problems and their computational model
- Crypto Santa
- Card-based zero-knowledge proof for Sudoku
- Physical zero-knowledge proof for ripple effect
- Physical zero-knowledge proof for ripple effect
- Physical zero-knowledge proof protocol for Topswops
- Physical ZKP for Makaro using a standard deck of cards
- Actively revealing card attack on card-based protocols
- Physical zero-knowledge proof for ball sort puzzle
- Single-shuffle card-based protocol with eight cards per gate
- Secure computations through checking suits of playing cards
- Card-Based Secure Sorting Protocol
- Card-based protocol against actively revealing card attack
- Two UNO decks efficiently perform zero-knowledge proof for Sudoku
- A physical zero-knowledge proof for Sumplete, a puzzle generated by ChatGPT
- Efficient AND protocols resistant to maliciously revealing a single card
- Visualizing differentially private mechanisms with physical cards
- How to play Old Maid with virtual players
- NP-completeness and physical zero-knowledge proofs for Zeiger
- How to play Old Maid with virtual players
- Card-based overwriting protocol for equality function and applications
- How to play Mastermind without game master
- How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition
This page was built for publication: Efficient card-based protocols for generating a hidden random permutation without fixed points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945569)
