Computationally Sound Formalization of Rerandomizable RCCA Secure Encryption
From MaRDI portal
Publication:3631375
Recommendations
Cites work
- scientific article; zbMATH DE number 2081087 (Why is no real title available?)
- scientific article; zbMATH DE number 2086700 (Why is no real title available?)
- scientific article; zbMATH DE number 1842499 (Why is no real title available?)
- scientific article; zbMATH DE number 2242582 (Why is no real title available?)
- A computational interpretation of Dolev-Yao adversaries
- Advances in Cryptology - CRYPTO 2003
- Computationally Sound Symbolic Secrecy in the Presence of Hash Functions
- On the security of public key protocols
- Programming Languages and Systems
- Reconciling two views of cryptography (The computational soundness of formal encryption)
- Rerandomizable RCCA Encryption
- Theory of Cryptography
- Theory of Cryptography
- Theory of Cryptography
- Topics in Cryptology – CT-RSA 2004
Cited in
(6)- Receiver-anonymity in rerandomizable RCCA-secure cryptosystems resolved
- Structure-preserving and re-randomizable RCCA-secure public key encryption and its applications
- Computing OR on a randomized fixed adversary CRCW PRAM
- Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption
- Rerandomizable RCCA Encryption
- Soundness of Formal Encryption in the Presence of Key-Cycles
This page was built for publication: Computationally Sound Formalization of Rerandomizable RCCA Secure Encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3631375)