An optimally robust hybrid mix network

DOI10.1145/383962.384046MaRDI QIDQ2787693zbMATH OpenOpenAlexWikidataFDO

Authors Markus Jakobsson, Ari Juels

Publication date 4 March 2016

Published in Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1583778
• scientific article; zbMATH DE number 2043308
• How to break a practical MIX and design a new one
• Selected Areas in Cryptography
• scientific article; zbMATH DE number 1303141

Cited in

(5)

• scientific article; zbMATH DE number 1583778 (Why is no real title available?)
• Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security
• Public Key Cryptography – PKC 2004
• Electronic jury voting protocols
• cMix: mixing with minimal real-time asymmetric cryptographic operations

This page was built for publication: An optimally robust hybrid mix network

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