Collusion-free protocols

DOI10.1145/1060590.1060671MaRDI QIDQ3581451zbMATH OpenOpenAlexFDO

Authors Matt Lepinksi, Silvio Micali, Abhi Shelat

Publication date 16 August 2010

Published in Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1060590.1060671

Mathematics Subject Classification ID

Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Collusion-preserving computation
• Collusion-Free Protocols in the Mediated Model
• Collusion-Free Multiparty Computation in the Mediated Model
• A collusion problem and its solution
• Dining cryptographers with 0.924 verifiable collision resolution

Cited in

(13)

• Blackwell's comparison of experiments and discounted repeated games
• Utility dependence in correct and fair rational secret sharing
• Message transmission with reverse firewalls -- secure communication on corrupted machines
• Collusion-preserving computation
• Cryptographic reverse firewall via malleable smooth projective hash functions
• scientific article; zbMATH DE number 2089339 (Why is no real title available?)
• Efficient rational secret sharing in standard communication networks
• A Compiler of Two-Party Protocols for Composable and Game-Theoretic Security, and Its Application to Oblivious Transfer
• Collusion-Free Protocols in the Mediated Model
• Cryptography and Game Theory: Designing Protocols for Exchanging Information
• Individual cryptography
• Steganography-free zero-knowledge
• Strong secret sharing with snitching

This page was built for publication: Collusion-free protocols

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