Computationally Sound Formalization of Rerandomizable RCCA Secure Encryption
From MaRDI portal
Publication:3631375
DOI10.1007/978-3-642-02002-5_9zbMATH Open1242.68103OpenAlexW1527725323MaRDI QIDQ3631375FDOQ3631375
Authors: 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Advances in Cryptology - CRYPTO 2003
- On the security of public key protocols
- Reconciling two views of cryptography (The computational soundness of formal encryption)
- Programming Languages and Systems
- Computationally Sound Symbolic Secrecy in the Presence of Hash Functions
- A computational interpretation of Dolev-Yao adversaries
- Theory of Cryptography
- Theory of Cryptography
- Title not available (Why is that?)
- Topics in Cryptology – CT-RSA 2004
- Title not available (Why is that?)
- Rerandomizable RCCA Encryption
- Theory of Cryptography
Cited In (6)
- Computing OR on a randomized fixed adversary CRCW PRAM
- Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption
- Soundness of Formal Encryption in the Presence of Key-Cycles
- Receiver-anonymity in rerandomizable RCCA-secure cryptosystems resolved
- Structure-preserving and re-randomizable RCCA-secure public key encryption and its applications
- Rerandomizable RCCA Encryption
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)
