| Publication | Date of Publication | Type |
|---|
| Locally verifiable distributed SNARGs | 2024-08-01 | Paper |
Correction to: ``Topology-hiding communication from minimal assumptions
Journal of Cryptology | 2023-10-25 | Paper |
One-Way Functions and (Im)perfect Obfuscation
SIAM Journal on Computing | 2023-04-04 | Paper |
| MPC with synchronous security and asynchronous responsiveness | 2023-03-29 | Paper |
| Incompressible encodings | 2022-11-09 | Paper |
| Topology-hiding communication from minimal assumptions | 2022-03-23 | Paper |
| Topology-hiding computation for networks with unknown delays | 2021-12-01 | Paper |
| Simple proofs of space-time and rational proofs of storage | 2020-05-20 | Paper |
| Is information-theoretic topology-hiding computation possible? | 2020-04-30 | Paper |
Topology-hiding computation on all graphs
Journal of Cryptology | 2020-03-03 | Paper |
| Topology-hiding computation beyond semi-honest adversaries | 2018-12-06 | Paper |
| Exploring the boundaries of topology-hiding computation | 2018-07-17 | Paper |
Topology-hiding computation on all graphs
Advances in Cryptology – CRYPTO 2017 | 2017-11-03 | Paper |
Topology-hiding computation beyond logarithmic diameter
Lecture Notes in Computer Science | 2017-06-23 | Paper |
Publicly verifiable proofs of sequential work
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
An optimally fair coin toss
Journal of Cryptology | 2016-09-21 | Paper |
Topology-hiding computation
Theory of Cryptography | 2015-07-06 | Paper |
Public verification of private effort
Theory of Cryptography | 2015-07-06 | Paper |
A mix-net from any CCA2 secure cryptosystem
Advances in Cryptology – ASIACRYPT 2012 | 2013-03-19 | Paper |
Counterexamples to hardness amplification beyond negligible
Theory of Cryptography | 2012-06-15 | Paper |
Time-lock puzzles in the random oracle model
Advances in Cryptology – CRYPTO 2011 | 2011-08-12 | Paper |
Deterministic history-independent strategies for storing information on write-once memories
Theory of Computing | 2011-05-24 | Paper |
Basing cryptographic protocols on tamper-evident seals
Theoretical Computer Science | 2010-03-10 | Paper |
On complete primitives for fairness
Theory of Cryptography | 2010-02-24 | Paper |
Non-interactive timestamping in the bounded-storage model
Journal of Cryptology | 2009-05-08 | Paper |
An Optimally Fair Coin Toss
Theory of Cryptography | 2009-03-03 | Paper |
David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware
Advances in Cryptology – EUROCRYPT 2008 | 2008-04-15 | Paper |
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories
Automata, Languages and Programming | 2007-11-28 | Paper |
Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol
Advances in Cryptology - EUROCRYPT 2006 | 2007-09-24 | Paper |
Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
Lecture Notes in Computer Science | 2007-09-04 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Advances in Cryptology – CRYPTO 2004
Lecture Notes in Computer Science | 2005-08-23 | Paper |
