Efficient private PEZ protocols without binary-input restrictions

DOI10.1007/S10623-026-01876-0MaRDI QIDQ7297761zbMATH OpenFDO

Authors Yoshiki Abe, Mitsugu Iwamoto, Kazuo Ohta

Publication date 15 July 2026

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10623-026-01876-0

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• Card-based protocols for any Boolean function
• Efficient private PEZ protocols for symmetric functions
• scientific article; zbMATH DE number 1024066 (Why is no real title available?)
• Lower and upper bounds on the randomness complexity of private computations of AND
• More Efficient Match-Making and Satisfiability The Five Card Trick
• Private computation using a PEZ dispenser.
• Public-PEZ Cryptography

This page was built for publication: Efficient private PEZ protocols without binary-input restrictions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7297761)