Public-PEZ Cryptography
From MaRDI portal
Recommendations
Cited in
(7)- Private computation using a PEZ dispenser.
- Efficient private PEZ protocols for symmetric functions
- Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle
- Computational and Information Science
- Card-minimal protocols for symmetric Boolean functions of more than seven inputs
- Secure computations through checking suits of playing cards
- Balance-based cryptography: physically computing any Boolean function
This page was built for publication: Public-PEZ Cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488002)