Breaking an efficient anonymous channel

DOI10.1007/BFB0053448MaRDI QIDQ4365752zbMATH OpenFDO

Authors Birgit Pfitzmann

Publication date 26 January 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0053448

zbMATH Keywords

all/nothing election schemeanonymous channelcryptographic protocolsmix-net

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Fault tolerant anonymous channel
• Selected Areas in Cryptography
• Fast and unconditionally secure anonymous channel
• Breaking Four Mix-Related Schemes Based on Universal Re-encryption
• Financial Cryptography

Cited in

(6)

• A secure and efficient authentication protocol for anonymous channel in wireless communications
• A Commitment-Consistent Proof of a Shuffle
• Fault tolerant anonymous channel
• Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security
• Electronic jury voting protocols
• cMix: mixing with minimal real-time asymmetric cryptographic operations

This page was built for publication: Breaking an efficient anonymous channel

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