| Optimal Sorting Circuits for Short Keys | 0 | 0.34 | 2022 |
| log*-Round Game-Theoretically-Fair Leader Election. | 0 | 0.34 | 2022 |
| What Can Cryptography Do For Decentralized Mechanism Design? | 0 | 0.34 | 2022 |
| SORTING SHORT KEYS IN CIRCUITS OF SIZE o(n log n) | 0 | 0.34 | 2022 |
| NanoGRAM: Garbled RAM with $\widetilde{O}(\log N)$ Overhead. | 0 | 0.34 | 2022 |
| Non-Interactive Anonymous Router with Quasi-Linear Router Computation. | 0 | 0.34 | 2022 |
| Differentially Private Densest Subgraph | 0 | 0.34 | 2022 |
| Locally Differentially Private Sparse Vector Aggregation | 0 | 0.34 | 2022 |
| Locality-Preserving Oblivious RAM | 0 | 0.34 | 2022 |
| The Power of the Differentially Oblivious Shuffle in Distributed Privacy Mechanisms. | 0 | 0.34 | 2022 |
| Revisiting the Power of Non-Equivocation in Distributed Protocols | 0 | 0.34 | 2022 |
| Rapidash: Improved Constructions for Side-Contract-Resilient Fair Exchange. | 0 | 0.34 | 2022 |
| Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions. | 0 | 0.34 | 2021 |
| Puncturable Pseudorandom Sets And Private Information Retrieval With Near-Optimal Online Bandwidth And Time | 0 | 0.34 | 2021 |
| Differentially Oblivious Turing Machines. | 0 | 0.34 | 2021 |
| Differentially Oblivious Database Joins - Overcoming the Worst-Case Curse of Fully Oblivious Algorithms. | 0 | 0.34 | 2021 |
| Sorting Short Keys in Circuits of Size o(n log n) | 0 | 0.34 | 2021 |
| Foundations of Transaction Fee Mechanism Design. | 0 | 0.34 | 2021 |
| Selfish Mining Attacks Exacerbated by Elastic Hash Supply | 0 | 0.34 | 2021 |
| Streamlet: An Absurdly Simple, Textbook Blockchain Protocol | 0 | 0.34 | 2021 |
| Oblivious Ram With Worst-Case Logarithmic Overhead | 0 | 0.34 | 2021 |
| MPC for MPC - Secure Computation on a Massively Parallel Computing Architecture. | 0 | 0.34 | 2020 |
| Streamlet - Textbook Streamlined Blockchains. | 0 | 0.34 | 2020 |
| Bucket Oblivious Sort - An Extremely Simple Oblivious Sort. | 0 | 0.34 | 2020 |
| A Retrospective on Path ORAM | 0 | 0.34 | 2020 |
| Locality-Preserving Oblivious RAM. | 0 | 0.34 | 2019 |
| Towards Automated Safety Vetting of PLC Code in Real-World Plants | 0 | 0.34 | 2019 |
| Round Complexity of Byzantine Agreement, Revisited. | 0 | 0.34 | 2019 |
| Synchronous, with a Chance of Partition Tolerance | 1 | 0.36 | 2019 |
| Snow White - Robustly Reconfigurable Consensus and Applications to Provably Secure Proof of Stake. | 2 | 0.40 | 2019 |
| Communication Complexity of Byzantine Agreement, Revisited. | 1 | 0.35 | 2019 |
| Can We Overcome the n log n Barrier for Oblivious Sorting? | 0 | 0.34 | 2019 |
| More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting. | 0 | 0.34 | 2018 |
| Analysis of Deterministic Longest-Chain Protocols | 0 | 0.34 | 2018 |
| Symbolic Proofs for Lattice-Based Cryptography. | 1 | 0.36 | 2018 |
| Rethinking Large-Scale Consensus. | 0 | 0.34 | 2018 |
| OptORAMa: Optimal Oblivious RAM. | 1 | 0.36 | 2018 |
| Perfectly Secure Oblivious Parallel Ram | 2 | 0.39 | 2018 |
| Communication-Efficient Byzantine Agreement without Erasures. | 1 | 0.37 | 2018 |
| xJsnark: A Framework for Efficient Verifiable Computation | 2 | 0.38 | 2018 |
| PiLi: An Extremely Simple Synchronous Blockchain. | 0 | 0.34 | 2018 |
| HOP: Hardware makes Obfuscation Practical. | 7 | 0.42 | 2017 |
| Circuit OPRAM: Unifying Statistically and Computationally Secure ORAMs and OPRAMs. | 2 | 0.37 | 2017 |
| Formal Abstractions for Attested Execution Secure Processors. | 17 | 0.66 | 2017 |
| Hybrid Consensus: Efficient Consensus in the Permissionless Model. | 13 | 0.76 | 2017 |
| On the Depth of Oblivious Parallel RAM. | 4 | 0.39 | 2017 |
| Solidus: Confidential Distributed Ledger Transactions via PVORM. | 11 | 0.68 | 2017 |
| Distributed Private Data Analysis: Lower Bounds and Practical Constructions. | 1 | 0.34 | 2017 |
| Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM. | 28 | 0.77 | 2016 |
| The Ring of Gyges: Investigating the Future of Criminal Smart Contracts. | 30 | 3.13 | 2016 |
