| Low-bandwidth threshold ECDSA via pseudorandom correlation generators D Abram, A Nof, C Orlandi, P Scholl, O Shlomovits 2022 IEEE Symposium on Security and Privacy (SP), 2554-2572, 2022 | 41 | 2022 |
| An algebraic framework for silent preprocessing with trustless setup and active security D Abram, I Damgård, C Orlandi, P Scholl Annual International Cryptology Conference, 421-452, 2022 | 37 | 2022 |
| Low-communication multiparty triple generation for SPDZ from ring-LPN D Abram, P Scholl IACR International Conference on Public-Key Cryptography, 221-251, 2022 | 12 | 2022 |
| Distributed (correlation) samplers: how to remove a trusted dealer in one round D Abram, P Scholl, S Yakoubov Annual International Conference on the Theory and Applications of …, 2022 | 10 | 2022 |
| Security-preserving distributed samplers: how to generate any CRS in one round without random oracles D Abram, B Waters, M Zhandry Annual International Cryptology Conference, 489-514, 2023 | 8 | 2023 |
| Succinct homomorphic secret sharing D Abram, L Roy, P Scholl Annual International Conference on the Theory and Applications of …, 2024 | 7 | 2024 |
| Oblivious TLS via multi-party computation D Abram, I Damgård, P Scholl, S Trieflinger Cryptographers’ Track at the RSA Conference, 51-74, 2021 | 7 | 2021 |
| Constant-Round Simulation-Secure Coin Tossing Extension with Guaranteed Output D Abram, J Doerner, Y Ishai, V Narayanan Annual International Conference on the Theory and Applications of …, 2024 | 4 | 2024 |
| Cryptography from planted graphs: security with logarithmic-size messages D Abram, A Beimel, Y Ishai, E Kushilevitz, V Narayanan Theory of Cryptography Conference, 286-315, 2023 | 4 | 2023 |
| On the (Im) possibility of distributed samplers: lower bounds and party-dynamic constructions D Abram, M Obremski, P Scholl Cryptology ePrint Archive, 2023 | 4 | 2023 |
| Time-Based Cryptography From Weaker Assumptions: Randomness Beacons, Delay Functions and More D Abram, L Roy, M Simkin Cryptology ePrint Archive, 2024 | 1 | 2024 |
| Distributed (Correlation) Samplers: A Study on the Round Complexity of Cryptographic Sampling Protocols D Abram Aarhus University, 2024 | | 2024 |
| Distributed (Correlation) Samplers D Abram | | |
