| Compact Certificates of Collective Knowledge | 0 | 0.34 | 2021 |
| Algorand: A secure and efficient distributed ledger | 7 | 0.55 | 2019 |
| ALGORAND AGREEMENT: Super Fast and Partition Resilient Byzantine Agreement. | 0 | 0.34 | 2018 |
| Very Simple and Efficient Byzantine Agreement. | 0 | 0.34 | 2017 |
| Collusion, efficiency, and dominant strategies. | 0 | 0.34 | 2017 |
| Reconstructing Markov processes from independent and anonymous experiments | 4 | 0.72 | 2016 |
| Leveraging Possibilistic Beliefs in Unrestricted Combinatorial Auctions. | 0 | 0.34 | 2016 |
| Auction Revenue In The General Spiteful-Utility Model | 0 | 0.34 | 2016 |
| Mechanisms With Costly Knowledge | 0 | 0.34 | 2016 |
| What it means to receive the Turing award | 0 | 0.34 | 2015 |
| Democoin: A Publicly Verifiable and Jointly Serviced Cryptocurrency. | 0 | 0.34 | 2015 |
| Cryptography miracles, secure auctions, matching problem verification | 2 | 0.36 | 2014 |
| Knightian Analysis of the VCG Mechanism in Unrestricted Combinatorial Auctions. | 2 | 0.45 | 2014 |
| Bridging Utility Maximization and Regret Minimization. | 2 | 0.55 | 2014 |
| Rational and resilient protocols | 0 | 0.34 | 2014 |
| Knightian Robustness of Single-Parameter Domains. | 2 | 0.45 | 2014 |
| The Query Complexity of Scoring Rules | 0 | 0.34 | 2014 |
| Knightian Robustness of the Vickrey Mechanism. | 3 | 0.74 | 2014 |
| Knightian Robustness from Regret Minimization. | 2 | 0.45 | 2014 |
| Parametric digital auctions | 0 | 0.34 | 2013 |
| Optimal and Efficient Parametric Auctions. | 7 | 0.73 | 2013 |
| Super-efficient rational proofs | 8 | 0.63 | 2013 |
| Mechanism design with approximate valuations | 9 | 0.72 | 2012 |
| Rational proofs | 3 | 0.49 | 2012 |
| Collusive dominant-strategy truthfulness. | 4 | 0.54 | 2012 |
| Perfect implementation | 2 | 0.41 | 2011 |
| Crowdsourced Bayesian Auctions - (Abstract). | 0 | 0.34 | 2011 |
| Mechanism Design with Set-Theoretic Beliefs | 4 | 0.48 | 2011 |
| Optimal Error Correction for Computationally Bounded Noise | 5 | 0.45 | 2010 |
| Robustly Leveraging Collusion in Combinatorial Auctions | 5 | 0.58 | 2010 |
| Perfect concrete implementation of arbitrary mechanisms: a quick summary of joint work with Sergei Izmalkov and Matt Lepinski | 1 | 0.40 | 2010 |
| Purely Rational Secret Sharing (Extended Abstract) | 16 | 0.66 | 2009 |
| Verifiably Secure Devices | 13 | 0.81 | 2008 |
| Local zero knowledge | 27 | 0.95 | 2006 |
| Independent zero-knowledge sets | 16 | 0.84 | 2006 |
| Input-Indistinguishable Computation | 37 | 1.04 | 2006 |
| Fair-zero knowledge | 8 | 0.98 | 2005 |
| Completely fair SFE and coalition-safe cheap talk | 51 | 2.69 | 2004 |
| Sequential Aggregate Signatures from Trapdoor Permutations. | 88 | 3.37 | 2004 |
| Zero-knowledge sets | 89 | 3.07 | 2003 |
| Fractal Merkle tree representation and traversal | 38 | 3.15 | 2003 |
| Simple and fast optimistic protocols for fair electronic exchange | 93 | 3.02 | 2003 |
| Physically Observable Cryptography. | 125 | 5.09 | 2003 |
| Plaintext Awareness via Key Registration | 50 | 1.72 | 2003 |
| Transitive Signature Schemes | 60 | 4.58 | 2002 |
| Accountable-subgroup multisignatures: extended abstract | 99 | 6.00 | 2001 |
| Identification Protocols Secure against Reset Attacks | 49 | 2.36 | 2001 |
| Soundness in the Public-Key Model | 59 | 1.99 | 2001 |
| Min-round Resettable Zero-Knowledge in the Public-Key Model | 20 | 0.86 | 2001 |
| Reducibility and Completeness in Private Computations | 37 | 2.92 | 2000 |
