Dimitris Kolonelos

Dimitris Kolonelos

Postdoc

UC Berkeley

Biography

I am a Postdoctoral Researcher in Cryptography at UC Berkeley hosted by Sanjam Garg.

In February 2024, I received my PhD from IMDEA Software Institute and Universidad Politécnica de Madrid where I was advised by Dario Fiore. I received my Diploma in Electrical and Computer Engineering from the National Technical University of Athens, where my Diploma thesis was advised by Aris Pagourtzis.

On the core of my research is Cryptography, its theoretical foundations and its applications. My current focus is on building provably secure cryptographic protocols, with an emphasis on Succinct Cryptographic Primitives, Proof Systems and Advanced Encryption Schemes without trusted authorities. My work has been motivated by the Blockchain Technology, the growing privacy concerns in the digital world and the combination of the two.

My PhD thesis is here.

My CV [Last updated: August 19, 2024].

Publications

(2024). Threshold Encryption with Silent Setup.
In CRYPTO 2024.

PDF

(2023). Cuckoo Commitments: Registration-Based Encryption and Key-Value Map Commitments for Large Spaces.
In ASIACRYPT 2023.

PDF

(2023). Distributed Broadcast Encryption from Bilinear Groups.
In ASIACRYPT 2023.

PDF

(2023). Efficient Registration-Based Encryption.
In CCS 2023.

PDF

(2023). Efficient Laconic Cryptography from Learning With Errors.
In EUROCRYPT 2023.

PDF

(2023). Zero-Knowledge Arguments for Subverted RSA Groups.
In PKC 2023.

PDF Video

(2022). Succinct Zero-Knowledge Batch Proofs for Set Accumulators.
In CCS 2022.

PDF

(2022). Ring Signatures with User-Controlled Linkability.
In ESORICS 2022.

PDF

(2022). Inner Product Functional Commitments with Constant-Size Public Parameters and Openings.
In SCN 2022.

PDF

(2021). Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular.
In FC 2021.

PDF Video

(2020). Incrementally Aggregatable Vector Commitments and Applications to Verifiable Decentralized Storage.
In ASIACRYPT 2020.

PDF Video

Talks

Invited talks:

Conference and Workshop talks:

Blog Posts

Groth-Sahai Proofs Are Not That Scary