DFDario Fiore
Dario Fiore
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Dario Fiore has a total of 68 co-authors. Here are the top co-authors by number of shared publications:
- Dario Catalano
Università di Catania
8 shared publications - David Balbás
IMDEA Software Institute
5 shared publications - Antonio Faonio
EURECOM
4 shared publications - Luigi Russo
EURECOM
3 shared publications - Russell W. F. Lai
Aalto University
3 shared publications - Cecilia Boschini
Technion
2 shared publications
Latest Publications
- 9 October 2026
- Published by Springer Nature
- p. 3-22
A SNARK for (Non-)Subsequences with Text-Sub-Linear Proving Time
- 9 October 2026
- Published by Springer Nature
- p. 3-22
A SNARK for (Non-)Subsequences with Text-Sub-Linear Proving Time
- 27 September 2026
- Published by Springer Nature
- p. 577-597
On the Power of Polynomial Preprocessing
- 27 September 2026
- Published by Springer Nature
- p. 559-576
Circuit-Succinct Algebraic Batch Arguments from Projective Functional Commitments
- 27 September 2026
- Published by Springer Nature
- p. 559-576
Circuit-Succinct Algebraic Batch Arguments from Projective Functional Commitments
- 11 August 2026
- Published by Springer Nature
- p. 362-395
Splitting Bilinear Groups: New Translations from Composite- to Prime-Order with Applications to Batch Arguments for NP
- 11 August 2026
- Published by Springer Nature
- p. 362-395
Splitting Bilinear Groups: New Translations from Composite- to Prime-Order with Applications to Batch Arguments for NP
- 24 May 2026
- Published by Springer Nature
- p. 494-526
On Verifiable Delay Functions from Time-Lock Puzzles
- 24 May 2026
- Published by Springer Nature
- p. 494-526
On Verifiable Delay Functions from Time-Lock Puzzles
- 23 May 2026
- Published by Springer Nature
- p. 424-454
Pairing-Based Functional Commitments for Circuits with Shorter Parameters
- 23 May 2026
- Published by Springer Nature
- p. 424-454
Pairing-Based Functional Commitments for Circuits with Shorter Parameters
- 2 January 2026
- Published by Springer Nature
- p. 255-272
Verification-Efficient Homomorphic Signatures for Verifiable Computation over Data Streams
- 2 January 2026
- Published by Springer Nature
- p. 255-272
Verification-Efficient Homomorphic Signatures for Verifiable Computation over Data Streams
- 17 October 2025
- Published by Springer Nature
- p. 22-41
$\mathfrak {Tetris}$! Traceable Extendable Threshold Ring Signatures and More- 17 October 2025
- Published by Springer Nature
- p. 22-41
$\mathfrak {Tetris}$! Traceable Extendable Threshold Ring Signatures and More- Open Access
- 17 August 2025
- Published by Springer Nature
- p. 643-677
Verifiable Computation for Approximate Homomorphic Encryption Schemes
- 17 August 2025
- Published by Springer Nature
- p. 643-677
Open AccessVerifiable Computation for Approximate Homomorphic Encryption Schemes