Private computation using a PEZ dispenser.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 176546 (Why is no real title available?)
- scientific article; zbMATH DE number 1024066 (Why is no real title available?)
- scientific article; zbMATH DE number 1030984 (Why is no real title available?)
- scientific article; zbMATH DE number 1088898 (Why is no real title available?)
- A Randomness-Rounds Tradeoff in Private Computation
Cited in
(10)- How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition
- Public-PEZ Cryptography
- Efficient private PEZ protocols for symmetric functions
- Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles
- Practical card-based implementations of Yao's millionaire protocol
- Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle
- Hide a liar: card-based ZKP protocol for Usowan
- 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
- Six-Card Secure AND and Four-Card Secure XOR
This page was built for publication: Private computation using a PEZ dispenser.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1426438)