Hedged Public-Key Encryption: How to Protect against Bad Randomness
- 1 January 2009
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- Vol. 2012, 232-249
- https://doi.org/10.1007/978-3-642-10366-7_14
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Deterministic Encryption: Definitional Equivalences and Constructions without Random OraclesLecture Notes in Computer Science, 2008
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random OraclesLecture Notes in Computer Science, 2008
- Deterministic and Efficiently Searchable EncryptionPublished by Springer Science and Business Media LLC ,2007
- Does Privacy Require True Randomness?Published by Springer Science and Business Media LLC ,2007
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing ProofsLecture Notes in Computer Science, 2006
- Key-Privacy in Public-Key EncryptionLecture Notes in Computer Science, 2001
- Simplified OAEP for the RSA and Rabin FunctionsLecture Notes in Computer Science, 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
- Optimal asymmetric encryptionLecture Notes in Computer Science, 1995