| Publication | Date of Publication | Type |
|---|
| Bounded-concurrent secure two-party computation in a constant number of rounds | 2026-05-29 | Paper |
| Universally composable protocols with relaxed set-up assumptions | 2026-05-29 | Paper |
| Input-indistinguishable computation | 2026-05-29 | Paper |
| A meta-complexity theoretic approach to indistinguishability obfuscation and witness pseudo-canonicalization | 2026-04-24 | Paper |
| On witness encryption and laconic zero-knowledge arguments | 2026-02-06 | Paper |
| Hardness along the boundary: towards one-way functions from the worst-case hardness of time-bounded Kolmogorov complexity | 2026-02-04 | Paper |
| Gap MCSP is not (Levin) NP-complete in obfustopia | 2026-01-28 | Paper |
| Search-to-decision reductions for Kolmogorov complexity | 2026-01-28 | Paper |
| The non-uniform perebor conjecture for time-bounded Kolmogorov complexity is false | 2025-11-04 | Paper |
| On black-box meta complexity and function inversion | 2025-10-06 | Paper |
| Kolmogorov comes to cryptomania: on interactive Kolmogorov complexity and key-agreement | 2025-08-15 | Paper |
| Incrementally verifiable computation via rate-1 batch arguments | 2025-08-15 | Paper |
| Is it easier to prove theorems that are guaranteed to be true? | 2025-08-12 | Paper |
| On one-way functions and Kolmogorov complexity | 2025-08-12 | Paper |
| Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles | 2025-08-06 | Paper |
| One-way functions and (im)perfect obfuscation | 2025-08-05 | Paper |
| On one-way functions, the worst-case hardness of time-bounded Kolmogorov complexity, and computational depth | 2025-07-23 | Paper |
| Knowledge-preserving interactive coding | 2025-05-20 | Paper |
| From unprovability to environmentally friendly protocols | 2025-05-20 | Paper |
| Simultaneous resettability from one-way functions | 2025-05-20 | Paper |
| Constant-round concurrent zero knowledge from P-certificates | 2025-05-20 | Paper |
| Adaptive hardness and composable security in the plain model from standard assumptions | 2025-04-29 | Paper |
| 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
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
Indistinguishability obfuscation from circular security
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Cryptography from sublinear-time average-case hardness of time-bounded Kolmogorov complexity
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Concurrently composable non-interactive secure computation
Advances in Cryptology – ASIACRYPT 2022 | 2023-08-25 | Paper |
Parallelizable delegation from LWE
Theory of Cryptography | 2023-08-14 | Paper |
SPARKs: Succinct Parallelizable Arguments of Knowledge
Journal of the ACM | 2023-04-27 | Paper |
| Non-malleable time-lock puzzles and applications | 2023-04-13 | Paper |
One-Way Functions and (Im)perfect Obfuscation
SIAM Journal on Computing | 2023-04-04 | Paper |
| On the adaptive security of MACs and PRFs | 2023-03-21 | Paper |
Communication complexity of Byzantine agreement, revisited
Distributed Computing | 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
Journal of Cryptology | 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
Journal of Cryptology | 2022-03-03 | Paper |
| scientific article; zbMATH DE number 7450031 (Why is no real title available?) | 2021-12-20 | Paper |
scientific article; zbMATH DE number 7450031 (Why is no real title available?)
(available as arXiv preprint) | 2021-12-20 | Paper |
| A knowledge-based analysis of the blockchain protocol | 2021-12-14 | Paper |
A knowledge-based analysis of the blockchain protocol
(available as arXiv preprint) | 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
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Bayesian games with intentions
Games and Economic Behavior | 2020-10-26 | Paper |
Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
SIAM Journal on Computing | 2020-08-25 | Paper |
On the complexity of compressing obfuscation
Lecture Notes in Computer Science | 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
Advances in Cryptology – EUROCRYPT 2019 | 2020-02-06 | Paper |
On the existence of Nash equilibrium in games with resource-bounded players
(available as arXiv preprint) | 2020-02-04 | 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
Games and Economic Behavior | 2019-09-19 | Paper |
Tight revenue bounds with possibilistic beliefs and level-\(k\) rationality
Econometrica | 2019-01-30 | Paper |
Socially optimal mining pools
Web and Internet Economics | 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
International Journal of Game Theory | 2018-11-09 | Paper |
| Thunderella: blockchains with optimistic instant confirmation | 2018-07-09 | Paper |
Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
SIAM Journal on Computing | 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
Algorithmica | 2018-01-05 | Paper |
FruitChains: a fair blockchain
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
Reasoning about rationality
Games and Economic Behavior | 2017-08-17 | Paper |
Analysis of the Blockchain Protocol in Asynchronous Networks
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Formal abstractions for attested execution secure processors
Lecture Notes in Computer Science | 2017-06-13 | Paper |
The truth behind the myth of the folk theorem
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
On the power of nonuniformity in proofs of security
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
On the power of many one-bit provers
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
Can theories be tested?
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
Unprovable security of perfect NIZK and non-interactive non-malleable commitments
Computational Complexity | 2016-10-28 | Paper |
Bounded KDM security from iO and OWF
Lecture Notes in Computer Science | 2016-10-21 | Paper |
Adaptive hardness and composable security in the plain model from standard assumptions
SIAM Journal on Computing | 2016-09-23 | Paper |
| scientific article; zbMATH DE number 6606375 (Why is no real title available?) | 2016-07-26 | Paper |
Non-black-box simulation from one-way functions and applications to resettable security
SIAM Journal on Computing | 2016-04-25 | Paper |
Indistinguishability obfuscation with non-trivial efficiency
Public-Key Cryptography – PKC 2016 | 2016-04-13 | Paper |
Oblivious parallel RAM and applications
Theory of Cryptography | 2016-04-08 | Paper |
Impossibility of VBB obfuscation with ideal constant-degree graded encodings
Theory of Cryptography | 2016-03-23 | Paper |
Lower bounds on assumptions behind indistinguishability obfuscation
Theory of Cryptography | 2016-03-23 | Paper |
Output-compressing randomized encodings and applications
Theory of Cryptography | 2016-03-23 | Paper |
Limits of extractability assumptions with distributional auxiliary input
Advances in Cryptology – ASIACRYPT 2015 | 2016-03-23 | Paper |
Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Constant-round concurrent zero-knowledge from indistinguishability obfuscation
Lecture Notes in Computer Science | 2015-12-10 | Paper |
A parallel repetition theorem for constant-round Arthur-Merlin proofs
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
Succinct randomized encodings and their applications
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Constant-Round Nonmalleable Commitments from Any One-Way Function
Journal of the ACM | 2015-08-14 | Paper |
Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
Theory of Cryptography | 2015-07-06 | Paper |
Tight parallel repetition theorems for public-coin arguments using KL-divergence
Theory of Cryptography | 2015-07-06 | Paper |
From weak to strong zero-knowledge and applications
Theory of Cryptography | 2015-07-06 | Paper |
Outlier privacy
Theory of Cryptography | 2015-07-06 | Paper |
Algorithmic rationality: game theory with costly computation
Journal of Economic Theory | 2015-02-13 | Paper |
Non-malleability amplification
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
A unified framework for concurrent security
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
On the impossibility of black-box transformations in mechanism design
Algorithmic Game Theory | 2015-01-14 | Paper |
Not just an empty threat: subgame-perfect equilibrium in repeated games played by computationally bounded players
Web and Internet Economics | 2015-01-07 | Paper |
Statistically-secure ORAM with \(\tilde{O}(\log^2 n)\) overhead
Lecture Notes in Computer Science | 2015-01-06 | Paper |
Local zero knowledge
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Indistinguishability obfuscation from semantically-secure multilinear encodings
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
Non-black-box simulation from one-way functions and applications to resettable security
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
On the impossibility of cryptography with tamperable randomness
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
The Randomness Complexity of Parallel Repetition
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Constant-round non-malleable commitments from any one-way function
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Limits of provable security from standard assumptions
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Concurrent zero knowledge, revisited
Journal of Cryptology | 2014-04-01 | Paper |
Conservative belief and rationality
Games and Economic Behavior | 2014-02-21 | Paper |
4-round resettably-sound zero knowledge
Theory of Cryptography | 2014-02-18 | Paper |
On extractability obfuscation
Theory of Cryptography | 2014-02-18 | Paper |
Public-coin parallel zero-knowledge for NP
Journal of Cryptology | 2013-04-15 | Paper |
A unified framework for UC from only OT
Advances in Cryptology – ASIACRYPT 2012 | 2013-03-19 | Paper |
Randomness-dependent message security
Theory of Cryptography | 2013-03-18 | Paper |
Unprovable security of perfect NIZK and non-interactive non-malleable commitments
Theory of Cryptography | 2013-03-18 | Paper |
The curious case of non-interactive commitments -- on the power of black-box vs. non-black-box use of primitives
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Black-box constructions of composable protocols without set-up
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Crowd-blending privacy
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Multi-verifier signatures
Journal of Cryptology | 2012-07-03 | Paper |
The knowledge tightness of parallel zero-knowledge
Theory of Cryptography | 2012-06-15 | Paper |
On the composition of public-coin zero-knowledge protocols
SIAM Journal on Computing | 2012-03-15 | Paper |
Iterated regret minimization: a new solution concept
Games and Economic Behavior | 2012-03-05 | Paper |
Secure computation without authentication
Journal of Cryptology | 2012-01-13 | Paper |
Towards non-black-box lower bounds in cryptography
Theory of Cryptography | 2011-05-19 | Paper |
Towards privacy for social networks: a zero-knowledge based definition of privacy
Theory of Cryptography | 2011-05-19 | Paper |
Concurrent non-malleable zero knowledge with adaptive inputs
Theory of Cryptography | 2011-05-19 | Paper |
Concurrent security and non-malleability
Theory of Cryptography | 2011-05-19 | Paper |
Concurrent non-malleable zero knowledge proofs
Advances in Cryptology – CRYPTO 2010 | 2010-08-24 | Paper |
New and improved constructions of non-malleable cryptographic protocols
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Bounded-concurrent secure multi-party computation with a dishonest majority
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Constant-round non-malleable commitments from sub-exponential one-way functions
Advances in Cryptology – EUROCRYPT 2010 | 2010-06-01 | Paper |
An efficient parallel repetition theorem
Theory of Cryptography | 2010-02-24 | Paper |
Private coins versus public coins in zero-knowledge proof systems
Theory of Cryptography | 2010-02-24 | Paper |
Eye for an eye: efficient concurrent zero-knowledge in the timing model
Theory of Cryptography | 2010-02-24 | Paper |
On the Composition of Public-Coin Zero-Knowledge Protocols
Advances in Cryptology - CRYPTO 2009 | 2009-10-20 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2009-05-14 | Paper |
New and Improved Constructions of Nonmalleable Cryptographic Protocols
SIAM Journal on Computing | 2009-04-30 | Paper |
Black-Box Constructions of Two-Party Protocols from One-Way Functions
Theory of Cryptography | 2009-03-03 | Paper |
Adaptive One-Way Functions and Applications
Lecture Notes in Computer Science | 2009-02-10 | Paper |
Concurrent Nonmalleable Commitments
SIAM Journal on Computing | 2008-12-22 | Paper |
Bounded CCA2-Secure Encryption
Advances in Cryptology – ASIACRYPT 2007 | 2008-05-15 | Paper |
Relations Among Notions of Non-malleability for Encryption
Advances in Cryptology – ASIACRYPT 2007 | 2008-05-15 | Paper |
Precise Concurrent Zero Knowledge
Advances in Cryptology – EUROCRYPT 2008 | 2008-04-15 | Paper |
Unconditional Characterizations of Non-interactive Zero-Knowledge
Advances in Cryptology – CRYPTO 2005 | 2008-03-17 | Paper |
Secure Computation Without Authentication
Advances in Cryptology – CRYPTO 2005 | 2008-03-17 | Paper |
Concurrent Non-malleable Commitments from Any One-Way Function
Theory of Cryptography | 2008-03-05 | Paper |
On Constant-Round Concurrent Zero-Knowledge
Theory of Cryptography | 2008-03-05 | Paper |
Advances in Cryptology - CRYPTO 2003
Lecture Notes in Computer Science | 2007-11-28 | Paper |
Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
Lecture Notes in Computer Science | 2007-09-04 | Paper |
Universally Composable Security with Global Setup
Theory of Cryptography | 2007-08-30 | Paper |
| scientific article; zbMATH DE number 2009954 (Why is no real title available?) | 2003-11-26 | Paper |
