Computationally Sound Formalization of Rerandomizable RCCA Secure Encryption
From MaRDI portal
Publication:3631375
DOI10.1007/978-3-642-02002-5_9zbMath1242.68103OpenAlexW1527725323MaRDI QIDQ3631375
Yusuke Kawamoto, Hideki Sakurada, Masami Hagiya
Publication date: 9 June 2009
Published in: Formal to Practical Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02002-5_9
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A computational interpretation of Dolev-Yao adversaries
- Reconciling two views of cryptography (The computational soundness of formal encryption)
- Rerandomizable RCCA Encryption
- On the security of public key protocols
- Programming Languages and Systems
- Computationally Sound Symbolic Secrecy in the Presence of Hash Functions
- Advances in Cryptology - CRYPTO 2003
- Theory of Cryptography
- Topics in Cryptology – CT-RSA 2004
- Theory of Cryptography
- Theory of Cryptography