Card-based protocols imply PSM protocols

DOI10.4230/LIPICS.STACS.2025.72MaRDI QIDQ7287812zbMATH OpenFDO

Authors Kazumasa Shinagawa, Koji Nuida

Publication date 24 June 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2025.72

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A minimal model for secure computation (extended abstract)
• A note on the complexity of private simultaneous messages with many parties
• Card-based cryptographic protocols using a minimal number of cards
• Communication complexity of conditional disclosure of secrets and attribute-based encryption
• Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
• Fun with algorithms. 7th international conference, FUN 2014, Lipari Island, Sicily, Italy, July 1--3, 2014. Proceedings
• scientific article; zbMATH DE number 1024066 (Why is no real title available?)
• scientific article; zbMATH DE number 1033441 (Why is no real title available?)
• scientific article; zbMATH DE number 7650434 (Why is no real title available?)
• More Efficient Match-Making and Satisfiability The Five Card Trick
• Multi-party PSM, revisited: improved communication and unbalanced communication
• On the communication complexity of secure computation
• On the Cryptographic Complexity of the Worst Functions
• The communication complexity of private simultaneous messages, revisited
• The complexity of multiparty PSM protocols and related models
• The five-card trick can be done with four cards
• The minimum number of cards in practical card-based protocols
• The size of a share must be large

This page was built for publication: Card-based protocols imply PSM protocols

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