1. ePrint
    On the (Im)possibility of Distributed Samplers: Lower Bounds and Party-Dynamic Constructions
    Damiano Abram, Maciej Obremski, and Peter Scholl

peer-reviewed publications


  1. TCC
    Cryptography from Planted Graphs: Security with Logarithmic-Size Messages
    Damiano Abram, Amos Beimel, Yuval Ishai, Eyal Kushilevits, and Varun Narayanan
    In Theory of Cryptography Conference – TCC 2023.
  2. C
    Security-Preserving Distributed Samplers: How to Generate any CRS in One Round without Random Oracles
    Damiano Abram, Brent Waters, and Mark Zhandry
    In CRYPTO 2023.


  1. C
    An Algebraic Framework for Silent Preprocessing with Trustless Setup and Active Security
    Damiano Abram, Ivan Damgård, Claudio Orlandi, and Peter Scholl
    In CRYPTO 2022.
  2. S&P
    Low-Bandwidth Threshold ECDSA via Pseudorandom Correlation Generators
    Damiano Abram, Ariel Nof, Claudio Orlandi, Peter Scholl, and Omer Shlomovits
    In 2022 IEEE Symposium on Security and Privacy.
  3. EC
    Distributed (Correlation) Samplers: How to Remove a Trusted Dealer in One Round
    Damiano Abram, Peter Scholl, and Sophia Yakoubov
    In EUROCRYPT 2022.
  4. PKC
    Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN
    Damiano Abram, and Peter Scholl
    In Public-Key Cryptography – PKC 2022.


  1. CT-RSA
    Oblivious TLS via Multi-party Computation
    Damiano Abram, Ivan Damgård, Peter Scholl, and Sven Trieflinger
    In Topics in Cryptology - CT-RSA 2021 - Cryptographers’ Track at the RSA Conference 2021.