Card-Based Cryptographic Protocols Using a Minimal Number of Cards
From MaRDI portal
Publication:2811157
DOI10.1007/978-3-662-48797-6_32zbMath1353.94081OpenAlexW2293137013MaRDI QIDQ2811157
Alexander K. Koch, Kevin Härtel, Stefan Walzer
Publication date: 10 June 2016
Published in: Advances in Cryptology -- ASIACRYPT 2015 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-48797-6_32
Related Items (18)
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 ⋮ Information leakage due to operative errors in card-based protocols ⋮ Multi-party computation based on physical coins ⋮ 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 ⋮ Actively revealing card attack on card-based protocols ⋮ Single-shuffle card-based protocol with eight cards per gate ⋮ Another use of the five-card trick: card-minimal secure three-input majority function evaluation ⋮ Secure computations through checking suits of playing cards ⋮ A card-minimal three-input and protocol using two shuffles ⋮ A single shuffle is enough for secure card-based computation of any Boolean circuit ⋮ Securely computing the \(n\)-variable equality function with \(2n\) cards ⋮ Practical card-based implementations of Yao's millionaire protocol ⋮ 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
This page was built for publication: Card-Based Cryptographic Protocols Using a Minimal Number of Cards
