Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
Top Cited Papers
- 1 January 2009
- 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 45 references indexed in Scilit:
- OAEP Is Secure under Key-Dependent MessagesLecture Notes in Computer Science, 2008
- Key-dependent Message Security under Active Attacks--BRSIM/UC-Soundness of Symbolic Encryption with Key Cycles20th IEEE Computer Security Foundations Symposium (CSF'07), 2007
- Cryptography with Constant Input LocalityLecture Notes in Computer Science, 2007
- On Pseudorandom Generators with Linear Stretch in NC0Lecture Notes in Computer Science, 2006
- Cryptography in $NC^0$SIAM Journal on Computing, 2006
- Soundness of Formal Encryption in the Presence of Key-CyclesLecture Notes in Computer Science, 2005
- More on average case vs approximation complexityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Noise-tolerant learning, the parity problem, and the statistical query modelJournal of the ACM, 2003
- Encryption-Scheme Security in the Presence of Key-Dependent MessagesLecture Notes in Computer Science, 2003
- Cryptographic Primitives Based on Hard Learning ProblemsLecture Notes in Computer Science, 1994