| Publication | Date of Publication | Type |
|---|
| Interactive coding with small memory | 2024-05-14 | Paper |
SNARGs for monotone policy batch NP
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-08 | Paper |
Circuits resilient to short-circuit errors
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Interactive error correcting codes over binary erasure channels resilient to > ½ adversarial corruption
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Verifiable private information retrieval
Theory of Cryptography | 2023-08-14 | Paper |
Constructive post-quantum reductions
Advances in Cryptology – CRYPTO 2022 | 2023-06-30 | Paper |
Succinct classical verification of quantum computation
Advances in Cryptology – CRYPTO 2022 | 2023-06-28 | Paper |
Succinct classical verification of quantum computation
Advances in Cryptology – CRYPTO 2022 | 2023-06-28 | Paper |
| Somewhere statistical soundness, post-quantum security, and SNARGs | 2023-03-31 | Paper |
| scientific article; zbMATH DE number 7650355 (Why is no real title available?) | 2023-02-03 | Paper |
| Delegation with updatable unambiguous proofs and PPAD-hardness | 2022-12-07 | Paper |
Efficient Multiparty Interactive Coding—Part II: Non-Oblivious Noise
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
How to Delegate Computations: The Power of No-Signaling Proofs
Journal of the ACM | 2022-03-31 | Paper |
| Low error efficient computational extractors in the CRS model | 2021-12-01 | Paper |
A lower bound for adaptively-secure collective coin flipping protocols
Combinatorica | 2021-09-22 | Paper |
Efficient Multiparty Interactive Coding—Part I: Oblivious Insertions, Deletions and Substitutions
IEEE Transactions on Information Theory | 2021-07-23 | Paper |
Efficient Multiparty Interactive Coding for Insertions, Deletions, and Substitutions
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Non-signaling proofs with o(√ log n) provers are in PSPACE
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
DELEGATING COMPUTATION VIA NO-SIGNALING STRATEGIES
Proceedings of the International Congress of Mathematicians (ICM 2018) | 2020-09-22 | Paper |
| Fully homomorphic NIZK and NIWI proofs | 2020-04-30 | Paper |
| Non-interactive non-malleability from quantum supremacy | 2020-03-09 | Paper |
How to delegate computations publicly
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Multi-collision resistance: a paradigm for keyless hash functions
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Succinct delegation for low-space non-deterministic computation
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
| Promise zero knowledge and its applications to round optimal MPC | 2018-09-26 | Paper |
Compressing communication in distributed protocols
(available as arXiv preprint) | 2018-08-24 | Paper |
Delegating computation: interactive proofs for muggles
Journal of the ACM | 2018-08-02 | Paper |
| Statistical witness indistinguishability (and more) in two messages | 2018-07-17 | Paper |
| Succinct spooky free compilers are not black box sound | 2018-02-23 | Paper |
On virtual grey box obfuscation for general circuits
Algorithmica | 2018-01-05 | Paper |
| Distinguisher-dependent simulation in two rounds and its applications | 2017-11-15 | Paper |
| From obfuscation to the security of Fiat-Shamir for proofs | 2017-11-15 | Paper |
Interactive coding for multiparty protocols
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
On the space complexity of linear programming with preprocessing
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
Cryptographic assumptions: a position paper
Theory of Cryptography | 2016-03-23 | Paper |
Arguments of proximity (extended abstract)
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Adaptively secure coin-flipping, revisited
Automata, Languages, and Programming | 2015-11-04 | Paper |
Fast interactive coding against adversarial noise
Journal of the ACM | 2015-08-14 | Paper |
On obfuscation with random oracles
Theory of Cryptography | 2015-07-06 | Paper |
How to delegate computations
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
On cryptography with auxiliary input
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
On virtual grey box obfuscation for general circuits
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
The impossibility of obfuscation with auxiliary input or a universal simulator
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
Delegation for bounded space
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Leakage-resilient coin tossing
Distributed Computing | 2014-07-11 | Paper |
Protecting obfuscation against algebraic attacks
Advances in Cryptology – EUROCRYPT 2014 | 2014-05-27 | Paper |
Multiparty computation secure against continual memory leakage
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Securing circuits and protocols against \(1/\mathrm{poly}(k)\) tampering rate
Theory of Cryptography | 2014-02-18 | Paper |
Obfuscation for evasive functions
Theory of Cryptography | 2014-02-18 | Paper |
How to run Turing machines on encrypted data
Advances in Cryptology – CRYPTO 2013 | 2013-09-17 | Paper |
Secure computation against adaptive auxiliary information
Advances in Cryptology – CRYPTO 2013 | 2013-09-02 | Paper |
Why ``Fiat-Shamir for proofs lacks a proof
Theory of Cryptography | 2013-03-18 | Paper |
Securing circuits against constant-rate tampering
Lecture Notes in Computer Science | 2012-09-25 | Paper |
A parallel repetition theorem for leakage resilience
Theory of Cryptography | 2012-06-15 | Paper |
Smooth projective hashing and two-message oblivious transfer
Journal of Cryptology | 2012-05-23 | Paper |
Program obfuscation with leaky hardware
Lecture Notes in Computer Science | 2011-12-02 | Paper |
Leakage-Resilient Coin Tossing
Lecture Notes in Computer Science | 2011-10-28 | Paper |
Memory delegation
Advances in Cryptology – CRYPTO 2011 | 2011-08-12 | Paper |
Cryptography with tamperable and leaky memory
Advances in Cryptology – CRYPTO 2011 | 2011-08-12 | Paper |
Black-box circular-secure encryption beyond affine functions
Theory of Cryptography | 2011-05-19 | Paper |
Concurrent general composition of secure protocols in the timing model
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Public-key encryption schemes with auxiliary inputs
Theory of Cryptography | 2010-02-24 | Paper |
On symmetric encryption and point obfuscation
Theory of Cryptography | 2010-02-24 | Paper |
Probabilistically Checkable Arguments
Advances in Cryptology - CRYPTO 2009 | 2009-10-20 | Paper |
One-Time Programs
Lecture Notes in Computer Science | 2009-02-10 | Paper |
| scientific article; zbMATH DE number 5485522 (Why is no real title available?) | 2009-01-05 | Paper |
Interactive PCP
Automata, Languages and Programming | 2008-08-19 | Paper |
Smooth Projective Hashing and Two-Message Oblivious Transfer
Lecture Notes in Computer Science | 2008-05-06 | Paper |
Concurrent composition of secure protocols in the timing model
Journal of Cryptology | 2007-12-06 | Paper |
