Efficient generation of a card-based uniformly distributed random derangement

DOI10.1007/978-3-030-68211-8_7OpenAlexW3130299561MaRDI QIDQ2232235

Daiki Miyahara, Takaaki Mizuki, Soma Murata, Hideaki Sone

Publication date: 4 October 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-68211-8_7

zbMATH Keywords

Secret Santacard-based cryptographyderangement (Permutation without fixed points)exchange of gifts

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (3)

Card-based cryptographic protocols with a standard deck of cards using private operations ⋮ Card-minimal protocols for three-input functions with standard playing cards ⋮ Card-based cryptographic protocols for three-input functions using private operations

Cites Work

• Unnamed Item
• Secure grouping protocol using a deck of cards
• Efficient card-based cryptographic protocols for millionaires' problem utilizing private permutations
• Efficient card-based zero-knowledge proof for Sudoku
• Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles
• Practical card-based implementations of Yao's millionaire protocol
• Crypto Santa
• Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points
• More Efficient Match-Making and Satisfiability The Five Card Trick
• Six-Card Secure AND and Four-Card Secure XOR
• Physical Zero-Knowledge Proof for Suguru Puzzle

This page was built for publication: Efficient generation of a card-based uniformly distributed random derangement