Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
Authors:
- 20 August 2008
- book chapter
- Published by Springer Nature
- p. 360-378
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles2008
- Deterministic and Efficiently Searchable Encryption2007
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs2006
- Public Key Encryption with Keyword Search2004
- An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information2000
- Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements2000
- Non-malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization1999
- Random oracles are practical1993
- A Simple Unpredictable Pseudo-Random Number GeneratorSIAM Journal on Computing, 1986
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984