| Publication | Date of Publication | Type |
|---|
| SNARGs for monotone policy batch NP | 2024-02-02 | Paper |
| SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption | 2023-12-08 | Paper |
| Circuits resilient to short-circuit errors | 2023-12-08 | Paper |
| Interactive error correcting codes over binary erasure channels resilient to > ½ adversarial corruption | 2023-12-08 | Paper |
| SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE | 2023-11-14 | Paper |
| Verifiable private information retrieval | 2023-08-14 | Paper |
| Constructive post-quantum reductions | 2023-06-30 | Paper |
| Succinct classical verification of quantum computation | 2023-06-28 | Paper |
| Somewhere statistical soundness, post-quantum security, and SNARGs | 2023-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875700 | 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 | 2022-07-13 | Paper |
| How to Delegate Computations: The Power of No-Signaling Proofs | 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 | 2021-09-22 | Paper |
| Efficient Multiparty Interactive Coding—Part I: Oblivious Insertions, Deletions and Substitutions | 2021-07-23 | Paper |
| Efficient Multiparty Interactive Coding for Insertions, Deletions, and Substitutions | 2021-01-20 | Paper |
| Non-signaling proofs with o(√ log n) provers are in PSPACE | 2021-01-19 | Paper |
| DELEGATING COMPUTATION VIA NO-SIGNALING STRATEGIES | 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 | 2020-01-30 | Paper |
| Multi-collision resistance: a paradigm for keyless hash functions | 2019-08-22 | Paper |
| Succinct delegation for low-space non-deterministic computation | 2019-08-22 | Paper |
| Promise zero knowledge and its applications to round optimal MPC | 2018-09-26 | Paper |
| Compressing communication in distributed protocols | 2018-08-24 | Paper |
| Delegating Computation | 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 | 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 | 2017-05-19 | Paper |
| On the Space Complexity of Linear Programming with Preprocessing | 2016-04-15 | Paper |
| Cryptographic Assumptions: A Position Paper | 2016-03-23 | Paper |
| Arguments of Proximity | 2015-12-10 | Paper |
| Adaptively Secure Coin-Flipping, Revisited | 2015-11-04 | Paper |
| Fast Interactive Coding against Adversarial Noise | 2015-08-14 | Paper |
| On Obfuscation with Random Oracles | 2015-07-06 | Paper |
| How to delegate computations | 2015-06-26 | Paper |
| On cryptography with auxiliary input | 2015-02-04 | Paper |
| The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator | 2014-08-07 | Paper |
| On Virtual Grey Box Obfuscation for General Circuits | 2014-08-07 | Paper |
| Delegation for bounded space | 2014-08-07 | Paper |
| Leakage-resilient coin tossing | 2014-07-11 | Paper |
| Protecting Obfuscation against Algebraic Attacks | 2014-05-27 | Paper |
| Multiparty computation secure against continual memory leakage | 2014-05-13 | Paper |
| Obfuscation for Evasive Functions | 2014-02-18 | Paper |
| Securing Circuits and Protocols against 1/poly(k) Tampering Rate | 2014-02-18 | Paper |
| How to Run Turing Machines on Encrypted Data | 2013-09-17 | Paper |
| Secure Computation against Adaptive Auxiliary Information | 2013-09-02 | Paper |
| Why “Fiat-Shamir for Proofs” Lacks a Proof | 2013-03-18 | Paper |
| Securing Circuits against Constant-Rate Tampering | 2012-09-25 | Paper |
| A Parallel Repetition Theorem for Leakage Resilience | 2012-06-15 | Paper |
| Smooth projective hashing and two-message oblivious transfer | 2012-05-23 | Paper |
| Program Obfuscation with Leaky Hardware | 2011-12-02 | Paper |
| Leakage-Resilient Coin Tossing | 2011-10-28 | Paper |
| Memory Delegation | 2011-08-12 | Paper |
| Cryptography with Tamperable and Leaky Memory | 2011-08-12 | Paper |
| Black-Box Circular-Secure Encryption beyond Affine Functions | 2011-05-19 | Paper |
| Concurrent general composition of secure protocols in the timing model | 2010-08-16 | Paper |
| On Symmetric Encryption and Point Obfuscation | 2010-02-24 | Paper |
| Public-Key Encryption Schemes with Auxiliary Inputs | 2010-02-24 | Paper |
| Probabilistically Checkable Arguments | 2009-10-20 | Paper |
| One-Time Programs | 2009-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549691 | 2009-01-05 | Paper |
| Interactive PCP | 2008-08-19 | Paper |
| Smooth Projective Hashing and Two-Message Oblivious Transfer | 2008-05-06 | Paper |
| Concurrent composition of secure protocols in the timing model | 2007-12-06 | Paper |
