Efficient private PEZ protocols for symmetric functions

DOI10.1007/978-3-030-36030-6_15zbMath1452.68075OpenAlexW2989736963MaRDI QIDQ2175918

Mitsugu Iwamoto, Kazuo Ohta, Yoshiki Abe

Publication date: 30 April 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-36030-6_15

zbMATH Keywords

symmetric functionsthreshold functionsmulti-party computationprivate PEZ protocol

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)

Related Items (5)

How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition ⋮ 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

Cites Work

• Private computation using a PEZ dispenser.
• Card-Based Protocols for Any Boolean Function
• More Efficient Match-Making and Satisfiability The Five Card Trick

This page was built for publication: Efficient private PEZ protocols for symmetric functions