| Publication | Date of Publication | Type |
|---|
| Black-box separations for non-interactive classical commitments in a quantum world | 2024-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059367 | 2023-11-02 | Paper |
| Collusion-resistant functional encryption for RAMs | 2023-08-25 | Paper |
| A note on the post-quantum security of (ring) signatures | 2023-08-10 | Paper |
| Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round | 2023-06-30 | Paper |
| On the impossibility of key agreements from quantum random oracles | 2023-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6161142 | 2023-06-26 | Paper |
| Foundations of Differentially Oblivious Algorithms | 2023-04-27 | Paper |
| MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture | 2023-02-03 | Paper |
| Constant-round blind classical verification of quantum sampling | 2022-08-30 | Paper |
| On the Algorithmic Power of Spiking Neural Networks | 2022-07-18 | Paper |
| Game-theoretic fairness meets multi-party protocols: the case of leader election | 2022-04-22 | Paper |
| A black-box approach to post-quantum zero-knowledge in constant rounds | 2022-03-31 | Paper |
| On the concurrent composition of quantum zero-knowledge | 2022-03-31 | Paper |
| Round efficient secure multiparty quantum computation with identifiable abort | 2022-03-31 | Paper |
| Classical verification of quantum computations with efficient verifier | 2022-03-23 | Paper |
| When Simple Hash Functions Suffice | 2022-02-04 | Paper |
| On the compressed-oracle technique, and post-quantum security of proofs of sequential work | 2021-12-08 | Paper |
| On the need for large Quantum depth | 2021-01-19 | Paper |
| Adaptively secure garbling schemes for parallel computations | 2020-04-30 | Paper |
| A quantum-proof non-malleable extractor. With application to privacy amplification against active quantum adversaries | 2020-02-06 | Paper |
| On quantum advantage in information theoretic single-server PIR | 2020-02-04 | Paper |
| Foundations of Differentially Oblivious Algorithms | 2019-10-15 | Paper |
| Quantum encryption and generalized Shannon impossibility | 2019-09-12 | Paper |
| Game theoretic notions of fairness in multi-party coin toss | 2018-12-11 | Paper |
| On the complexity of simulating auxiliary input | 2018-07-17 | Paper |
| On the depth of oblivious parallel RAM | 2018-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601845 | 2018-01-24 | Paper |
| On the impossibility of cryptography with tamperable randomness | 2018-01-05 | Paper |
| Distributed algorithms for the Lovász local lemma and graph coloring | 2017-09-04 | Paper |
| Can theories be tested? | 2017-05-16 | Paper |
| On the power of nonuniformity in proofs of security | 2017-05-16 | Paper |
| Delegating RAM Computations with Adaptive Soundness and Privacy | 2016-12-22 | Paper |
| Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security | 2016-04-25 | Paper |
| Cryptography for Parallel RAM from Indistinguishability Obfuscation | 2016-04-15 | Paper |
| Oblivious Parallel RAM and Applications | 2016-04-08 | Paper |
| Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs | 2015-12-10 | Paper |
| Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation | 2015-12-10 | Paper |
| Distributed algorithms for the Lovász local lemma and graph coloring | 2015-09-03 | Paper |
| From Weak to Strong Zero-Knowledge and Applications | 2015-07-06 | Paper |
| Tight Parallel Repetition Theorems for Public-Coin Arguments Using KL-Divergence | 2015-07-06 | Paper |
| Statistically-secure ORAM with $\tilde{O}(\log^2 n)$ Overhead | 2015-01-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3191600 | 2014-10-06 | Paper |
| S-T connectivity on digraphs with a known stationary distribution | 2014-09-09 | Paper |
| On the Impossibility of Cryptography with Tamperable Randomness | 2014-08-07 | Paper |
| Non-black-box simulation from one-way functions and applications to resettable security | 2014-08-07 | Paper |
| The Randomness Complexity of Parallel Repetition | 2014-07-30 | Paper |
| On Extractability Obfuscation | 2014-02-18 | Paper |
| 4-Round Resettably-Sound Zero Knowledge | 2014-02-18 | Paper |
| Functional Encryption from (Small) Hardware Tokens | 2013-12-10 | Paper |
| Randomness-Dependent Message Security | 2013-03-18 | Paper |
| Chernoff-Hoeffding Bounds for Markov Chains: Generalized and Simplified | 2012-08-23 | Paper |
| The Knowledge Tightness of Parallel Zero-Knowledge | 2012-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113742 | 2012-01-23 | Paper |
| Memory Delegation | 2011-08-12 | Paper |
| Efficient Secure Two-Party Exponentiation | 2011-02-11 | Paper |
| Efficient String-Commitment from Weak Bit-Commitment | 2010-12-07 | Paper |
| Improved Delegation of Computation Using Fully Homomorphic Encryption | 2010-08-24 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Parallel Repetition Theorems for Interactive Arguments | 2010-02-24 | Paper |
| Tight Bounds for Hashing Block Sources | 2008-11-27 | Paper |
| An Optimal Algorithm for the Maximum-Density Segment Problem | 2005-02-21 | Paper |
| Decomposition Methods for Linear Support Vector Machines | 2005-01-04 | Paper |
| Radius Margin Bounds for Support Vector Machines with the RBF Kernel | 2004-09-07 | Paper |
