Identity-based encryption for fair anonymity applications: defining, implementing, and applying rerandomizable RCCA-secure IBE
From MaRDI portal
Publication:6157526
Recommendations
Cites work
- scientific article; zbMATH DE number 2086698 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- A Formal Treatment of Onion Routing
- Advances in Cryptology - CRYPTO 2003
- Constructive cryptography -- a new paradigm for security definitions and proofs
- Cryptographic reverse firewall via malleable smooth projective hash functions
- Cryptographic reverse firewalls
- Identity-based cryptosystems and signature schemes
- Improving the efficiency of re-randomizable and replayable CCA secure public key encryption
- Malleable proof systems and applications
- Message transmission with reverse firewalls -- secure communication on corrupted machines
- OAEP 3-Round:A Generic and Secure Asymmetric Encryption Padding
- Practical Identity-Based Encryption Without Random Oracles
- Receiver-anonymity in rerandomizable RCCA-secure cryptosystems resolved
- Rerandomizable RCCA Encryption
- Revisiting (R)CCA security and replay protection
- SOFSEM 2005: Theory and Practice of Computer Science
- Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts
- Structure-preserving and re-randomizable RCCA-secure public key encryption and its applications
- Theory of Cryptography
- Topics in Cryptology – CT-RSA 2004
Cited in
(3)
This page was built for publication: Identity-based encryption for fair anonymity applications: defining, implementing, and applying rerandomizable RCCA-secure IBE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157526)