Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points

DOI10.1007/978-3-319-21819-9_16zbMath1465.94072OpenAlexW2249550835MaRDI QIDQ2945569

Eikoh Chida, Takaaki Mizuki, Rie Ishikawa

Publication date: 14 September 2015

Published in: Unconventional Computation and Natural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21819-9_16

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Cryptography (94A60) Combinatorial probability (60C05)

Related Items (19)

Card-based cryptographic protocols with a standard deck of cards using private operations ⋮ How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition ⋮ Zero-knowledge proof protocol for cryptarithmetic using dihedral cards ⋮ Card-Based Zero-Knowledge Proof for Sudoku ⋮ Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle ⋮ 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 ⋮ Efficient card-based zero-knowledge proof for Sudoku ⋮ Secure computations through checking suits of playing cards ⋮ Card-based zero-knowledge proof protocols for graph problems and their computational model ⋮ 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 for ripple effect ⋮ Physical zero-knowledge proof for ripple effect ⋮ Card-based cryptographic protocols for three-input functions using private operations

Cites Work

• Unnamed Item
• Unnamed Item
• A colouring protocol for the generalized Russian cards problem
• Unconditional secure communication: a Russian cards protocol
• Secure multiparty computations without computers
• Bounds on secret key exchange using a random deal of cards
• Combinatorial solutions providing improved security for the generalized Russian cards problem
• Card-Based Protocols for Any Boolean Function
• The Five-Card Trick Can Be Done with Four Cards
• More Efficient Match-Making and Satisfiability The Five Card Trick
• Voting with a Logarithmic Number of Cards
• Six-Card Secure AND and Four-Card Secure XOR
• Computations with a deck of cards

This page was built for publication: Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points