Rerandomizable and Replayable Adaptive Chosen Ciphertext Attack Secure Cryptosystems
Author:
- 1 January 2004
- book chapter
- Published by Springer Nature
- p. 152-170
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions2003
- Relaxing Chosen-Ciphertext Security2003
- On the Security of Joint Signature and Encryption2002
- Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption2002
- Generic Lower Bounds for Root Extraction and Signature Schemes in General Groups2002
- Nonmalleable CryptographySIAM Journal on Computing, 2000
- Non-malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization1999
- Lower Bounds for Discrete Logarithms and Related Problems1997
- Algorithms for Black-Box Fields and their Application to Cryptography1996
- Public-key cryptosystems provably secure against chosen ciphertext attacks1990