Balance-based cryptography: physically computing any Boolean function

DOI10.1007/978-3-032-15641-9_5MaRDI QIDQ7348921zbMATH OpenFDO

Authors Suthee Ruangwises

Publication date 15 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-15641-9_5

Mathematics Subject Classification ID

Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07) Other nonclassical models of computation (68Q09) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites work

• Another use of the five-card trick: card-minimal secure three-input majority function evaluation
• Card-based protocols for any Boolean function
• Efficient private PEZ protocols for symmetric functions
• scientific article; zbMATH DE number 1294428 (Why is no real title available?)
• More Efficient Match-Making and Satisfiability The Five Card Trick
• Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol
• Private computation using a PEZ dispenser.
• Public-PEZ Cryptography
• Secure computation without computers
• Secure Multiparty Computations Using a Dial Lock
• Securely computing the \(n\)-variable equality function with \(2n\) cards
• Six-Card Secure AND and Four-Card Secure XOR
• The landscape of computing symmetric n-variable functions with 2n cards
• The landscape of optimal card-based protocols
• Theory and practice of natural computing. Second international conference, TPNC 2013, Cáceres, Spain, December 3--5, 2013. Proceedings

This page was built for publication: Balance-based cryptography: physically computing any Boolean function

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