The landscape of optimal card-based protocols

MaRDI QIDQ7231688zbMATH OpenFDO

Authors Alexander K. Koch

Publication date 22 April 2026

Published in Mathematical Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://journals.flvc.org/mathcryptology/article/view/130529

zbMATH Keywords

card-based protocolscommitted formatcryptography without computerssecure computation

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Partitions of sets (05A18) Group actions on combinatorial structures (05E18) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorics on words (68R15) Cryptography (94A60)

Cites work

• AND protocols using only uniform shuffles
• Card-based cryptographic protocols using a minimal number of cards
• Card-based cryptography meets formal verification
• Card-based protocols using unequal division shuffles
• Efficient and secure multiparty computations using a standard deck of playing cards
• Foundations for actively secure card-based cryptography
• scientific article; zbMATH DE number 1339969 (Why is no real title available?)
• scientific article; zbMATH DE number 894528 (Why is no real title available?)
• More Efficient Match-Making and Satisfiability The Five Card Trick
• Six-Card Secure AND and Four-Card Secure XOR
• The minimum number of cards in practical 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: The landscape of optimal card-based protocols

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