| Survey: Non-malleable code in the split-state model. | 0 | 0.34 | 2022 |
| (Nondeterministic) Hardness vs. Non-Malleability. | 0 | 0.34 | 2022 |
| Communication Complexity with Defective Randomness. | 0 | 0.34 | 2021 |
| Linear Threshold Secret-Sharing with Binary Reconstruction. | 0 | 0.34 | 2021 |
| New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions, Interaction, and Trust. | 0 | 0.34 | 2020 |
| Non-malleability Against Polynomial Tampering. | 0 | 0.34 | 2020 |
| Cryptography from Information Loss. | 0 | 0.34 | 2020 |
| Non-Malleability against Polynomial Tampering. | 0 | 0.34 | 2020 |
| On the Complexity of Decomposable Randomized Encodings, Or - How Friendly Can a Garbling-Friendly PRF Be? | 0 | 0.34 | 2020 |
| New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions and Interaction. | 0 | 0.34 | 2019 |
| Randomness Extraction from Somewhat Dependent Sources. | 0 | 0.34 | 2019 |
| Garbled Neural Networks are Practical. | 0 | 0.34 | 2019 |
| Limits to Non-Malleability. | 0 | 0.34 | 2019 |
| Non-malleable Codes for Decision Trees. | 0 | 0.34 | 2019 |
| Non-Malleable Codes Against Bounded Polynomial Time Tampering. | 0 | 0.34 | 2018 |
| Non-Malleable Codes for Small-Depth Circuits | 1 | 0.35 | 2018 |
| Proofs of Work from Worst-Case Assumptions. | 1 | 0.39 | 2018 |
| Exploring the Boundaries of Topology-Hiding Computation. | 2 | 0.38 | 2018 |
| Non-malleable Codes from Average-Case Hardness: $${\mathsf {A}}{\mathsf {C}}^0$$ , Decision Trees, and Streaming Space-Bounded Tampering. | 1 | 0.35 | 2018 |
| Non-Malleable Codes from Average-Case Hardness: AC0, Decision Trees, and Streaming Space-Bounded Tampering. | 4 | 0.39 | 2017 |
| Average-Case Fine-Grained Hardness. | 6 | 0.44 | 2017 |
| Proofs of Useful Work. | 4 | 0.43 | 2017 |
| Garbling Gadgets for Boolean and Arithmetic Circuits. | 10 | 0.48 | 2016 |
| Non-Malleable Codes for Bounded Depth, Bounded Fan-in Circuits. | 15 | 0.54 | 2016 |
