scientific article; zbMATH DE number 1303141

zbMATH Open0929.68065MaRDI QIDQ4249657FDOQ4249657

Authors: Markus Jakobsson 

Publication date: 17 June 1999

Title of this publication is not available (Why is that?)

Recommendations

• How to break a practical MIX and design a new one
• Selected Areas in Cryptography
• Theory of Cryptography
• A Sender Verifiable Mix-Net and a New Proof of a Shuffle
• scientific article; zbMATH DE number 2043308

zbMATH Keywords

decryption mix-network

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Cited In (11)

• New receipt-free voting scheme using double-trapdoor commitment
• The mix rule
• Robust encryption
• Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
• Electronic jury voting protocols
• Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security
• A verifiable secret shuffle of homomorphic encryptions
• Spreading alerts quietly and the subgroup escape problem
• \(k\)-anonymous data collection
• Title not available (Why is that?)
• An optimally robust hybrid mix network

This page was built for publication:

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