2024
Gap MCSP is not (Levin) NP-complete in Obfustopia.
Electron. Colloquium Comput. Complex., 2024
Search-to-Decision Reductions for Kolmogorov Complexity.
Electron. Colloquium Comput. Complex., 2024
Lower Bounds on the Overhead of Indistinguishability Obfuscation.
Electron. Colloquium Comput. Complex., 2024
A Direct PRF Construction from Kolmogorov Complexity.
Electron. Colloquium Comput. Complex., 2024
On White-Box Learning and Public-Key Encryption.
Electron. Colloquium Comput. Complex., 2024
On Witness Encryption and Laconic Zero-Knowledge Arguments.
Electron. Colloquium Comput. Complex., 2024
A Note on Zero-Knowledge for NP and One-Way Functions.
Electron. Colloquium Comput. Complex., 2024
Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement.
Electron. Colloquium Comput. Complex., 2024
Fair Interest Rates Are Impossible for Lending Pools: Results from Options Pricing.
CoRR, 2024
On the Viability of Open-Source Financial Rails: Economic Security of Permissionless Consensus.
CoRR, 2024
On One-Way Functions, the Worst-Case Hardness of Time-Bounded Kolmogorov Complexity, and Computational Depth.
Proceedings of the Theory of Cryptography - 22nd International Conference, 2024
Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance.
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024
On Black-Box Meta Complexity and Function Inversion.
Proceedings of the Approximation, 2024
2023
Toward Basing Cryptography on the Hardness of EXP.
Commun. ACM, May, 2023
Communication complexity of byzantine agreement, revisited.
Distributed Comput., March, 2023
Incrementally Verifiable Computation via Rate-1 Batch Arguments.
IACR Cryptol. ePrint Arch., 2023
Can open decentralized ledgers be economically secure?
IACR Cryptol. ePrint Arch., 2023
Simplex Consensus: A Simple and Fast Consensus Protocol.
IACR Cryptol. ePrint Arch., 2023
Characterizing the Power of (Persistent) Randomness in Log-space.
Electron. Colloquium Comput. Complex., 2023
A Note On the Universality of Black-box MKtP Solvers.
Electron. Colloquium Comput. Complex., 2023
The Non-Uniform Perebor Conjecture for Time-Bounded Kolmogorov Complexity is False.
Electron. Colloquium Comput. Complex., 2023
Counting Unpredictable Bits: A Simple PRG from One-way Functions.
Electron. Colloquium Comput. Complex., 2023
One-way Functions and Hardness of (Probabilistic) Time-Bounded Kolmogorov Complexity w.r.t. Samplable Distributions.
Electron. Colloquium Comput. Complex., 2023
On One-way Functions and the Worst-case Hardness of Time-Bounded Kolmogorov Complexity.
Electron. Colloquium Comput. Complex., 2023
On One-Way Functions and Sparse Languages.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023
Leakage-Resilient Hardness vs Randomness.
Proceedings of the 38th Computational Complexity Conference, 2023
2022
One-Way Functions and (Im)perfect Obfuscation.
SIAM J. Comput., 2022
On the Complexity of Compressing Obfuscation.
J. Cryptol., 2022
Locality-Preserving Oblivious RAM.
J. Cryptol., 2022
SPARKs: Succinct Parallelizable Arguments of Knowledge.
J. ACM, 2022
Parallelizable Delegation from LWE.
IACR Cryptol. ePrint Arch., 2022
IACR Cryptol. ePrint Arch., 2022
Leakage-Resilient Hardness v.s. Randomness.
Electron. Colloquium Comput. Complex., 2022
Characterizing Derandomization Through Hardness of Levin-Kolmogorov Complexity.
Electron. Colloquium Comput. Complex., 2022
Universal Reductions: Reductions Relative to Stateful Oracles.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022
2021
Sequential Equilibrium in Games of Imperfect Recall.
ACM Trans. Economics and Comput., 2021
Guest Column: Average-case Complexity Through the Lens of Interactive Puzzles.
SIGACT News, 2021
A Tutorial on Concurrent Zero Knowledge.
IACR Cryptol. ePrint Arch., 2021
Unprovability of Leakage-Resilient Cryptography Beyond the Information-Theoretic Limit.
IACR Cryptol. ePrint Arch., 2021
Concurrently Composable Non-Interactive Secure Computation.
IACR Cryptol. ePrint Arch., 2021
A Note on One-way Functions and Sparse Languages.
Electron. Colloquium Comput. Complex., 2021
On One-way Functions from NP-Complete Problems.
Electron. Colloquium Comput. Complex., 2021
On the Possibility of Basing Cryptography on $\EXP \neq \BPP$.
Electron. Colloquium Comput. Complex., 2021
Cryptography from Sublinear-Time Average-Case Hardness of Time-Bounded Kolmogorov Complexity.
Electron. Colloquium Comput. Complex., 2021
On the Possibility of Basing Cryptography on EXP≠ BPP.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021
Non-malleable Codes for Bounded Parallel-Time Tampering.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021
2020
Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles.
SIAM J. Comput., 2020
On the Adaptive Security of MACs and PRFs.
IACR Cryptol. ePrint Arch., 2020
Indistinguishability Obfuscation from Circular Security.
IACR Cryptol. ePrint Arch., 2020
Non-Malleable Time-Lock Puzzles and Applications.
IACR Cryptol. ePrint Arch., 2020
Non-Malleable Codes for Bounded Polynomial Depth Tampering.
IACR Cryptol. ePrint Arch., 2020
Blockchain with Varying Number of Players.
IACR Cryptol. ePrint Arch., 2020
Is it Easier to Prove Theorems that are Guaranteed to be True?
Electron. Colloquium Comput. Complex., 2020
On One-way Functions and Kolmogorov Complexity.
Electron. Colloquium Comput. Complex., 2020
Bucket Oblivious Sort: An Extremely Simple Oblivious Sort.
Proceedings of the 3rd Symposium on Simplicity in Algorithms, 2020
Sublinear-Round Byzantine Agreement Under Corrupt Majority.
Proceedings of the Public-Key Cryptography - PKC 2020, 2020
Which Languages Have 4-Round Fully Black-Box Zero-Knowledge Arguments from One-Way Functions?
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020
2019
Sequential Equilibrium in Computational Games.
ACM Trans. Economics and Comput., 2019
A Round-Collapse Theorem for Computationally-Sound Protocols; or, TFNP is Hard (on Average) in Pessiland.
IACR Cryptol. ePrint Arch., 2019
Succinct Non-Interactive Secure Computation.
IACR Cryptol. ePrint Arch., 2019
Minimizing Trust in Hardware Wallets with Two Factor Signatures.
IACR Cryptol. ePrint Arch., 2019
Synchronous, with a Chance of Partition Tolerance.
IACR Cryptol. ePrint Arch., 2019
Non-Uniformly Sound Certificates with Applications to Concurrent Zero-Knowledge.
IACR Cryptol. ePrint Arch., 2019
Impossibility of Strong KDM Security with Auxiliary Input.
IACR Cryptol. ePrint Arch., 2019
Continuous Verifiable Delay Functions.
IACR Cryptol. ePrint Arch., 2019
Round Complexity of Byzantine Agreement, Revisited.
IACR Cryptol. ePrint Arch., 2019
Consensus through Herding.
IACR Cryptol. ePrint Arch., 2019
On Perfect Correctness without Derandomization.
IACR Cryptol. ePrint Arch., 2019
The truth behind the myth of the Folk theorem.
Games Econ. Behav., 2019
A Conceptually Well-Founded Characterization of Iterated Admissibility Using an "All I Know" Operator.
Proceedings of the Proceedings Seventeenth Conference on Theoretical Aspects of Rationality and Knowledge, 2019
On the Existence of Nash Equilibrium in Games with Resource-Bounded Players.
Proceedings of the Algorithmic Game Theory - 12th International Symposium, 2019
Snow White: Robustly Reconfigurable Consensus and Applications to Provably Secure Proof of Stake.
Proceedings of the Financial Cryptography and Data Security, 2019
Paradoxes in Fair Computer-Aided Decision Making.
Proceedings of the 2019 AAAI/ACM Conference on AI, Ethics, and Society, 2019
A tutorial on concurrent zero-knowledge.
Proceedings of the Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, 2019
2018
Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings.
SIAM J. Comput., 2018
Game theory with translucent players.
Int. J. Game Theory, 2018
Blind Certificate Authorities.
IACR Cryptol. ePrint Arch., 2018
Rethinking Large-Scale Consensus.
IACR Cryptol. ePrint Arch., 2018
Achieving Fair Treatment in Algorithmic Classification.
IACR Cryptol. ePrint Arch., 2018
On the Security Loss of Unique Signatures.
IACR Cryptol. ePrint Arch., 2018
Game Theoretic Notions of Fairness in Multi-Party Coin Toss.
IACR Cryptol. ePrint Arch., 2018
PaLa: A Simple Partially Synchronous Blockchain.
IACR Cryptol. ePrint Arch., 2018
PiLi: An Extremely Simple Synchronous Blockchain.
IACR Cryptol. ePrint Arch., 2018
Communication-Efficient Byzantine Agreement without Erasures.
CoRR, 2018
2017
Thunderella: Blockchains with Optimistic Instant Confirmation.
IACR Cryptol. ePrint Arch., 2017
Two-Round Concurrent Non-Malleable Commitment from Time-Lock Puzzles.
IACR Cryptol. ePrint Arch., 2017
Can We Access a Database Both Locally and Privately?
IACR Cryptol. ePrint Arch., 2017
Oblivious Computation with Data Locality.
IACR Cryptol. ePrint Arch., 2017
Reasoning about rationality.
Games Econ. Behav., 2017
A Knowledge-Based Analysis of the Blockchain Protocol.
Proceedings of the Proceedings Sixteenth Conference on Theoretical Aspects of Rationality and Knowledge, 2017
On the Impossibility of Cryptography with Tamperable Randomness.
Algorithmica, 2017
Socially Optimal Mining Pools.
Proceedings of the Web and Internet Economics - 13th International Conference, 2017
The Sleepy Model of Consensus.
Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017
2016
Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security.
SIAM J. Comput., 2016
Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions.
SIAM J. Comput., 2016
Secure Channel Injection and Anonymous Proofs of Account Ownership.
IACR Cryptol. ePrint Arch., 2016
Formal Abstractions for Attested Execution Secure Processors.
IACR Cryptol. ePrint Arch., 2016
Analysis of the Blockchain Protocol in Asynchronous Networks.
IACR Cryptol. ePrint Arch., 2016
Hybrid Consensus: Efficient Consensus in the Permissionless Model.
IACR Cryptol. ePrint Arch., 2016
FruitChains: A Fair Blockchain.
IACR Cryptol. ePrint Arch., 2016
Micropayments for Decentralized Currencies.
IACR Cryptol. ePrint Arch., 2016
Bounded KDM Security from iO and OWF.
IACR Cryptol. ePrint Arch., 2016
A Note on Black-Box Complexity of Indistinguishability Obfuscation.
IACR Cryptol. ePrint Arch., 2016
Indistinguishability Obfuscation with Non-trivial Efficiency.
IACR Cryptol. ePrint Arch., 2016
Snow White: Provably Secure Proofs of Stake.
IACR Cryptol. ePrint Arch., 2016
The Sleepy Model of Consensus.
IACR Cryptol. ePrint Arch., 2016
Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments.
Comput. Complex., 2016
Oblivious Parallel RAM and Applications.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016
Computational Extensive-Form Games.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016
2015
Algorithmic rationality: Game theory with costly computation.
J. Econ. Theory, 2015
Constant-Round Nonmalleable Commitments from Any One-Way Function.
J. ACM, 2015
An Overview of ANONIZE: A Large-Scale Anonymous Survey System.
IEEE Secur. Priv., 2015
Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings.
IACR Cryptol. ePrint Arch., 2015
Lower Bounds on Assumptions behind Indistinguishability Obfuscation.
IACR Cryptol. ePrint Arch., 2015
Output-Compressing Randomized Encodings and Applications.
IACR Cryptol. ePrint Arch., 2015
How to Use SNARKs in Universally Composable Protocols.
IACR Cryptol. ePrint Arch., 2015
ANONIZE: A Large-Scale Anonymous Survey System.
IACR Cryptol. ePrint Arch., 2015
Tight Parallel Repetition Theorems for Public-Coin Arguments using KL-divergence.
IACR Cryptol. ePrint Arch., 2015
Succinct Randomized Encodings and their Applications.
IACR Cryptol. ePrint Arch., 2015
Stronger Impossibility Results for Strategy-Proof Voting with i.i.d. Beliefs.
CoRR, 2015
On the Non-Existence of Nash Equilibrium in Games with Resource-Bounded Players.
CoRR, 2015
Bayesian Games with Intentions.
Proceedings of the Proceedings Fifteenth Conference on Theoretical Aspects of Rationality and Knowledge, 2015
Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015
Voting with Coarse Beliefs.
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015
Better Outcomes from More Rationality.
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015
Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015
2014
Decision Theory with Resource-Bounded Agents.
Top. Cogn. Sci., 2014
Concurrent Zero Knowledge, Revisited.
J. Cryptol., 2014
IACR Cryptol. ePrint Arch., 2014
Succinct Garbling Schemes and Applications.
IACR Cryptol. ePrint Arch., 2014
Constant-Round Concurrent Zero-knowledge from Indistinguishability Obfuscation.
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
Large-Scale Secure Computation.
IACR Cryptol. ePrint Arch., 2014
Not Just an Empty Threat: Subgame-Perfect Equilibrium in Repeated Games Played by Computationally Bounded Players.
Proceedings of the Web and Internet Economics - 10th International Conference, 2014
4-Round Resettably-Sound Zero Knowledge.
Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014
On the Impossibility of Black-Box Transformations in Mechanism Design.
Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014
Axiomatizing Rationality.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, 2014
Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings.
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014
Statistically-secure ORAM with Õ(log<sup>2</sup> n) Overhead.
Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014
2013
Guest column: parallel repetition theorems for interactive arguments.
SIGACT News, 2013
Public-Coin Parallel Zero-Knowledge for NP.
J. Cryptol., 2013
Obfuscation from Semantically-Secure Multi-linear Encodings.
IACR Cryptol. ePrint Arch., 2013
Interactive Coding, Revisited.
IACR Cryptol. ePrint Arch., 2013
IACR Cryptol. ePrint Arch., 2013
Simultaneous Resettable WI from One-way Functions.
IACR Cryptol. ePrint Arch., 2013
From Weak to Strong Zero-Knowledge and Applications.
IACR Cryptol. ePrint Arch., 2013
Limits of Extractability Assumptions with Distributional Auxiliary Input.
IACR Cryptol. ePrint Arch., 2013
On Extractability Obfuscation.
IACR Cryptol. ePrint Arch., 2013
On the (Im)Possibility of Tamper-Resilient Cryptography: Using Fourier Analysis in Computer Viruses.
IACR Cryptol. ePrint Arch., 2013
Conservative belief and rationality.
Games Econ. Behav., 2013
Statistically-secure ORAM with $\tilde{O}(\log^2 n)$ Overhead.
CoRR, 2013
Randomness-Dependent Message Security.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013
Can theories be tested?: a cryptographic treatment of forecast testing.
Proceedings of the Innovations in Theoretical Computer Science, 2013
On the power of nonuniformity in proofs of security.
Proceedings of the Innovations in Theoretical Computer Science, 2013
On the power of many one-bit provers.
Proceedings of the Innovations in Theoretical Computer Science, 2013
Proceedings of the IJCAI 2013, 2013
Knowledge-Preserving Interactive Coding.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013
Simultaneous Resettability from One-Way Functions.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013
Constant-Round Concurrent Zero Knowledge from P-Certificates.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013
From Unprovability to Environmentally Friendly Protocols.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013
2012
A Parallel Repetition Theorem for Constant-Round Arthur-Merlin Proofs.
ACM Trans. Comput. Theory, 2012
Multi-Verifier Signatures.
J. Cryptol., 2012
The Curious Case of Non-Interactive Commitments.
IACR Cryptol. ePrint Arch., 2012
IACR Cryptol. ePrint Arch., 2012
Constant-Round Concurrent Zero Knowledge From Falsifiable Assumptions.
IACR Cryptol. ePrint Arch., 2012
Unprovable Security of Two-Message Zero Knowledge.
IACR Cryptol. ePrint Arch., 2012
Iterated regret minimization: A new solution concept.
Games Econ. Behav., 2012
The Knowledge Tightness of Parallel Zero-Knowledge.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012
The Curious Case of Non-Interactive Commitments - On the Power of Black-Box vs. Non-Black-Box Use of Primitives.
Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012
Black-Box Constructions of Composable Protocols without Set-Up.
Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012
A Unified Framework for UC from Only OT.
Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012
I'm Doing as Well as I Can: Modeling People as Rational Finite Automata.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012
2011
Algorithmic rationality: adding cost of computation to game theory.
SIGecom Exch., 2011
On the Composition of Public-Coin Zero-Knowledge Protocols.
SIAM J. Comput., 2011
Secure Computation Without Authentication.
J. Cryptol., 2011
I Don't Want to Think About it Now:Decision Theory With Costly Computation
CoRR, 2011
Towards Non-Black-Box Lower Bounds in Cryptography.
Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011
Concurrent Security and Non-malleability.
Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011
Concurrent Non-Malleable Zero Knowledge with Adaptive Inputs.
Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011
Towards Privacy for Social Networks: A Zero-Knowledge Based Definition of Privacy.
Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011
Reasoning about justified belief.
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2011), 2011
Limits of provable security from standard assumptions.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011
Renegotiation-Safe Protocols.
Proceedings of the Innovations in Computer Science, 2011
Approximately Strategy-Proof Voting.
Proceedings of the IJCAI 2011, 2011
The Randomness Complexity of Parallel Repetition.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011
2010
Constant-round Non-Malleable Commitments from Any One-Way Function.
IACR Cryptol. ePrint Arch., 2010
Private Coins versus Public Coins in Zero-Knowledge Proof Systems.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010
Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010
An Efficient Parallel Repetition Theorem.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010
Game Theory with Costly Computation: Formulation and Application to Protocol Security.
Proceedings of the Innovations in Computer Science, 2010
Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions.
Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010
Concurrent Non-Malleable Zero Knowledge Proofs.
Proceedings of the Advances in Cryptology, 2010
2009
Black-Box Constructions of Two-Party Protocols from One-Way Functions.
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009
An epistemic characterization of zero knowledge.
Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2009), 2009
A logical characterization of iterated admissibility.
Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2009), 2009
A unified framework for concurrent security: universal composability from stand-alone non-malleability.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009
Non-malleability amplification.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009
2008
New and Improved Constructions of Nonmalleable Cryptographic Protocols.
SIAM J. Comput., 2008
Concurrent Nonmalleable Commitments.
SIAM J. Comput., 2008
Iterated Regret Minimization: A More Realistic Solution Concept
CoRR, 2008
Game Theory with Costly Computation
CoRR, 2008
On Constant-Round Concurrent Zero-Knowledge.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008
Concurrent Non-malleable Commitments from Any One-Way Function.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008
Adaptive One-Way Functions and Applications.
Proceedings of the Advances in Cryptology, 2008
2007
Precise Concurrent Zero Knowledge.
IACR Cryptol. ePrint Arch., 2007
An efficient parallel repetition theorem for Arthur-Merlin games.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007
Cryptography from Sunspots: How to Use an Imperfect Reference String.
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007
Relations Among Notions of Non-malleability for Encryption.
Proceedings of the Advances in Cryptology, 2007
Bounded CCA2-Secure Encryption.
Proceedings of the Advances in Cryptology, 2007
2006
A precise computational approach to knowledge.
PhD thesis, 2006
Universally Composable Security with Global Setup.
IACR Cryptol. ePrint Arch., 2006
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006
Input-Indistinguishable Computation.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006
Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One.
Proceedings of the Advances in Cryptology, 2006
Parallel Repetition of Zero-Knowledge Proofs and the Possibility of Basing Cryptography on NP-Hardness.
Proceedings of the 21st Annual IEEE Conference on Computational Complexity (CCC 2006), 2006
2005
New and improved constructions of non-malleable cryptographic protocols.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005
Concurrent Non-Malleable Commitments.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005
Unconditional Characterizations of Non-interactive Zero-Knowledge.
Proceedings of the Advances in Cryptology, 2005
2004
On the Possibility of One-Message Weak Zero-Knowledge.
Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004
Bounded-concurrent secure multi-party computation with a dishonest majority.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004
Universally Composable Protocols with Relaxed Set-Up Assumptions.
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004
2003
Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003
Simulation in Quasi-Polynomial Time, and Its Application to Protocol Composition.
Proceedings of the Advances in Cryptology, 2003
On Deniability in the Common Reference String and Random Oracle Model.
Proceedings of the Advances in Cryptology, 2003