| Companionship Is Not a Function: The Effect of a Novel Robotic Object on Healthy Older Adults' Feelings of "Being-Seen" | 3 | 0.40 | 2020 |
| Topology-Hiding Computation on All Graphs. | 0 | 0.34 | 2020 |
| Simple Proofs of Space-Time and Rational Proofs of Storage. | 0 | 0.34 | 2019 |
| Topology-Hiding Computation for Networks with Unknown Delays. | 0 | 0.34 | 2019 |
| Robust MPC: Asynchronous Responsiveness yet Synchronous Security. | 0 | 0.34 | 2019 |
| Topology-Hiding Computation Beyond Semi-Honest Adversaries | 0 | 0.34 | 2018 |
| Combining Asynchronous and Synchronous Byzantine Agreement: The Best of Both Worlds. | 0 | 0.34 | 2018 |
| Exploring the Boundaries of Topology-Hiding Computation. | 2 | 0.38 | 2018 |
| Tortoise and Hares Consensus: the Meshcash Framework for Incentive-Compatible, Scalable Cryptocurrencies. | 1 | 0.38 | 2017 |
| Topology-Hiding Computation Beyond Logarithmic Diameter. | 4 | 0.41 | 2017 |
| Proofs of Space-Time and Rational Proofs of Storage. | 3 | 0.55 | 2016 |
| How to Use Bitcoin to Play Decentralized Poker | 27 | 0.90 | 2015 |
| One-Way Functions and (Im)Perfect Obfuscation | 28 | 0.89 | 2014 |
| Topology-Hiding Computation. | 7 | 0.48 | 2014 |
| Truthful Mechanisms for Agents that Value Privacy | 26 | 1.61 | 2013 |
| Publicly verifiable proofs of sequential work | 4 | 0.43 | 2013 |
| There is no Indistinguishability Obfuscation in Pessiland. | 8 | 0.66 | 2013 |
| Review of Surveillance or Security? by Susan Landau | 0 | 0.34 | 2013 |
| Counterexamples to hardness amplification beyond negligible | 4 | 0.39 | 2012 |
| A mix-net from any CCA2 secure cryptosystem | 10 | 0.49 | 2012 |
| Time-lock puzzles in the random oracle model | 13 | 0.84 | 2011 |
| Non-Interactive Time-Stamping and Proofs of Work in the Random Oracle Model. | 4 | 0.65 | 2011 |
| On complete primitives for fairness | 13 | 0.68 | 2010 |
| The phish-market protocol: securely sharing attack data between competitors | 3 | 0.49 | 2010 |
| Split-ballot voting: Everlasting privacy with distributed trust | 46 | 1.47 | 2010 |
| The Phish-Market Protocol: Secure Sharing Between Competitors | 4 | 0.44 | 2010 |
| Attacking paper-based e2e voting systems | 5 | 0.43 | 2010 |
| Basing cryptographic protocols on tamper-evident seals | 17 | 0.88 | 2010 |
| Shuffle-sum: coercion-resistant verifiable tallying for STV voting | 16 | 0.93 | 2009 |
| Non-interactive Timestamping in the Bounded-Storage Model | 6 | 0.53 | 2009 |
| An Optimally Fair Coin Toss | 16 | 0.83 | 2009 |
| David and Goliath commitments: UC computation for asymmetric parties using tamper-proof hardware | 45 | 1.30 | 2008 |
| Deterministic history-independent strategies for storing information on write-once memories | 8 | 0.49 | 2007 |
| Polling with physical envelopes: a rigorous analysis of a human-centric protocol | 22 | 1.56 | 2006 |
| Receipt-free universally-verifiable voting with everlasting privacy | 82 | 2.80 | 2006 |
| Non-interactive Timestamping in the Bounded Storage Model | 12 | 0.72 | 2004 |
