| Publication | Date of Publication | Type |
|---|
| Leakage-resilient hardness vs randomness | 2024-11-19 | Paper |
| Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance | 2024-11-13 | Paper |
| A direct PRF construction from Kolmogorov complexity | 2024-11-13 | Paper |
| Simplex consensus: a simple and fast consensus protocol | 2024-08-15 | Paper |
| Counting unpredictable bits: a simple PRG from one-way functions | 2024-08-01 | Paper |
| On one-way functions and sparse languages | 2024-08-01 | Paper |
| Characterizing derandomization through hardness of Levin-Kolmogorov complexity | 2024-07-05 | Paper |
| On one-way functions from NP-complete problems | 2024-07-05 | Paper |
| Bucket oblivious sort: an extremely simple oblivious sort | 2024-05-14 | Paper |
| One-way functions and the hardness of (probabilistic) time-bounded Kolmogorov complexity w.r.t. samplable distributions | 2024-02-02 | Paper |
| Indistinguishability obfuscation from circular security | 2023-11-14 | Paper |
| Cryptography from sublinear-time average-case hardness of time-bounded Kolmogorov complexity | 2023-11-14 | Paper |
| Concurrently composable non-interactive secure computation | 2023-08-25 | Paper |
| Parallelizable delegation from LWE | 2023-08-14 | Paper |
| SPARKs: Succinct Parallelizable Arguments of Knowledge | 2023-04-27 | Paper |
| Non-malleable time-lock puzzles and applications | 2023-04-13 | Paper |
| One-Way Functions and (Im)perfect Obfuscation | 2023-04-04 | Paper |
| On the adaptive security of MACs and PRFs | 2023-03-21 | Paper |
| Communication complexity of Byzantine agreement, revisited | 2023-03-14 | Paper |
| Hybrid consensus: efficient consensus in the permissionless model | 2023-02-03 | Paper |
| Impossibility of strong KDM security with auxiliary input | 2022-12-16 | Paper |
| Unprovability of leakage-resilient cryptography beyond the information-theoretic limit | 2022-12-16 | Paper |
| On the complexity of compressing obfuscation | 2022-07-18 | Paper |
| Non-malleable codes for bounded parallel-time tampering | 2022-04-22 | Paper |
| On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \) | 2022-03-31 | Paper |
| Succinct non-interactive secure computation | 2022-03-23 | Paper |
| Locality-preserving oblivious RAM | 2022-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5018514 | 2021-12-20 | Paper |
| A knowledge-based analysis of the blockchain protocol | 2021-12-14 | Paper |
| Bayesian games with intentions | 2021-12-07 | Paper |
| Continuous verifiable delay functions | 2021-12-01 | Paper |
| SPARKs: succinct parallelizable arguments of knowledge | 2021-12-01 | Paper |
| Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions? | 2021-12-01 | Paper |
| Sublinear-round Byzantine agreement under corrupt majority | 2021-12-01 | Paper |
| Minimizing trust in hardware wallets with two factor signatures | 2021-03-17 | Paper |
| Communication Complexity of Byzantine Agreement, Revisited | 2021-01-20 | Paper |
| Bayesian games with intentions | 2020-10-26 | Paper |
| Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles | 2020-08-25 | Paper |
| On the complexity of compressing obfuscation | 2020-06-30 | Paper |
| Synchronous, with a chance of partition tolerance | 2020-05-20 | Paper |
| Non-uniformly sound certificates with applications to concurrent zero-knowledge | 2020-03-09 | Paper |
| Locality-preserving oblivious RAM | 2020-02-06 | Paper |
| On the existence of Nash equilibrium in games with resource-bounded players | 2020-02-04 | Paper |
| A course in networks and markets. Game-theoretic models and reasoning | 2019-10-29 | Paper |
| The truth behind the myth of the folk theorem | 2019-09-19 | Paper |
| Socially optimal mining pools | 2019-01-30 | Paper |
| Tight revenue bounds with possibilistic beliefs and level-\(k\) rationality | 2019-01-30 | Paper |
| On the security loss of unique signatures | 2018-12-11 | Paper |
| Game theoretic notions of fairness in multi-party coin toss | 2018-12-11 | Paper |
| Achieving fair treatment in algorithmic classification | 2018-12-11 | Paper |
| Game theory with translucent players | 2018-11-09 | Paper |
| Thunderella: blockchains with optimistic instant confirmation | 2018-07-09 | Paper |
| Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings | 2018-07-04 | Paper |
| The sleepy model of consensus | 2018-03-08 | Paper |
| Can we access a database both locally and privately? | 2018-01-19 | Paper |
| On the impossibility of cryptography with tamperable randomness | 2018-01-05 | Paper |
| FruitChains: a fair blockchain | 2017-10-11 | Paper |
| Reasoning about rationality | 2017-08-17 | Paper |
| Analysis of the Blockchain Protocol in Asynchronous Networks | 2017-06-13 | Paper |
| Formal abstractions for attested execution secure processors | 2017-06-13 | Paper |
| The truth behind the myth of the folk theorem | 2017-05-19 | Paper |
| On the power of many one-bit provers | 2017-05-16 | Paper |
| Can theories be tested? | 2017-05-16 | Paper |
| On the power of nonuniformity in proofs of security | 2017-05-16 | Paper |
| Unprovable security of perfect NIZK and non-interactive non-malleable commitments | 2016-10-28 | Paper |
| Bounded KDM security from iO and OWF | 2016-10-21 | Paper |
| Adaptive hardness and composable security in the plain model from standard assumptions | 2016-09-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5740446 | 2016-07-26 | Paper |
| Non-black-box simulation from one-way functions and applications to resettable security | 2016-04-25 | Paper |
| Indistinguishability obfuscation with non-trivial efficiency | 2016-04-13 | Paper |
| Oblivious parallel RAM and applications | 2016-04-08 | Paper |
| Impossibility of VBB obfuscation with ideal constant-degree graded encodings | 2016-03-23 | Paper |
| Lower bounds on assumptions behind indistinguishability obfuscation | 2016-03-23 | Paper |
| Output-compressing randomized encodings and applications | 2016-03-23 | Paper |
| Limits of extractability assumptions with distributional auxiliary input | 2016-03-23 | 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 |
| A parallel repetition theorem for constant-round Arthur-Merlin proofs | 2015-09-24 | Paper |
| Succinct randomized encodings and their applications | 2015-08-21 | Paper |
| Constant-Round Nonmalleable Commitments from Any One-Way Function | 2015-08-14 | Paper |
| Outlier privacy | 2015-07-06 | Paper |
| Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma | 2015-07-06 | Paper |
| Tight parallel repetition theorems for public-coin arguments using KL-divergence | 2015-07-06 | Paper |
| From weak to strong zero-knowledge and applications | 2015-07-06 | Paper |
| Algorithmic rationality: game theory with costly computation | 2015-02-13 | Paper |
| Non-malleability amplification | 2015-02-04 | Paper |
| A unified framework for concurrent security | 2015-02-04 | Paper |
| On the impossibility of black-box transformations in mechanism design | 2015-01-14 | Paper |
| Not just an empty threat: subgame-perfect equilibrium in repeated games played by computationally bounded players | 2015-01-07 | Paper |
| Statistically-secure ORAM with \(\tilde{O}(\log^2 n)\) overhead | 2015-01-06 | Paper |
| Local zero knowledge | 2014-11-25 | Paper |
| Indistinguishability obfuscation from semantically-secure multilinear encodings | 2014-08-07 | Paper |
| Non-black-box simulation from one-way functions and applications to resettable security | 2014-08-07 | Paper |
| On the impossibility of cryptography with tamperable randomness | 2014-08-07 | Paper |
| The Randomness Complexity of Parallel Repetition | 2014-07-30 | Paper |
| Constant-round non-malleable commitments from any one-way function | 2014-06-05 | Paper |
| Limits of provable security from standard assumptions | 2014-06-05 | Paper |
| Concurrent zero knowledge, revisited | 2014-04-01 | Paper |
| Conservative belief and rationality | 2014-02-21 | Paper |
| 4-round resettably-sound zero knowledge | 2014-02-18 | Paper |
| On extractability obfuscation | 2014-02-18 | Paper |
| Public-coin parallel zero-knowledge for NP | 2013-04-15 | Paper |
| A unified framework for UC from only OT | 2013-03-19 | Paper |
| Randomness-dependent message security | 2013-03-18 | Paper |
| Unprovable security of perfect NIZK and non-interactive non-malleable commitments | 2013-03-18 | Paper |
| The curious case of non-interactive commitments -- on the power of black-box vs. non-black-box use of primitives | 2012-09-25 | Paper |
| Black-box constructions of composable protocols without set-up | 2012-09-25 | Paper |
| Crowd-blending privacy | 2012-09-25 | Paper |
| Multi-verifier signatures | 2012-07-03 | Paper |
| The knowledge tightness of parallel zero-knowledge | 2012-06-15 | Paper |
| On the composition of public-coin zero-knowledge protocols | 2012-03-15 | Paper |
| Iterated regret minimization: a new solution concept | 2012-03-05 | Paper |
| Secure computation without authentication | 2012-01-13 | Paper |
| Concurrent security and non-malleability | 2011-05-19 | Paper |
| Towards non-black-box lower bounds in cryptography | 2011-05-19 | Paper |
| Towards privacy for social networks: a zero-knowledge based definition of privacy | 2011-05-19 | Paper |
| Concurrent non-malleable zero knowledge with adaptive inputs | 2011-05-19 | Paper |
| Concurrent non-malleable zero knowledge proofs | 2010-08-24 | Paper |
| New and improved constructions of non-malleable cryptographic protocols | 2010-08-16 | Paper |
| Bounded-concurrent secure multi-party computation with a dishonest majority | 2010-08-15 | Paper |
| Constant-round non-malleable commitments from sub-exponential one-way functions | 2010-06-01 | Paper |
| Eye for an eye: efficient concurrent zero-knowledge in the timing model | 2010-02-24 | Paper |
| An efficient parallel repetition theorem | 2010-02-24 | Paper |
| Private coins versus public coins in zero-knowledge proof systems | 2010-02-24 | Paper |
| On the Composition of Public-Coin Zero-Knowledge Protocols | 2009-10-20 | Paper |
| Theory of Cryptography | 2009-05-14 | Paper |
| New and Improved Constructions of Nonmalleable Cryptographic Protocols | 2009-04-30 | Paper |
| Black-Box Constructions of Two-Party Protocols from One-Way Functions | 2009-03-03 | Paper |
| Adaptive One-Way Functions and Applications | 2009-02-10 | Paper |
| Concurrent Nonmalleable Commitments | 2008-12-22 | Paper |
| Bounded CCA2-Secure Encryption | 2008-05-15 | Paper |
| Relations Among Notions of Non-malleability for Encryption | 2008-05-15 | Paper |
| Precise Concurrent Zero Knowledge | 2008-04-15 | Paper |
| Unconditional Characterizations of Non-interactive Zero-Knowledge | 2008-03-17 | Paper |
| Secure Computation Without Authentication | 2008-03-17 | Paper |
| Concurrent Non-malleable Commitments from Any One-Way Function | 2008-03-05 | Paper |
| On Constant-Round Concurrent Zero-Knowledge | 2008-03-05 | Paper |
| Advances in Cryptology - CRYPTO 2003 | 2007-11-28 | Paper |
| Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One | 2007-09-04 | Paper |
| Universally Composable Security with Global Setup | 2007-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4434874 | 2003-11-26 | Paper |
