| Publication | Date of Publication | Type |
|---|
| Non-malleable codes for small-depth circuits | 2025-08-12 | Paper |
| Structural lower bounds on black-box constructions of pseudorandom functions | 2024-12-13 | Paper |
| scientific article; zbMATH DE number 7829244 (Why is no real title available?) | 2024-04-09 | Paper |
Correction to: ``Topology-hiding communication from minimal assumptions
Journal of Cryptology | 2023-10-25 | Paper |
Poly onions: achieving anonymity in the presence of churn
Theory of Cryptography | 2023-08-14 | Paper |
| Communication complexity with defective randomness | 2023-07-12 | Paper |
| Linear Threshold Secret-Sharing with Binary Reconstruction | 2023-07-03 | Paper |
| scientific article; zbMATH DE number 7650434 (Why is no real title available?) | 2023-02-03 | Paper |
| scientific article; zbMATH DE number 7650428 (Why is no real title available?) | 2023-02-03 | Paper |
| Non-malleability against polynomial tampering | 2022-12-07 | Paper |
| Unclonable polymers and their cryptographic applications | 2022-08-30 | Paper |
Two Party Distribution Testing: Communication and Security
(available as arXiv preprint) | 2022-07-21 | Paper |
| Topology-hiding communication from minimal assumptions | 2022-03-23 | Paper |
Lower Bounds for Oblivious Near-Neighbor Search
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
| A simple obfuscation scheme for pattern-matching with wildcards | 2020-06-30 | Paper |
| Public-key function-private hidden vector encryption (and more) | 2020-05-11 | Paper |
| Is information-theoretic topology-hiding computation possible? | 2020-04-30 | Paper |
| Non-malleable codes against bounded polynomial time tampering | 2020-02-04 | Paper |
| Mitigating the one-use restriction in attribute-based encryption | 2019-03-29 | Paper |
| Obfuscation from polynomial hardness: beyond decomposable obfuscation | 2018-10-17 | Paper |
| Hardness of non-interactive differential privacy from one-way functions | 2018-09-12 | Paper |
| Exploring the boundaries of topology-hiding computation | 2018-07-17 | Paper |
| Non-malleable codes from average-case hardness: \({\mathsf{A}}{\mathsf{C}}^0\), decision trees, and streaming space-bounded tampering | 2018-07-17 | Paper |
A black-box construction of non-malleable encryption from semantically secure encryption
Journal of Cryptology | 2018-04-26 | Paper |
Improved, black-box, non-malleable encryption from semantic security
Designs, Codes and Cryptography | 2018-04-06 | Paper |
Strong hardness of privacy from weak traitor tracing
Theory of Cryptography | 2016-12-21 | Paper |
One-way functions are essential for single-server private information retrieval
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Non-malleable codes for bounded depth, bounded fan-in circuits
Advances in Cryptology – EUROCRYPT 2016 | 2016-07-15 | Paper |
Secure multiparty computation of approximations
ACM Transactions on Algorithms | 2015-09-02 | Paper |
The power of negations in cryptography
Theory of Cryptography | 2015-07-06 | Paper |
Order-Preserving Encryption Secure Beyond One-Wayness
Lecture Notes in Computer Science | 2015-01-06 | Paper |
Can optimally-fair coin tossing be based on one-way functions?
Theory of Cryptography | 2014-02-18 | Paper |
Mercurial commitments with applications to zero-knowledge sets
Journal of Cryptology | 2013-06-27 | Paper |
Multi-party computation of polynomials and branching programs without simultaneous interaction
Advances in cryptology -- EUROCRYPT 2013. 32nd annual international conference on the theory and applications of cryptographic techniques, Athens, Greece, May 26--30, 2013. Proceedings | 2013-05-31 | Paper |
Secure computation for big data
Theory of Cryptography | 2013-03-18 | Paper |
Efficient robust private set intersection
International Journal of Applied Cryptography | 2012-11-16 | Paper |
Computational extractors and pseudorandomness
Theory of Cryptography | 2012-06-15 | Paper |
Secure multi-party computation of Boolean circuits with applications to privacy in on-line marketplaces
Lecture Notes in Computer Science | 2012-06-08 | Paper |
BiTR: built-in tamper resilience
Lecture Notes in Computer Science | 2011-12-02 | Paper |
Efficient circuit-size independent public key encryption with KDM security
Advances in Cryptology – EUROCRYPT 2011 | 2011-05-27 | Paper |
Optimal cryptographic hardness of learning monotone functions
Theory of Computing | 2011-05-24 | Paper |
Signatures resilient to continual leakage on memory and computation
Theory of Cryptography | 2011-05-19 | Paper |
On the Black-Box Complexity of Optimally-Fair Coin Tossing
Theory of Cryptography | 2011-05-19 | Paper |
How should we solve search problems privately?
Journal of Cryptology | 2010-03-01 | Paper |
Improved non-committing encryption with applications to adaptively secure protocols
Advances in Cryptology – ASIACRYPT 2009 | 2009-12-15 | Paper |
Secure multi-party computation minimizing online rounds
Advances in Cryptology – ASIACRYPT 2009 | 2009-12-15 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2009-05-14 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2009-05-14 | Paper |
A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks
Advances in Cryptology - EUROCRYPT 2009 | 2009-05-12 | Paper |
Private multiparty sampling and approximation of vector combinations
Theoretical Computer Science | 2009-04-29 | Paper |
How Should We Solve Search Problems Privately?
Advances in Cryptology - CRYPTO 2007 | 2009-03-10 | Paper |
Simple, Black-Box Constructions of Adaptively Secure Protocols
Theory of Cryptography | 2009-03-03 | Paper |
LP Decoding Corrects a Constant Fraction of Errors
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Optimal Cryptographic Hardness of Learning Monotone Functions
Automata, Languages and Programming | 2008-08-28 | Paper |
Two-Party Computing with Encrypted Data
Advances in Cryptology – ASIACRYPT 2007 | 2008-05-15 | Paper |
Mercurial Commitments with Applications to Zero-Knowledge Sets
Lecture Notes in Computer Science | 2008-05-06 | Paper |
Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
Theory of Cryptography | 2008-03-05 | Paper |
Private Multiparty Sampling and Approximation of Vector Combinations
Automata, Languages and Programming | 2007-11-28 | Paper |
Advances in Cryptology - EUROCRYPT 2004
Lecture Notes in Computer Science | 2007-09-25 | Paper |
Towards a Separation of Semantic and CCA Security for Public Key Encryption
Theory of Cryptography | 2007-08-30 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2007-02-12 | Paper |
| scientific article; zbMATH DE number 5009196 (Why is no real title available?) | 2006-03-01 | Paper |
Adaptive versus non-adaptive security of multi-party protocols
Journal of Cryptology | 2004-10-01 | Paper |
Reducing the servers' computation in private information retrieval: PIR with preprocessing
Journal of Cryptology | 2004-09-27 | Paper |
| scientific article; zbMATH DE number 2086721 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 1775399 (Why is no real title available?) | 2002-09-17 | Paper |
| scientific article; zbMATH DE number 1759771 (Why is no real title available?) | 2002-07-28 | Paper |
| scientific article; zbMATH DE number 1754645 (Why is no real title available?) | 2002-06-12 | Paper |
| scientific article; zbMATH DE number 1722683 (Why is no real title available?) | 2002-03-21 | Paper |
Protecting data privacy in private information retrieval schemes
Journal of Computer and System Sciences | 2000-08-27 | Paper |
| scientific article; zbMATH DE number 1418289 (Why is no real title available?) | 2000-07-26 | Paper |
| scientific article; zbMATH DE number 1304090 (Why is no real title available?) | 1999-06-17 | Paper |
