How Secure is Deterministic Encryption?
- 17 March 2015
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 38 references indexed in Scilit:
- Instantiating Random Oracles via UCEsLecture Notes in Computer Science, 2013
- Standard Security Does Not Imply Security against Selective-OpeningLecture Notes in Computer Science, 2012
- Hedged Public-Key Encryption: How to Protect against Bad RandomnessLecture Notes in Computer Science, 2009
- Deterministic Encryption: Definitional Equivalences and Constructions without Random OraclesLecture Notes in Computer Science, 2008
- Deterministic and Efficiently Searchable EncryptionPublished by Springer Science and Business Media LLC ,2007
- Cryptographic Protocols Provably Secure Against Dynamic AdversariesPublished by Springer Science and Business Media LLC ,2001
- Public-Key Encryption in a Multi-user Setting: Security Proofs and ImprovementsLecture Notes in Computer Science, 2000
- Extended Notions of Security for Multicast Public Key CryptosystemsLecture Notes in Computer Science, 2000
- Relations among notions of security for public-key encryption schemesPublished by Springer Science and Business Media LLC ,1998
- Plug and play encryptionLecture Notes in Computer Science, 1997