2025
Asynchronous YOSO a la Paillier.
IACR Cryptol. ePrint Arch., 2025
2024
OCash: Fully Anonymous Payments between Blockchain Light Clients.
IACR Cryptol. ePrint Arch., 2024
2023
Early Stopping for Any Number of Corruptions.
IACR Cryptol. ePrint Arch., 2023
Byzantine Agreement Decomposed: Honest Majority Asynchronous Total-Order Broadcast from Reliable Broadcast.
IACR Cryptol. ePrint Arch., 2023
Practical Large-Scale Proof-of-Stake Asynchronous Total-Order Broadcast.
IACR Cryptol. ePrint Arch., 2023
CRAFT: Composable Randomness Beacons and Output-Independent Abort MPC From Time.
Proceedings of the Public-Key Cryptography - PKC 2023, 2023
2022
Fast threshold ECDSA with honest majority.
J. Comput. Secur., 2022
Public Randomness Extraction with Ephemeral Roles and Worst-Case Corruptions.
IACR Cryptol. ePrint Arch., 2022
Formalizing Delayed Adaptive Corruptions and the Security of Flooding Networks.
IACR Cryptol. ePrint Arch., 2022
Enig: Player Replaceable Finality Layers with Optimal Validity.
IACR Cryptol. ePrint Arch., 2022
On Valiant's Conjecture: Impossibility of Incrementally Verifiable Computation from Random Oracles.
IACR Cryptol. ePrint Arch., 2022
Universally Composable Subversion-Resilient Cryptography.
IACR Cryptol. ePrint Arch., 2022
GearBox: Optimal-size Shard Committees by Leveraging the Safety-Liveness Dichotomy.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022
Encryption to the Future - A Paradigm for Sending Secret Messages to Future (Anonymous) Committees.
Proceedings of the Advances in Cryptology - ASIACRYPT 2022, 2022
2021
High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer.
J. Cryptol., 2021
YOSO: You Only Speak Once / Secure MPC with Stateless Ephemeral Roles.
IACR Cryptol. ePrint Arch., 2021
GearBox: An Efficient UC Sharded Ledger Leveraging the Safety-Liveness Dichotomy.
IACR Cryptol. ePrint Arch., 2021
Encryption to the Future: A Paradigm for Sending Secret Messages to Future (Anonymous) Committees.
IACR Cryptol. ePrint Arch., 2021
Random-Index PIR and Applications.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021
Weight-Based Nakamoto-Style Blockchains.
Proceedings of the Progress in Cryptology - LATINCRYPT 2021, 2021
TARDIS: A Foundation of Time-Lock Puzzles in UC.
Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021
2020
Continuously Non-malleable Codes in the Split-State Model.
J. Cryptol., 2020
Leveraging Weight Functions for Optimistic Responsiveness in Blockchains.
IACR Cryptol. ePrint Arch., 2020
Random-index PIR with Applications to Large-Scale Secure MPC.
IACR Cryptol. ePrint Arch., 2020
Fast Threshold ECDSA with Honest Majority.
IACR Cryptol. ePrint Arch., 2020
CRAFT: Composable Randomness and Almost Fairness from Time.
IACR Cryptol. ePrint Arch., 2020
TARDIS: Time And Relative Delays In Simulation.
IACR Cryptol. ePrint Arch., 2020
Afgjort: A Partially Synchronous Finality Layer for Blockchains.
Proceedings of the Security and Cryptography for Networks - 12th International Conference, 2020
2019
Continuously non-malleable codes with split-state refresh.
Theor. Comput. Sci., 2019
Lower Bounds for Leakage-Resilient Secret Sharing.
IACR Cryptol. ePrint Arch., 2019
Afgjort - A Semi-Synchronous Finality Layer for Blockchains.
IACR Cryptol. ePrint Arch., 2019
Communication Lower Bounds for Statistically Secure MPC, with or without Preprocessing.
IACR Cryptol. ePrint Arch., 2019
Reverse Firewalls for Actively Secure MPCs.
IACR Cryptol. ePrint Arch., 2019
Lower Bounds for Oblivious Data Structures.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Continuous Non-Malleable Codes in the 8-Split-State Model.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019
2018
Stronger Leakage-Resilient and Non-Malleable Secret-Sharing Schemes for General Access Structures.
IACR Cryptol. ePrint Arch., 2018
Yes, There is an Oblivious RAM Lower Bound!
Electron. Colloquium Comput. Complex., 2018
2017
Fully leakage-resilient signatures revisited: Graceful degradation, noisy leakage, and construction in the bounded-retrieval model.
Theor. Comput. Sci., 2017
Universally Composable Zero-Knowledge Proof of Membership.
IACR Cryptol. ePrint Arch., 2017
DUPLO: Unifying Cut-and-Choose for Garbled Circuits.
IACR Cryptol. ePrint Arch., 2017
Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead.
IACR Cryptol. ePrint Arch., 2017
TinyOLE: Efficient Actively Secure Two-Party Computation from Oblivious Linear Function Evaluation.
IACR Cryptol. ePrint Arch., 2017
Information Theoretic Continuously Non-Malleable Codes in the Constant Split-State Model.
Electron. Colloquium Comput. Complex., 2017
The TinyTable Protocol for 2-Party Secure Computation, or: Gate-Scrambling Revisited.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017
2016
Signature Schemes Secure Against Hard-to-Invert Leakage.
J. Cryptol., 2016
Constant Round Maliciously Secure 2PC with Function-independent Preprocessing using LEGO.
IACR Cryptol. ePrint Arch., 2016
On the Computational Overhead of MPC with Dishonest Majority.
IACR Cryptol. ePrint Arch., 2016
Cross&Clean: Amortized Garbled Circuits with Constant Overhead.
IACR Cryptol. ePrint Arch., 2016
A Framework for Outsourcing of Secure Computation.
IACR Cryptol. ePrint Arch., 2016
Non-Malleable Codes with Split-State Refresh.
IACR Cryptol. ePrint Arch., 2016
Gate-scrambling Revisited - or: The TinyTable protocol for 2-Party Secure Computation.
IACR Cryptol. ePrint Arch., 2016
Rate-1, Linear Time and Additively Homomorphic UC Commitments.
IACR Cryptol. ePrint Arch., 2016
Cross and Clean: Amortized Garbled Circuits with Constant Overhead.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016
Unconditionally Secure Computation with Reduced Interaction.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016
On the Communication Required for Unconditionally Secure Multiplication.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016
Reactive Garbling: Foundation, Instantiation, Application.
Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016
2015
Foundations of Reactive Garbling Schemes.
IACR Cryptol. ePrint Arch., 2015
On the Complexity of Additively Homomorphic UC Commitments.
IACR Cryptol. ePrint Arch., 2015
TinyLEGO: An Interactive Garbling Scheme for Maliciously Secure Two-party Computation.
IACR Cryptol. ePrint Arch., 2015
Predictable Arguments of Knowledge.
IACR Cryptol. ePrint Arch., 2015
Fully Leakage-Resilient Codes.
IACR Cryptol. ePrint Arch., 2015
On the Communication required for Unconditionally Secure Multiplication.
IACR Cryptol. ePrint Arch., 2015
Unconditionally Secure Computation with Reduced Interaction.
IACR Cryptol. ePrint Arch., 2015
A Tamper and Leakage Resilient von Neumann Architecture.
Proceedings of the Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30, 2015
Secure Multiparty Computation and Secret Sharing.
Cambridge University Press, ISBN: 9781107043053, 2015
2014
Leakage-Resilient Signatures with Graceful Degradation.
IACR Cryptol. ePrint Arch., 2014
On the Connection between Leakage Tolerance and Adaptive Security.
IACR Cryptol. ePrint Arch., 2014
Invisible Adaptive Attacks.
IACR Cryptol. ePrint Arch., 2014
Privacy-Free Garbled Circuits with Applications To Efficient Zero-Knowledge.
IACR Cryptol. ePrint Arch., 2014
Faster Maliciously Secure Two-Party Computation Using the GPU.
IACR Cryptol. ePrint Arch., 2014
A Tamper and Leakage Resilient Random Access Machine.
IACR Cryptol. ePrint Arch., 2014
Continuous Non-malleable Codes.
IACR Cryptol. ePrint Arch., 2014
Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation.
IACR Cryptol. ePrint Arch., 2014
Adaptive versus Static Security in the UC Model.
IACR Cryptol. ePrint Arch., 2014
An Efficient Pseudo-Random Generator with Applications to Public-Key Encryption and Constant-Round Multiparty Computation.
IACR Cryptol. ePrint Arch., 2014
On The Orthogonal Vector Problem and The Feasibility of Unconditionally Secure Leakage Resilient Computation.
IACR Cryptol. ePrint Arch., 2014
Compact VSS and Efficient Homomorphic UC Commitments.
IACR Cryptol. ePrint Arch., 2014
Additively Homomorphic UC commitments with Optimal Amortized Overhead.
IACR Cryptol. ePrint Arch., 2014
2013
Limits on the Power of Cryptographic Cheap Talk.
IACR Cryptol. ePrint Arch., 2013
Fast and Maliciously Secure Two-Party Computation Using the GPU.
IACR Cryptol. ePrint Arch., 2013
MiniLEGO: Efficient Secure Two-Party Computation From General Assumptions.
IACR Cryptol. ePrint Arch., 2013
Secure Key Management in the Cloud.
IACR Cryptol. ePrint Arch., 2013
2012
Actively Secure Two-Party Evaluation of any Quantum Operation.
IACR Cryptol. ePrint Arch., 2012
2011
Using Inverted Indices for Accelerating LINGO Calculations.
J. Chem. Inf. Model., 2011
A New Approach to Practical Active-Secure Two-Party Computation.
IACR Cryptol. ePrint Arch., 2011
Fully Simulatable Quantum-Secure Coin-Flipping and Applications.
IACR Cryptol. ePrint Arch., 2011
Superposition Attacks on Cryptographic Protocols}.
IACR Cryptol. ePrint Arch., 2011
Lower and Upper Bounds for Deniable Public-Key Encryption.
IACR Cryptol. ePrint Arch., 2011
A sub-cubic time algorithm for computing the quartet distance between two general trees.
Algorithms Mol. Biol., 2011
Algorithms for a Parallel Implementation of Hidden Markov Models with a Small State Space.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011
2010
A generalization of Paillier's public-key system with applications to electronic voting.
Int. J. Inf. Sec., 2010
Perfectly Secure Oblivious RAM Without Random Oracles.
IACR Cryptol. ePrint Arch., 2010
A tree-based method for the rapid screening of chemical fingerprints.
Algorithms Mol. Biol., 2010
On the theoretical gap between synchronous and asynchronous MPC protocols.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010
Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries.
Proceedings of the Advances in Cryptology, 2010
2009
On the Necessary and Sufficient Assumptions for UC Computation.
IACR Cryptol. ePrint Arch., 2009
From Passive to Covert Security at Low Cost.
IACR Cryptol. ePrint Arch., 2009
On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009
A Quadratic Time Algorithm for Computing the Quartet Distance between Two General Trees.
Proceedings of the International Joint Conferences on Bioinformatics, 2009
Secure Multiparty Computation Goes Live.
,
,
,
,
,
,
,
,
,
,
,
Proceedings of the Financial Cryptography and Data Security, 2009
Privacy-Enhancing Auctions Using Rational Cryptography.
Proceedings of the Advances in Cryptology, 2009
2008
LEGO for Two Party Secure Computation.
IACR Cryptol. ePrint Arch., 2008
Privacy-Enhancing First-Price Auctions Using Rational Cryptography.
IACR Cryptol. ePrint Arch., 2008
On the Number of Synchronous Rounds Required for Byzantine Agreement.
IACR Cryptol. ePrint Arch., 2008
Essentially Optimal Universally Composable Oblivious Transfer.
IACR Cryptol. ePrint Arch., 2008
Asynchronous Multiparty Computation: Theory and Implementation.
IACR Cryptol. ePrint Arch., 2008
Multiparty Computation Goes Live.
,
,
,
,
,
,
,
,
,
,
,
IACR Cryptol. ePrint Arch., 2008
Almost-Asynchronous MPC with Faulty Minority.
IACR Cryptol. ePrint Arch., 2008
SNPFile - A software library and file format for large scale association mapping and population genetics studies.
BMC Bioinform., 2008
OT-Combiners via Secure Computation.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008
Asynchronous Multi-Party Computation with Quadratic Communication.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008
Scalable Multiparty Computation with Nearly Optimal Work and Resilience.
Proceedings of the Advances in Cryptology, 2008
2007
Extending Oblivious Transfers Efficiently - How to get Robustness Almost for Free.
IACR Cryptol. ePrint Arch., 2007
Universally Composable Multiparty Computation with Partially Isolated Parties.
IACR Cryptol. ePrint Arch., 2007
Isolated Proofs of Knowledge and Isolated Zero Knowledge.
IACR Cryptol. ePrint Arch., 2007
Scalable and Unconditionally Secure Multiparty Computation.
Proceedings of the Advances in Cryptology, 2007
Secure Protocols with Asymmetric Trust.
Proceedings of the Advances in Cryptology, 2007
2006
Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation.
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006
Simplified Threshold RSA with Adaptive and Proactive Security.
Proceedings of the Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006
Robust Multiparty Computation with Linear Communication Complexity.
Proceedings of the Advances in Cryptology, 2006
2005
How to Split a Shared Secret into Shared Bits in Constant-Round.
IACR Cryptol. ePrint Arch., 2005
Generic yet Practical ZK Arguments from any Public-Coin HVZK
Electron. Colloquium Comput. Complex., 2005
Cryptographic Asynchronous Multi-party Computation with Optimal Resilience (Extended Abstract).
Proceedings of the Advances in Cryptology, 2005
2004
Cryptographic Asynchronous Multi-Party Computation with Optimal Resilience.
IACR Cryptol. ePrint Arch., 2004
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation.
IACR Cryptol. ePrint Arch., 2004
Universally Composable Protocols with Relaxed Set-Up Assumptions.
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004
2003
Relaxing Chosen-Ciphertext Security.
IACR Cryptol. ePrint Arch., 2003
Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption.
Proceedings of the Advances in Cryptology, 2003
2002
A Threshold Pseudorandom Function Construction and Its Applications.
Proceedings of the Advances in Cryptology, 2002
Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case.
Proceedings of the Advances in Cryptology, 2002
Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security.
Proceedings of the Advances in Cryptology, 2002
2001
Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor.
IACR Cryptol. ePrint Arch., 2001
2000
Multiparty Computation from Threshold Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2000
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption.
Proceedings of the Advances in Cryptology, 2000