EDBT 2026 Demo / reviewers in the wild / expert

Daniele Cozzo

dblp:235/4844 · DBLP profile ↗
← Back
13ranked-venue papers
4as first author
10since 2021 · last 2025
0000-0001-5289-3769ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 13 · 4 first-author · 10 since 2021Theory of computation · 1 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2025 Verifiable Computation for Approximate Homomorphic Encryption Schemes
Ignacio Cascudo, Anamaria Costache, Daniele Cozzo, Dario Fiore 0001, Antonio Guimarães, Eduardo Soria-Vazquez
 CRYPTO (7)3
2025 Verification-Efficient Homomorphic Signatures for Verifiable Computation over Data Streams
Gaspard Anthoine, Daniele Cozzo, Dario Fiore 0001
 FC (2)2
2024 Verifiable Secret Sharing from Symmetric Key Cryptography with Improved Optimistic Complexity
Ignacio Cascudo, Daniele Cozzo, Emanuele Giunta
 ASIACRYPT (7)2
2023 CSI-SharK: CSI-FiSh with Sharing-friendly Keys
Shahla Atapoor, Karim Baghery, Daniele Cozzo, Robi Pedersen
 ACISP3
2023 Practical Robust DKG Protocols for CSIDH
Shahla Atapoor, Karim Baghery, Daniele Cozzo, Robi Pedersen
 ACNS3
2023 VSS from Distributed ZK Proofs and Applications
Shahla Atapoor, Karim Baghery, Daniele Cozzo, Robi Pedersen
 ASIACRYPT (1)3
2023 Round-Robin is Optimal: Lower Bounds for Group Action Based Protocols
Daniele Cozzo, Emanuele Giunta
 TCC (4)1
2021 Gladius: LWR Based Efficient Hybrid Public Key Encryption with Distributed Decryption
Kelong Cong, Daniele Cozzo, Varun Maram, Nigel P. Smart
 ASIACRYPT (4)2
2021 Secure Fast Evaluation of Iterative Methods: With an Application to Secure PageRank
Daniele Cozzo, Nigel P. Smart, Younes Talibi Alaoui
 CT-RSA1
2021 An Isogeny-Based ID Protocol Using Structured Public Keys
Karim Baghery, Daniele Cozzo, Robi Pedersen
 IMACC2
2020 Sashimi: Cutting up CSI-FiSh Secret Keys to Produce an Actively Secure Distributed Signing Protocol
Daniele Cozzo, Nigel P. Smart
 PQCrypto1
2019 Sharing the LUOV: Threshold Post-quantum Signatures
Daniele Cozzo, Nigel P. Smart
 IMACC1
2019 Using TopGear in Overdrive: A More Efficient ZKPoK for SPDZ
abstract
The HighGear protocol (Eurocrypt 2018) is the fastest currently known approach to preprocessing for the SPDZ Multi-Party Computation scheme. Its backbone is formed by an Ideal Lattice-based Somewhat Homomorphic Encryption Scheme and accompanying Zero-Knowledge proofs. Unfortunately, due to certain characteristics of HighGear such current implementations limit the security parameters in a number of places. This is mainly due to memory and bandwidth consumption constraints. In this work we present a new approach to the ZKPoKs for the SPDZ Multi-Party Computation scheme. We rigorously formalize the original approach of HighGear and show how to improve upon it using a different proof strategy. This allows us to increase the security of the underlying protocols, whilst simultaneously also increasing the performance in terms of memory and bandwidth consumption as well as overall throughput of the SPDZ offline phase.
Carsten Baum, Daniele Cozzo, Nigel P. Smart
 SAC2