Card-Based Cryptographic Protocols Using a Minimal Number of Cards
From MaRDI portal
Publication:2811157
DOI10.1007/978-3-662-48797-6_32zbMATH Open1353.94081OpenAlexW2293137013MaRDI QIDQ2811157FDOQ2811157
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
Cited In (30)
- How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition
- Card-based ZKP protocols for Takuzu and Juosan
- Foundations for actively secure card-based cryptography
- Title not available (Why is that?)
- Single-shuffle card-based protocol with eight cards per gate
- Card-based cryptographic protocols for three-input functions using private operations
- A secure three-input and protocol with a standard deck of minimal cards
- Actively revealing card attack on card-based protocols
- A single shuffle is enough for secure card-based computation of any Boolean circuit
- Practical card-based implementations of Yao's millionaire protocol
- The landscape of computing symmetric \(n\)-variable functions with \(2n\) cards
- Securely computing the \(n\)-variable equality function with \(2n\) cards
- Secure computations through checking suits of playing cards
- A secure additive protocol for card players
- Card-based protocols using unequal division shuffles
- Information leakage due to operative errors in card-based protocols
- Committed-format AND protocol using only random cuts
- Card-based ZKP protocol for Nurimisaki
- Card-Based Secure Sorting Protocol
- Card-minimal protocols for three-input functions with standard playing cards
- Another use of the five-card trick: card-minimal secure three-input majority function evaluation
- Card-minimal protocols for symmetric Boolean functions of more than seven inputs
- A card-minimal three-input and protocol using two shuffles
- Secure grouping protocol using a deck of cards
- Card-based protocol against actively revealing card attack
- Multi-party computation based on physical coins
- Two UNO decks efficiently perform zero-knowledge proof for Sudoku
- Single-shuffle card-based protocols with six cards per gate
- Title not available (Why is that?)
- Card-based cryptographic protocols with a standard deck of cards using private operations
This page was built for publication: Card-Based Cryptographic Protocols Using a Minimal Number of Cards
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811157)
