Card-based overwriting protocol for equality function and applications
From MaRDI portal
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12) Other nonclassical models of computation (68Q09) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Cites work
- scientific article; zbMATH DE number 1024066 (Why is no real title available?)
- AND protocols using only uniform shuffles
- Another use of the five-card trick: card-minimal secure three-input majority function evaluation
- Card-based cryptographic protocols using a minimal number of cards
- Card-based protocols for any Boolean function
- Card-based protocols using triangle cards
- Computations with a deck of cards
- Efficient card-based protocols for generating a hidden random permutation without fixed points
- More Efficient Match-Making and Satisfiability The Five Card Trick
- Secure Multiparty Computations Using a Dial Lock
- Secure multiparty computations without computers
- Securely computing XOR with 10 cards
- Securely computing the \(n\)-variable equality function with \(2n\) cards
- Six-Card Secure AND and Four-Card Secure XOR
- The five-card trick can be done with four cards
- The landscape of computing symmetric n-variable functions with 2n cards
- The six-card trick: secure computation of three-input equality
- Theory and practice of natural computing. Second international conference, TPNC 2013, Cáceres, Spain, December 3--5, 2013. Proceedings
- Voting with a Logarithmic Number of Cards
This page was built for publication: Card-based overwriting protocol for equality function and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7013633)
