Private computation using a PEZ dispenser.

DOI10.1016/S0304-3975(03)00210-XzbMath1059.68038OpenAlexW2060863072MaRDI QIDQ1426438

Yuval Ishai, Eyal Kushilevitz, József Balogh, János A. Csirik

Publication date: 14 March 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00210-x

zbMATH Keywords

Cryptographic protocolsMathematical gamesPrivate computation

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Related Items (9)

How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition ⋮ Six-Card Secure AND and Four-Card Secure XOR ⋮ Efficient private PEZ protocols for symmetric functions ⋮ Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle ⋮ Card-minimal protocols for symmetric Boolean functions of more than seven inputs ⋮ Hide a liar: card-based ZKP protocol for Usowan ⋮ Another use of the five-card trick: card-minimal secure three-input majority function evaluation ⋮ Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles ⋮ Practical card-based implementations of Yao's millionaire protocol

Cites Work

• A Randomness-Rounds Tradeoff in Private Computation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Private computation using a PEZ dispenser.