Card-based cryptography meets 3D printer
From MaRDI portal
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
- A single shuffle is enough for secure card-based computation of any Boolean circuit
- Card-based cryptographic protocols using a minimal number of cards
- Card-based protocols using unequal division shuffles
- Foundations for actively secure card-based cryptography
- More Efficient Match-Making and Satisfiability The Five Card Trick
- Multi-party computation with small shuffle complexity using regular polygon cards
- Securely computing the \(n\)-variable equality function with \(2n\) cards
- Six-Card Secure AND and Four-Card Secure XOR
- Towards user-friendly cryptography
This page was built for publication: Card-based cryptography meets 3D printer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7013627)