| CoCoA: Concurrent Continuous Group Key Agreement. | 0 | 0.34 | 2022 |
| Coffee: Fast Healing Concurrent Continuous Group Key Agreement for Decentralized Group Messaging. | 0 | 0.34 | 2022 |
| Practical Statistically-Sound Proofs of Exponentiation in any Group. | 0 | 0.34 | 2022 |
| Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement | 0 | 0.34 | 2021 |
| Grafting Key Trees: Efficient Key Management for Overlapping Groups | 0 | 0.34 | 2021 |
| The Cost of Adaptivity in Security Games on Graphs | 0 | 0.34 | 2021 |
| On Treewidth, Separators and Yao's Garbling | 0 | 0.34 | 2021 |
| HIDE & SEEK: Privacy-Preserving Rebalancing on Payment Channel Networks. | 0 | 0.34 | 2021 |
| Limits On The Adaptive Security Of Yao'S Garbling | 0 | 0.34 | 2021 |
| Trojan-Resilience Without Cryptography | 0 | 0.34 | 2021 |
| LightPIR: Privacy-Preserving Route Discovery for Payment Channel Networks | 0 | 0.34 | 2021 |
| Inverse-Sybil Attacks in Automated Contact Tracing. | 0 | 0.34 | 2021 |
| Proofs of Catalytic Space. | 0 | 0.34 | 2019 |
| Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir. | 0 | 0.34 | 2019 |
| PPAD-Hardness via Iterated Squaring Modulo a Composite. | 0 | 0.34 | 2019 |
| Simple Verifiable Delay Functions. | 0 | 0.34 | 2019 |
| Keep the Dirt: Tainted TreeKEM, an Efficient and Provably Secure Continuous Group Key Agreement Protocol. | 0 | 0.34 | 2019 |
| Reversible Proofs of Sequential Work. | 0 | 0.34 | 2019 |
| Sustained Space Complexity. | 1 | 0.37 | 2018 |
| Simple Proofs of Sequential Work. | 2 | 0.40 | 2018 |
| Adaptively Secure Proxy Re-encryption. | 0 | 0.34 | 2018 |
| SpaceMint - A Cryptocurrency Based on Proofs of Space. | 3 | 0.38 | 2018 |
| On the Memory-Hardness of Data-Independent Password-Hashing Functions. | 0 | 0.34 | 2018 |
| Beyond Hellman's Time-Memory Trade-Offs with Applications to Proofs of Space. | 0 | 0.34 | 2017 |
| Scrypt is Maximally Memory-Hard. | 9 | 0.48 | 2017 |
| Position-Based Cryptography and Multiparty Communication Complexity. | 0 | 0.34 | 2017 |
| Non-Uniform Attacks Against Pseudoentropy. | 0 | 0.34 | 2017 |
| Be Adaptive, Avoid Overcommitting. | 1 | 0.35 | 2017 |
| Depth-Robust Graphs and Their Cumulative Memory Complexity. | 9 | 0.54 | 2017 |
| Constrained PRFs for Unbounded Inputs. | 0 | 0.34 | 2016 |
| A Quasipolynomial Reduction for Generalized Selective Decryption on Trees. | 1 | 0.37 | 2016 |
| Offline Witness Encryption. | 0 | 0.34 | 2016 |
| Standard Security Does Imply Security Against Selective Opening for Markov Distributions. | 1 | 0.34 | 2016 |
| On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model. | 11 | 0.58 | 2016 |
| Pseudoentropy: Lower-bounds for Chain rules and Transformations. | 1 | 0.36 | 2016 |
| The Exact Security Of Pmac | 4 | 0.39 | 2016 |
| New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators. | 7 | 0.45 | 2015 |
| Spacemint: A Cryptocurrency Based on Proofs of Space. | 0 | 0.34 | 2015 |
| Proofs Of Space | 9 | 0.57 | 2015 |
| The Chain Rule for HILL Pseudoentropy, Revisited. | 2 | 0.38 | 2015 |
| The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC | 9 | 0.54 | 2015 |
| Tight Bounds for Keyed Sponges and Truncated CBC. | 0 | 0.34 | 2015 |
| Key-Homomorphic Constrained Pseudorandom Functions. | 0 | 0.34 | 2015 |
| Generic Security of NMAC and HMAC with Input Whitening. | 3 | 0.39 | 2015 |
| Standard Security Does Imply Security Against Selective Opening for Markov Distributions. | 5 | 0.42 | 2015 |
| Condensed Unpredictability. | 0 | 0.34 | 2015 |
| Efficient Zero-Knowledge Proofs for Commitments from Learning With Errors over Rings. | 11 | 0.50 | 2015 |
| How to Fake Auxiliary Input. | 9 | 0.53 | 2014 |
| Adaptive Security of Constrained PRFs. | 14 | 0.61 | 2014 |
| Key Derivation Without Entropy Waste. | 2 | 0.37 | 2014 |
