Dario Fiore

Orcid: 0000-0001-7274-6600

Affiliations:
  • IMDEA Software Institute, Madrid, Spain
  • Max Planck Institute for Software Systems, Saarbrücken, Germany (former)
  • New York University, Department of Computer Science, NY, USA
  • École Normale Supérieure, Paris, France
  • University of Catania, Italy (PhD 2010)


According to our database1, Dario Fiore authored at least 105 papers between 2008 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
SoK: Lookup Table Arguments.
IACR Cryptol. ePrint Arch., 2025

When Can We Incrementally Prove Computations of Arbitrary Depth?
IACR Cryptol. ePrint Arch., 2025

On the Power of Polynomial Preprocessing: Proving Computations in Sublinear Time, and More.
IACR Cryptol. ePrint Arch., 2025

Circuit-Succinct Algebraic Batch Arguments from Projective Functional Commitments.
IACR Cryptol. ePrint Arch., 2025

Tetris! Traceable Extendable Threshold Ring Signatures and More.
IACR Cryptol. ePrint Arch., 2025

Verification-efficient Homomorphic Signatures for Verifiable Computation over Data Streams.
IACR Cryptol. ePrint Arch., 2025

On Verifiable Delay Functions from Time-Lock Puzzles.
IACR Cryptol. ePrint Arch., 2025

$\mathfrak {Tetris}$! Traceable Extendable Threshold Ring Signatures and More.
Proceedings of the Computer Security - ESORICS 2025, 2025

Verifiable Computation for Approximate Homomorphic Encryption Schemes.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Algebraic Zero Knowledge Contingent Payment.
Proceedings of the Applied Cryptography and Network Security, 2025

2024
Progressive and efficient verification for digital signatures: extensions and experimental results.
J. Cryptogr. Eng., September, 2024

Natively Compatible Super-Efficient Lookup Arguments and How to Apply Them.
IACR Cryptol. ePrint Arch., 2024

Witness Encryption for Succinct Functional Commitments and Applications.
Proceedings of the Public-Key Cryptography - PKC 2024, 2024

Lookup Arguments: Improvements, Extensions and Applications to Zero-Knowledge Decision Trees.
Proceedings of the Public-Key Cryptography - PKC 2024, 2024

Fully-Succinct Multi-key Homomorphic Signatures from Standard Assumptions.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

Real-World Universal zkSNARKs are Non-Malleable.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

2023
From Polynomial IOP and Commitments to Non-malleable zkSNARKs.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Chainable Functional Commitments for Unbounded-Depth Circuits.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Efficient and Universally Composable Single Secret Leader Election from Pairings.
Proceedings of the Public-Key Cryptography - PKC 2023, 2023

Extendable Threshold Ring Signatures with Enhanced Anonymity.
Proceedings of the Public-Key Cryptography - PKC 2023, 2023

Modular Sumcheck Proofs with Applications to Machine Learning and Image Processing.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

Cuckoo Commitments: Registration-Based Encryption and Key-Value Map Commitments for Large Spaces.
Proceedings of the Advances in Cryptology - ASIACRYPT 2023, 2023

2022
cq: Cached quotients for fast lookups.
IACR Cryptol. ePrint Arch., 2022

Functional Commitments for Circuits from Falsifiable Assumptions.
IACR Cryptol. ePrint Arch., 2022

On the Impossibility of Algebraic Vector Commitments in Pairing-Free Groups.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

Inner Product Functional Commitments with Constant-Size Public Parameters and Openings.
Proceedings of the Security and Cryptography for Networks - 13th International Conference, 2022

Adaptively Secure Single Secret Leader Election from DDH.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Ring Signatures with User-Controlled Linkability.
Proceedings of the Computer Security - ESORICS 2022, 2022

Subversion-Resilient Enhanced Privacy ID.
Proceedings of the Topics in Cryptology - CT-RSA 2022, 2022

Succinct Zero-Knowledge Batch Proofs for Set Accumulators.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

Efficient Zero-Knowledge Proofs on Signed Data with Applications to Verifiable Computation on Data Streams.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

Additive-Homomorphic Functional Commitments and Applications to Homomorphic Signatures.
Proceedings of the Advances in Cryptology - ASIACRYPT 2022, 2022

Progressive and Efficient Verification for Digital Signatures.
Proceedings of the Applied Cryptography and Network Security, 2022

2021
A compiler for multi-key homomorphic signatures for Turing machines.
Theor. Comput. Sci., 2021

Controlled Functional Encryption Revisited: Multi-Authority Extensions and Efficient Schemes for Quadratic Functions.
Proc. Priv. Enhancing Technol., 2021

On the Efficiency and Flexibility of Signature Verification.
IACR Cryptol. ePrint Arch., 2021

Flexible and Efficient Verifiable Computation on Encrypted Data.
Proceedings of the Public-Key Cryptography - PKC 2021, 2021

Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular.
Proceedings of the Financial Cryptography and Data Security, 2021

Lunar: A Toolbox for More Efficient Universal and Updatable zkSNARKs and Commit-and-Prove Extensions.
Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

2020
Vector Commitment Techniques and Applications to Verifiable Decentralized Storage.
IACR Cryptol. ePrint Arch., 2020

Decentralized Privacy-Preserving Proximity Tracing.
IEEE Data Eng. Bull., 2020

Decentralized Privacy-Preserving Proximity Tracing.
CoRR, 2020

Boosting Verifiable Computation on Encrypted Data.
Proceedings of the Public-Key Cryptography - PKC 2020, 2020

Mon$\mathbb {Z}_{2^{k}}$a: Fast Maliciously Secure Two Party Computation on $\mathbb {Z}_{2^{k}}$.
Proceedings of the Public-Key Cryptography - PKC 2020, 2020

Incrementally Aggregatable Vector Commitments and Applications to Verifiable Decentralized Storage.
Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

Improving the Efficiency of Re-randomizable and Replayable CCA Secure Public Key Encryption.
Proceedings of the Applied Cryptography and Network Security, 2020

2019
Monℤ<sub>2<sup>k</sup></sub>a: Fast Maliciously Secure Two Party Computation on ℤ<sub>2<sup>k</sup></sub>.
IACR Cryptol. ePrint Arch., 2019

Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular.
IACR Cryptol. ePrint Arch., 2019

LegoSNARK: Modular Design and Composition of Succinct Zero-Knowledge Proofs.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

Structure-Preserving and Re-randomizable RCCA-Secure Public Key Encryption and Its Applications.
Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

2018
Practical Homomorphic Message Authenticators for Arithmetic Circuits.
J. Cryptol., 2018

Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions.
Des. Codes Cryptogr., 2018

Matrioska: A Compiler for Multi-key Homomorphic Signatures.
Proceedings of the Security and Cryptography for Networks - 11th International Conference, 2018

Multi-Input Functional Encryption for Inner Products: Function-Hiding Realizations and Constructions Without Pairings.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

On the Security Notions for Homomorphic Signatures.
Proceedings of the Applied Cryptography and Network Security, 2018

2017
A certificateless approach to onion routing.
Int. J. Inf. Sec., 2017

Partitioned Group Password-Based Authenticated Key Exchange.
IACR Cryptol. ePrint Arch., 2017

Unilaterally-Authenticated Key Exchange.
Proceedings of the Financial Cryptography and Data Security, 2017

Labeled Homomorphic Encryption - Scalable and Privacy-Preserving Processing of Outsourced Data.
Proceedings of the Computer Security - ESORICS 2017, 2017

Practical Functional Encryption for Quadratic Functions with Applications to Predicate Encryption.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2016
Practical Functional Encryption for Bilinear Forms.
IACR Cryptol. ePrint Arch., 2016

On the (In)Security of SNARKs in the Presence of Oracles.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Nearly Optimal Verifiable Data Streaming.
Proceedings of the Public-Key Cryptography - PKC 2016, 2016

Hash First, Argue Later: Adaptive Verifiable Computations on Outsourced Data.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

Multi-key Homomorphic Authenticators.
Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

2015
Algebraic (trapdoor) one-way functions: Constructions and applications.
Theor. Comput. Sci., 2015

Nearly Optimal Verifiable Data Streaming (Full Version).
IACR Cryptol. ePrint Arch., 2015

ADSNARK: Nearly Practical and Privacy-Preserving Proofs on Authenticated Data.
Proceedings of the 2015 IEEE Symposium on Security and Privacy, 2015

Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds.
Proceedings of the Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30, 2015

Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Using Linearly-Homomorphic Encryption to Evaluate Degree-2 Functions on Encrypted Data.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

2014
Verifiable Random Functions: Relations to Identity-Based Key Encapsulation and New Constructions.
J. Cryptol., 2014

Boosting Linearly-Homomorphic Encryption to Evaluate Degree-2 Functions on Encrypted Data.
IACR Cryptol. ePrint Arch., 2014

Nearly Practical and Privacy-Preserving Proofs on Authenticated Data.
IACR Cryptol. ePrint Arch., 2014

Interactive Encryption and Message Authentication.
Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014

Generalizing Homomorphic MACs for Arithmetic Circuits.
Proceedings of the Public-Key Cryptography - PKC 2014, 2014

Homomorphic Signatures with Efficient Verification for Polynomial Functions.
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

Automated Analysis of Cryptographic Assumptions in Generic Group Models.
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

Efficiently Verifiable Computation on Encrypted Data.
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014

2013
Off-line/on-line signatures revisited: a general unifying paradigm, efficient threshold variants and experimental results.
Int. J. Inf. Sec., 2013

Interactive Encryption, Message Authentication, and Anonymous Key Exchange.
IACR Cryptol. ePrint Arch., 2013

Algebraic (Trapdoor) One-Way Functions and Their Applications.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Vector Commitments and Their Applications.
Proceedings of the Public-Key Cryptography - PKC 2013 - 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, February 26, 2013

Practical Homomorphic MACs for Arithmetic Circuits.
Proceedings of the Advances in Cryptology, 2013

Privacy-Preserving Accountable Computation.
Proceedings of the Computer Security - ESORICS 2013, 2013

Verifiable delegation of computation on outsourced data.
Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, 2013

2012
Relations between the security models for certificateless encryption and ID-based key agreement.
Int. J. Inf. Sec., 2012

Improved Publicly Verifiable Delegation of Large Polynomials and Matrix Computations.
IACR Cryptol. ePrint Arch., 2012

Uniqueness Is a Different Story: Impossibility of Verifiable Random Functions from Trapdoor Permutations.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

Efficient Network Coding Signatures in the Standard Model.
Proceedings of the Public Key Cryptography - PKC 2012, 2012

From Selective to Full Security: Semi-generic Transformations in the Standard Model.
Proceedings of the Public Key Cryptography - PKC 2012, 2012

Publicly verifiable delegation of large polynomials and matrix computations, with applications.
Proceedings of the ACM Conference on Computer and Communications Security, 2012

2011
Zero-Knowledge Sets With Short Proofs.
IEEE Trans. Inf. Theory, 2011

Concise Vector Commitments and their Applications to Zero-Knowledge Elementary Databases.
IACR Cryptol. ePrint Arch., 2011

Adaptive Pseudo-free Groups and Applications.
Proceedings of the Advances in Cryptology - EUROCRYPT 2011, 2011

Fully Non-interactive Onion Routing with Forward-Secrecy.
Proceedings of the Applied Cryptography and Network Security, 2011

2010
Identity-Based Key Exchange Protocols without Pairings.
Trans. Comput. Sci., 2010

Constructing Certificateless Encryption and ID-Based Encryption from ID-Based Key Agreement.
Proceedings of the Pairing-Based Cryptography - Pairing 2010, 2010

Privacy-preserving fingercode authentication.
Proceedings of the Multimedia and Security Workshop, 2010

Making the Diffie-Hellman Protocol Identity-Based.
Proceedings of the Topics in Cryptology, 2010

A privacy-compliant fingerprint recognition system based on homomorphic encryption and Fingercode templates.
Proceedings of the Fourth IEEE International Conference on Biometrics: Theory Applications and Systems, 2010

2009
Verifiable Random Functions from Identity-Based Key Encapsulation.
Proceedings of the Advances in Cryptology, 2009

Certificateless onion routing.
Proceedings of the 2009 ACM Conference on Computer and Communications Security, 2009

2008
Off-Line/On-Line Signatures: Theoretical Aspects and Experimental Results.
Proceedings of the Public Key Cryptography, 2008

Zero-Knowledge Sets with Short Proofs.
Proceedings of the Advances in Cryptology, 2008


  Loading...