Non-malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization
- 16 December 1999
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 519-536
- https://doi.org/10.1007/3-540-48405-1_33
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Public-key cryptography and password protocolsPublished by Association for Computing Machinery (ACM) ,1998
- A modular approach to the design and analysis of authentication and key exchange protocols (extended abstract)Published by Association for Computing Machinery (ACM) ,1998
- A uniform-complexity treatment of encryption and zero-knowledgeJournal of Cryptology, 1993
- Non-malleable cryptographyPublished by Association for Computing Machinery (ACM) ,1991
- Public-key cryptosystems provably secure against chosen ciphertext attacksPublished by Association for Computing Machinery (ACM) ,1990
- The Notion of Security for Probabilistic CryptosystemsSIAM Journal on Computing, 1988
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- Theory and application of trapdoor functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982