On the learnability of discrete distributions
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Being taught can be faster than asking questions
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Evaluation may be easier than generation (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On the Minimal Hardware Complexity of Pseudorandom Function Generators
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Fast Correlation Attacks through Reconstruction of Linear Polynomials
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
On Distribution-Specific Learning with Membership Queries versus Pseudorandom Generation
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Secure Human Identification Protocols
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Finding Relevant Variables in PAC Model with Membership Queries
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
Security Parallels between People and Pervasive Devices
PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
On agnostic boosting and parity learning
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
On Pseudorandom Generators with Linear Stretch in NC0
Computational Complexity
A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Separating Models of Learning with Faulty Teachers
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Oblivious Transfer Based on the McEliece Assumptions
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Separating models of learning with faulty teachers
Theoretical Computer Science
Simultaneous Hardcore Bits and Cryptography against Memory Attacks
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
On cryptography with auxiliary input
Proceedings of the forty-first annual ACM symposium on Theory of computing
On lattices, learning with errors, random linear codes, and cryptography
Journal of the ACM (JACM)
Cryptography with constant input locality
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Efficient cryptographic protocols based on the hardness of learning parity with noise
Cryptography and Coding'07 Proceedings of the 11th IMA international conference on Cryptography and coding
Public-key cryptography from different assumptions
Proceedings of the forty-second ACM symposium on Theory of computing
Efficient receipt-free ballot casting resistant to covert channels
EVT/WOTE'09 Proceedings of the 2009 conference on Electronic voting technology/workshop on trustworthy elections
Towards non-black-box lower bounds in cryptography
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Efficient authentication from hard learning problems
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
New algorithms for learning in presence of errors
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Fully homomorphic encryption from ring-LWE and security for key dependent messages
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Cryptography in constant parallel time
Cryptography in constant parallel time
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Efficient shared-key authentication scheme from any weak pseudorandom function
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Authenticating pervasive devices with human protocols
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
On ideal lattices and learning with errors over rings
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
On pseudorandom generators with linear stretch in NC0
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Parallel and concurrent security of the HB and HB+ protocols
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Cryptography from learning parity with noise
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On learning finite-state quantum sources
Quantum Information & Computation
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Trapdoors for lattices: simpler, tighter, faster, smaller
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Lapin: an efficient authentication protocol based on Ring-LPN
FSE'12 Proceedings of the 19th international conference on Fast Software Encryption
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Commitments and efficient zero-knowledge proofs from learning parity with noise
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Garbling XOR gates "for free" in the standard model
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Solving the learning parity with noise's open question
Information Processing Letters
On Ideal Lattices and Learning with Errors over Rings
Journal of the ACM (JACM)
Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
Proceedings of the 5th conference on Innovations in theoretical computer science
Candidate weak pseudorandom functions in AC0 ○ MOD2
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |