Resisting Randomness Subversion: Fast Deterministic and Hedged Public-Key Encryption in the Standard Model
- 14 April 2015
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableKeywords
This publication has 42 references indexed in Scilit:
- How Secure is Deterministic Encryption?Lecture Notes in Computer Science, 2015
- On the Impossibility of Cryptography with Tamperable RandomnessLecture Notes in Computer Science, 2014
- Cryptography from Compression Functions: The UCE Bridge to the ROMLecture Notes in Computer Science, 2014
- Security of Symmetric Encryption against Mass SurveillanceLecture Notes in Computer Science, 2014
- Identity-Based (Lossy) Trapdoor Functions and ApplicationsLecture 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
- On the (Im)possibility of Obfuscating ProgramsLecture Notes in Computer Science, 2001
- Random oracles are practicalPublished by Association for Computing Machinery (ACM) ,1993