Damiano Abram

Orcid: 0009-0004-3916-7550

According to our database1, Damiano Abram authored at least 14 papers between 2021 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Trapdoor Hash Functions and PIR from Low-Noise LPN.
IACR Cryptol. ePrint Arch., 2025

Key-Homomorphic Computations for RAM: Fully Succinct Randomised Encodings and More.
IACR Cryptol. ePrint Arch., 2025

Succinct Oblivious Tensor Evaluation and Applications: Adaptively-Secure Laconic Function Evaluation and Trapdoor Hashing for All Circuits.
IACR Cryptol. ePrint Arch., 2025

2024
Succinct Homomorphic Secret Sharing.
IACR Cryptol. ePrint Arch., 2024

Time-Based Cryptography From Weaker Assumptions: Randomness Beacons, Delay Functions and More.
IACR Cryptol. ePrint Arch., 2024

Constant-Round Simulation-Secure Coin Tossing Extension with Guaranteed Output.
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

2023
Security-Preserving Distributed Samplers: How to Generate any CRS in One Round without Random Oracles.
IACR Cryptol. ePrint Arch., 2023

On the (Im)possibility of Distributed Samplers: Lower Bounds and Party-Dynamic Constructions.
IACR Cryptol. ePrint Arch., 2023

Cryptography from Planted Graphs: Security with Logarithmic-Size Messages.
IACR Cryptol. ePrint Arch., 2023

2022
Distributed (Correlation) Samplers: How to Remove a Trusted Dealer in One Round.
IACR Cryptol. ePrint Arch., 2022

Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN.
IACR Cryptol. ePrint Arch., 2022

An Algebraic Framework for Silent Preprocessing with Trustless Setup and Active Security.
IACR Cryptol. ePrint Arch., 2022

2021
Low-Bandwidth Threshold ECDSA via Pseudorandom Correlation Generators.
IACR Cryptol. ePrint Arch., 2021

Oblivious TLS via Multi-Party Computation.
IACR Cryptol. ePrint Arch., 2021


  Loading...