Topics in Cryptology – CT-RSA 2004

DOI10.1007/b95630zbMath1196.94053MaRDI QIDQ5901693

Paul Syverson, Ari Juels, Markus Jakobsson, Philippe Golle

Publication date: 7 May 2009

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

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

zbMATH Keywords

anonymity; universal re-encryption; mix networks; private channels

Mathematics Subject Classification ID

94A60: Cryptography

94A62: Authentication, digital signatures and secret sharing

Related Items

Chosen-Ciphertext Secure Proxy Re-encryption without Pairings, Identity-based encryption for fair anonymity applications: defining, implementing, and applying rerandomizable RCCA-secure IBE, Anonymous random allocation and its applications, Chosen-ciphertext secure bidirectional proxy re-encryption schemes without pairings, Receiver-anonymity in rerandomizable RCCA-secure cryptosystems resolved, Generic plaintext equality and inequality proofs, Improving the efficiency of re-randomizable and replayable CCA secure public key encryption, Reconciling non-malleability with homomorphic encryption, Practical Fault-Tolerant Data Aggregation, Access Control Encryption: Enforcing Information Flow with Cryptography, A Robust Conditional Privacy-Preserving Authentication Protocol in VANET, Computationally Sound Formalization of Rerandomizable RCCA Secure Encryption