Follow
Damiano Abram
Damiano Abram
Verified email at cs.au.dk - Homepage
Title
Cited by
Cited by
Year
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
292022
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
182022
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
72022
Low-communication multiparty triple generation for SPDZ from ring-LPN
D Abram, P Scholl
IACR International Conference on Public-Key Cryptography, 221-251, 2022
52022
Oblivious TLS via multi-party computation
D Abram, I Damgård, P Scholl, S Trieflinger
Cryptographers’ Track at the RSA Conference, 51-74, 2021
52021
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
32023
On the (Im) possibility of distributed samplers: lower bounds and party-dynamic constructions
D Abram, M Obremski, P Scholl
Cryptology ePrint Archive, 2023
32023
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
22023
Succinct homomorphic secret sharing
D Abram, L Roy, P Scholl
Annual International Conference on the Theory and Applications of …, 2024
2024
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
2024
Distributed (Correlation) Samplers: A Study on the Round Complexity of Cryptographic Sampling Protocols
D Abram
Aarhus University, 2024
2024
The system can't perform the operation now. Try again later.
Articles 1–11