Six-Card Secure AND and Four-Card Secure XOR

DOI10.1007/978-3-642-02270-8_36zbMath1248.94083OpenAlexW1519482947MaRDI QIDQ5321728

Publication date: 14 July 2009

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02270-8_36

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (30)

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 ⋮ An improved physical ZKP for Nonogram ⋮ Card-based Protocols Using Triangle Cards ⋮ Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points ⋮ Information leakage due to operative errors in card-based protocols ⋮ Multi-party computation based on physical coins ⋮ Physical ZKP protocols for Nurimisaki and Kurodoko ⋮ Committed-format AND protocol using only random cuts ⋮ Card-minimal protocols for three-input functions with standard playing cards ⋮ Card-minimal protocols for symmetric Boolean functions of more than seven inputs ⋮ Hide a liar: card-based ZKP protocol for Usowan ⋮ Card-based zero-knowledge proof for the nearest neighbor property: zero-knowledge proof of ABC end view ⋮ Actively revealing card attack on card-based protocols ⋮ Single-shuffle card-based protocol with eight cards per gate ⋮ Card-based ZKP protocol for Nurimisaki ⋮ Another use of the five-card trick: card-minimal secure three-input majority function evaluation ⋮ Secure computations through checking suits of playing cards ⋮ An improved physical ZKP for nonogram and nonogram color ⋮ A card-minimal three-input and protocol using two shuffles ⋮ 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 ⋮ Securely computing the \(n\)-variable equality function with \(2n\) cards ⋮ Practical card-based implementations of Yao's millionaire protocol ⋮ Card-based protocols for securely computing the conjunction of multiple variables ⋮ Card-based protocols using unequal division shuffles ⋮ Card-based cryptographic protocols for three-input functions using private operations ⋮ A secure three-input and protocol with a standard deck of minimal cards

Cites Work

This page was built for publication: Six-Card Secure AND and Four-Card Secure XOR