Complete characterization of security notions for probabilistic private-key encryption
- 1 May 2000
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 245-254
- https://doi.org/10.1145/335305.335335
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- A Pseudorandom Generator from any One-way FunctionSIAM Journal on Computing, 1999
- Non-interactive and non-malleable commitmentPublished by Association for Computing Machinery (ACM) ,1998
- Pseudorandomness and Cryptographic ApplicationsPublished by Walter de Gruyter GmbH ,1996
- 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
- One-way functions are essential for complexity based cryptographyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- The Notion of Security for Probabilistic CryptosystemsSIAM Journal on Computing, 1988
- How to construct random functionsJournal of the ACM, 1986
- Probabilistic encryptionJournal of Computer and System Sciences, 1984