Foundations for actively secure card-based cryptography
From MaRDI portal
Recommendations
- A single shuffle is enough for secure card-based computation of any Boolean circuit
- How to implement a non-uniform or non-closed shuffle
- Card-based cryptographic protocols using a minimal number of cards
- The minimum number of cards in practical card-based protocols
- Card-based protocols using unequal division shuffles
Cited in
(30)- Analysis of information leakage due to operative errors in card-based protocols
- How to implement a non-uniform or non-closed shuffle
- Interactive physical ZKP for connectivity: applications to Nurikabe and Hitori
- An improved physical ZKP for Nonogram
- A single shuffle is enough for secure card-based computation of any Boolean circuit
- Practical card-based implementations of Yao's millionaire protocol
- Two standard decks of playing cards are sufficient for a ZKP for Sudoku
- A fast mental poker protocol
- scientific article; zbMATH DE number 5575521 (Why is no real title available?)
- scientific article; zbMATH DE number 1941259 (Why is no real title available?)
- Who holds the best card? Secure communication of optimal secret bits
- Securely computing the \(n\)-variable equality function with \(2n\) cards
- Physical ZKP protocols for Nurimisaki and Kurodoko
- Card-minimal protocols for three-input functions with standard playing cards
- Hide a liar: card-based ZKP protocol for Usowan
- Actively revealing card attack on card-based protocols
- Physical zero-knowledge proof for ball sort puzzle
- Card-based ZKP protocol for Nurimisaki
- Card-Based Secure Sorting Protocol
- Physically verifying the first nonzero term in a sequence: physical ZKPs for ABC End View and Goishi Hiroi
- Single-shuffle card-based protocols with six cards per gate
- Verifying the first nonzero term: physical ZKPs for ABC end view, Goishi Hiroi, and Toichika
- Practical construction for secure trick-taking games even with cards set aside
- Physical zero-knowledge proofs for Five Cells
- Efficient AND protocols resistant to maliciously revealing a single card
- Tatami printer: physical ZKPs for Tatami puzzles
- Card-based cryptography meets 3D printer
- Barrington plays cards: the complexity of card-based protocols
- The landscape of optimal card-based protocols
- How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition
This page was built for publication: Foundations for actively secure card-based cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487589)
