Breaking Four Mix-Related Schemes Based on Universal Re-encryption

DOI10.1007/11836810_4MaRDI QIDQ3506876zbMATH OpenOpenAlexFDO

Authors George Danezis

Publication date 17 June 2008

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

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

zbMATH Keywords

anonymous communicationsre-encryption mix networkstraffic analysisUniversal re-encryption

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Topics in Cryptology – CT-RSA 2004
• Semantically secure anonymity: foundations of re-encryption
• Universal re-encryption of signatures and controlling anonymous information flow
• Theory of Cryptography
• scientific article; zbMATH DE number 2043308

Cited in

(5)

• Semantically secure anonymity: foundations of re-encryption
• Reconciling non-malleability with homomorphic encryption
• Universal re-encryption of signatures and controlling anonymous information flow
• Breaking an efficient anonymous channel
• Topics in Cryptology – CT-RSA 2004

This page was built for publication: Breaking Four Mix-Related Schemes Based on Universal Re-encryption

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