Zero-Knowledge Sets with Short Proofs. - Dario Catalano; Dario Fiore 001; Mariagrazia Messina (EUROCRYPT, 2008)

Off-Line/On-Line Signatures: Theoretical Aspects and Experimental Results. - Dario Catalano; Mario Di Raimondo; Dario Fiore 001; Rosario Gennaro (Public Key Cryptography, 2008)

Certificateless onion routing. - Dario Catalano; Dario Fiore 001; Rosario Gennaro (CCS, 2009)

Verifiable Random Functions from Identity-Based Key Encapsulation. - Michel Abdalla; Dario Catalano; Dario Fiore 001 (EUROCRYPT, 2009)

Making the Diffie-Hellman Protocol Identity-Based. - Dario Fiore 001; Rosario Gennaro (IACR Cryptol. ePrint Arch., 2009)

Constructing Certificateless Encryption and ID-Based Encryption from ID-Based Key Agreement. - Dario Fiore 001; Rosario Gennaro; Nigel P. Smart (IACR Cryptol. ePrint Arch., 2009)

A privacy-compliant fingerprint recognition system based on homomorphic encryption and Fingercode templates. - Mauro Barni; Tiziano Bianchi; Dario Catalano; Mario Di Raimondo; Ruggero Donida Labati; Pierluigi Failla; Dario Fiore 001; Riccardo Lazzeretti; Vincenzo Piuri; Alessandro Piva; Fabio Scotti (BTAS, 2010)

Privacy-preserving fingercode authentication. - Mauro Barni; Tiziano Bianchi; Dario Catalano; Mario Di Raimondo; Ruggero Donida Labati; Pierluigi Failla; Dario Fiore 001; Riccardo Lazzeretti; Vincenzo Piuri; Fabio Scotti; Alessandro Piva (MM&Sec, 2010)

Uniqueness is a Different Story: Impossibility of Verifiable Random Functions from Trapdoor Permutations. - Dario Fiore 001; Dominique Schröder (IACR Cryptol. ePrint Arch., 2010)

Identity-Based Key Exchange Protocols without Pairings. - Dario Fiore 001; Rosario Gennaro (Trans. Comput. Sci., 2010)

Concise Vector Commitments and their Applications to Zero-Knowledge Elementary Databases. - Dario Catalano; Dario Fiore 001 (IACR Cryptol. ePrint Arch., 2011)

Adaptive Pseudo-Free Groups and Applications. - Dario Catalano; Dario Fiore 001; Bogdan Warinschi (IACR Cryptol. ePrint Arch., 2011)

Efficient Network Coding Signatures in the Standard Model. - Dario Catalano; Dario Fiore 001; Bogdan Warinschi (IACR Cryptol. ePrint Arch., 2011)

Zero-Knowledge Sets With Short Proofs. - Dario Catalano; Mario Di Raimondo; Dario Fiore 001; Mariagrazia Messina (IEEE Trans. Inf. Theory, 2011)

From Selective to Full Security: Semi-Generic Transformations in the Standard Model. - Michel Abdalla; Dario Fiore 001; Vadim Lyubashevsky (IACR Cryptol. ePrint Arch., 2012)

Publicly Verifiable Delegation of Large Polynomials and Matrix Computations, with Applications. - Dario Fiore 001; Rosario Gennaro (IACR Cryptol. ePrint Arch., 2012)

Improved Publicly Verifiable Delegation of Large Polynomials and Matrix Computations. - Dario Fiore 001; Rosario Gennaro (IACR Cryptol. ePrint Arch., 2012)

Relations between the security models for certificateless encryption and ID-based key agreement. - Dario Fiore 001; Rosario Gennaro; Nigel P. Smart (Int. J. Inf. Sec., 2012)

Privacy-Preserving Accountable Computation. - Michael Backes 001; Dario Fiore 001; Esfandiar Mohammadi (ESORICS, 2013)

Vector Commitments and Their Applications. - Dario Catalano; Dario Fiore 001 (Public Key Cryptography, 2013)

Algebraic (Trapdoor) One-Way Functions and Their Applications. - Dario Catalano; Dario Fiore 001; Rosario Gennaro; Konstantinos Vamvourellis (TCC, 2013)

Verifiable Delegation of Computation on Outsourced Data. - Michael Backes 001; Dario Fiore 001; Raphael M. Reischuk (IACR Cryptol. ePrint Arch., 2013)

Interactive Encryption, Message Authentication, and Anonymous Key Exchange. - Yevgeniy Dodis; Dario Fiore 001 (IACR Cryptol. ePrint Arch., 2013)

Off-line/on-line signatures revisited: a general unifying paradigm, efficient threshold variants and experimental results. - Emmanuel Bresson; Dario Catalano; Mario Di Raimondo; Dario Fiore 001; Rosario Gennaro (Int. J. Inf. Sec., 2013)

Fully non-interactive onion routing with forward secrecy. - Dario Catalano; Mario Di Raimondo; Dario Fiore 001; Rosario Gennaro; Orazio Puglisi (Int. J. Inf. Sec., 2013)

Efficiently Verifiable Computation on Encrypted Data. - Dario Fiore 001; Rosario Gennaro; Valerio Pastro (CCS, 2014)

Interactive Encryption and Message Authentication. - Yevgeniy Dodis; Dario Fiore 001 (SCN, 2014)

Nearly Practical and Privacy-Preserving Proofs on Authenticated Data. - Michael Backes 001; Dario Fiore 001; Raphael M. Reischuk (IACR Cryptol. ePrint Arch., 2014)

Boosting Linearly-Homomorphic Encryption to Evaluate Degree-2 Functions on Encrypted Data. - Dario Catalano; Dario Fiore 001 (IACR Cryptol. ePrint Arch., 2014)

Homomorphic Signatures with Efficient Verification for Polynomial Functions. - Dario Catalano; Dario Fiore 001; Bogdan Warinschi (IACR Cryptol. ePrint Arch., 2014)

Verifiable Random Functions: Relations to Identity-Based Key Encapsulation and New Constructions. - Michel Abdalla; Dario Catalano; Dario Fiore 001 (J. Cryptol., 2014)

Using Linearly-Homomorphic Encryption to Evaluate Degree-2 Functions on Encrypted Data. - Dario Catalano; Dario Fiore 001 (CCS, 2015)

ADSNARK: Nearly Practical and Privacy-Preserving Proofs on Authenticated Data. - Michael Backes 001; Manuel Barbosa; Dario Fiore 001; Raphael M. Reischuk (IEEE Symposium on Security and Privacy, 2015)

Practical Homomorphic MACs for Arithmetic Circuits. - Dario Catalano; Dario Fiore 001 (IACR Cryptol. ePrint Arch., 2015)

Generalizing Homomorphic MACs for Arithmetic Circuits. - Dario Catalano; Dario Fiore 001; Rosario Gennaro; Luca Nizzardo (IACR Cryptol. ePrint Arch., 2015)

Programmable Hash Functions go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys. - Dario Catalano; Dario Fiore 001; Luca Nizzardo (IACR Cryptol. ePrint Arch., 2015)

Nearly Optimal Verifiable Data Streaming (Full Version). - Johannes Krupp; Dominique Schröder; Mark Simkin 001; Dario Fiore 001; Giuseppe Ateniese; Stefan Nürnberger (IACR Cryptol. ePrint Arch., 2015)

Algebraic (trapdoor) one-way functions: Constructions and applications. - Dario Catalano; Dario Fiore 001; Rosario Gennaro; Konstantinos Vamvourellis (Theor. Comput. Sci., 2015)

Nearly Optimal Verifiable Data Streaming. - Johannes Krupp; Dominique Schröder; Mark Simkin 001; Dario Fiore 001; Giuseppe Ateniese; Stefan Nürnberger (Public Key Cryptography (1), 2016)

Practical Functional Encryption for Bilinear Forms. - Carmen Elisabetta Zaira Baltico; Dario Catalano; Dario Fiore 001 (IACR Cryptol. ePrint Arch., 2016)

On the Security Notions for Homomorphic Signatures. - Dario Catalano; Dario Fiore 001; Luca Nizzardo (IACR Cryptol. ePrint Arch., 2016)

Hash First, Argue Later: Adaptive Verifiable Computations on Outsourced Data. - Dario Fiore 001; Cédric Fournet; Esha Ghosh; Markulf Kohlweiss; Olga Ohrimenko; Bryan Parno (IACR Cryptol. ePrint Arch., 2016)

On the (In)security of SNARKs in the Presence of Oracles. - Dario Fiore 001; Anca Nitulescu (IACR Cryptol. ePrint Arch., 2016)

Strongly-optimal structure preserving signatures from Type II pairings: synthesis and lower bounds. - Gilles Barthe; Edvard Fagerholm; Dario Fiore 001; Andre Scedrov; Benedikt Schmidt; Mehdi Tibouchi (IET Inf. Secur., 2016)

Partitioned Group Password-Based Authenticated Key Exchange. - Dario Fiore 001; María Isabel González Vasco; Claudio Soriente (Comput. J., 2017)

Multi-Input Functional Encryption for Inner Products: Function-Hiding Realizations and Constructions without Pairings. - Michel Abdalla; Dario Catalano; Dario Fiore 001; Romain Gay; Bogdan Ursu (IACR Cryptol. ePrint Arch., 2017)

Practical Functional Encryption for Quadratic Functions with Applications to Predicate Encryption. - Carmen Elisabetta Zaira Baltico; Dario Catalano; Dario Fiore 001; Romain Gay (IACR Cryptol. ePrint Arch., 2017)

Labeled Homomorphic Encryption: Scalable and Privacy-Preserving Processing of Outsourced Data. - Manuel Barbosa; Dario Catalano; Dario Fiore 001 (IACR Cryptol. ePrint Arch., 2017)

Unilaterally-Authenticated Key Exchange. - Yevgeniy Dodis; Dario Fiore 001 (IACR Cryptol. ePrint Arch., 2017)

A certificateless approach to onion routing. - Dario Catalano; Dario Fiore 001; Rosario Gennaro (Int. J. Inf. Sec., 2017)

Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions. - Dario Catalano; Dario Fiore 001; Luca Nizzardo (Des. Codes Cryptogr., 2018)

Matrioska: A Compiler for Multi-Key Homomorphic Signatures. - Dario Fiore 001; Elena Pagnin (IACR Cryptol. ePrint Arch., 2018)

Practical Homomorphic Message Authenticators for Arithmetic Circuits. - Dario Catalano; Dario Fiore 001 (J. Cryptol., 2018)

Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular. - Daniel Benarroch; Matteo Campanelli; Dario Fiore 001; Dimitris Kolonelos (IACR Cryptol. ePrint Arch., 2019)

LegoSNARK: Modular Design and Composition of Succinct Zero-Knowledge Proofs. - Matteo Campanelli; Dario Fiore 001; Anaïs Querol (IACR Cryptol. ePrint Arch., 2019)

Monℤ2ka: Fast Maliciously Secure Two Party Computation on ℤ2k. - Dario Catalano; Mario Di Raimondo; Dario Fiore 001; Irene Giacomelli (IACR Cryptol. ePrint Arch., 2019)

Structure-Preserving and Re-randomizable RCCA-secure Public Key Encryption and its Applications. - Antonio Faonio; Dario Fiore 001; Javier Herranz; Carla Ràfols (IACR Cryptol. ePrint Arch., 2019)

Multi-key homomorphic authenticators. - Dario Fiore 001; Aikaterini Mitrokotsa; Luca Nizzardo; Elena Pagnin (IET Inf. Secur., 2019)

Automated Analysis of Cryptographic Assumptions in Generic Group Models. - Gilles Barthe; Edvard Fagerholm; Dario Fiore 001; John C. Mitchell; Andre Scedrov; Benedikt Schmidt (J. Cryptol., 2019)

Improving the Efficiency of Re-randomizable and Replayable CCA Secure Public Key Encryption. - Antonio Faonio; Dario Fiore 001 (ACNS (1), 2020)

Incrementally Aggregatable Vector Commitments and Applications to Verifiable Decentralized Storage. - Matteo Campanelli; Dario Fiore 001; Nicola Greco; Dimitris Kolonelos; Luca Nizzardo (ASIACRYPT (2), 2020)

Mon$ mathbb {Z}_{2^{k}}$a: Fast Maliciously Secure Two Party Computation on $ mathbb {Z}_{2^{k}}$. - Dario Catalano; Mario Di Raimondo; Dario Fiore 001; Irene Giacomelli (Public Key Cryptography (2), 2020)

Decentralized Privacy-Preserving Proximity Tracing. - Carmela Troncoso; Mathias Payer; Jean-Pierre Hubaux; Marcel Salathé; James R. Larus; Edouard Bugnion; Wouter Lueks; Theresa Stadler; Apostolos Pyrgelis; Daniele Antonioli; Ludovic Barman; Sylvain Chatel; et al. (CoRR, 2020)

Decentralized Privacy-Preserving Proximity Tracing. - Carmela Troncoso; Mathias Payer; Jean-Pierre Hubaux; Marcel Salathé; James R. Larus; Wouter Lueks; Theresa Stadler; Apostolos Pyrgelis; Daniele Antonioli; Ludovic Barman; Sylvain Chatel; Kenneth G. Paterson; et al. (IEEE Data Eng. Bull., 2020)

Flexible and Efficient Verifiable Computation on Encrypted Data. - Alexandre Bois; Ignacio Cascudo; Dario Fiore 001; Dongwoo Kim 003 (IACR Cryptol. ePrint Arch., 2020)

Lunar: a Toolbox for More Efficient Universal and Updatable zkSNARKs and Commit-and-Prove Extensions. - Matteo Campanelli; Antonio Faonio; Dario Fiore 001; Anaïs Querol; Hadrián Rodríguez (IACR Cryptol. ePrint Arch., 2020)

Vector Commitment Techniques and Applications to Verifiable Decentralized Storage. - Matteo Campanelli; Dario Fiore 001; Nicola Greco; Dimitris Kolonelos; Luca Nizzardo (IACR Cryptol. ePrint Arch., 2020)

Subversion-Resilient Enhanced Privacy ID. - Antonio Faonio; Dario Fiore 001; Luca Nizzardo; Claudio Soriente (IACR Cryptol. ePrint Arch., 2020)

Boosting Verifiable Computation on Encrypted Data. - Dario Fiore 001; Anca Nitulescu; David Pointcheval (IACR Cryptol. ePrint Arch., 2020)

On the Efficiency and Flexibility of Signature Verification. - Cecilia Boschini; Dario Fiore 001; Elena Pagnin (IACR Cryptol. ePrint Arch., 2021)

Succinct Zero-Knowledge Batch Proofs for Set Accumulators. - Matteo Campanelli; Dario Fiore 001; Semin Han; Jihye Kim 001; Dimitris Kolonelos; Hyunok Oh (IACR Cryptol. ePrint Arch., 2021)

Efficient and Universally Composable Single Secret Leader Election from Pairings. - Dario Catalano; Dario Fiore 001; Emanuele Giunta (IACR Cryptol. ePrint Arch., 2021)

Controlled Functional Encryption Revisited: Multi-Authority Extensions and Efficient Schemes for Quadratic Functions. - Miguel Ambrona; Dario Fiore 001; Claudio Soriente (Proc. Priv. Enhancing Technol., 2021)

A compiler for multi-key homomorphic signatures for Turing machines. - Somayeh Dolatnezhad Samarin; Dario Fiore 001; Daniele Venturi 001; Morteza Amini (Theor. Comput. Sci., 2021)

Progressive and Efficient Verification for Digital Signatures. - Cecilia Boschini; Dario Fiore 001; Elena Pagnin (ACNS, 2022)

Extendable Threshold Ring Signatures with Enhanced Anonymity. - Gennaro Avitabile; Vincenzo Botta; Dario Fiore 001 (IACR Cryptol. ePrint Arch., 2022)

Functional Commitments for Circuits from Falsifiable Assumptions. - David Balbás; Dario Catalano; Dario Fiore 001; Russell W. F. Lai (IACR Cryptol. ePrint Arch., 2022)

Witness Encryption for Succinct Functional Commitments and Applications. - Matteo Campanelli; Dario Fiore 001; Hamidreza Khoshakhlagh (IACR Cryptol. ePrint Arch., 2022)

Adaptively Secure Single Secret Leader Election from DDH. - Dario Catalano; Dario Fiore 001; Emanuele Giunta (IACR Cryptol. ePrint Arch., 2022)

On the Impossibility of Algebraic Vector Commitments in Pairing-Free Groups. - Dario Catalano; Dario Fiore 001; Rosario Gennaro; Emanuele Giunta (IACR Cryptol. ePrint Arch., 2022)

Additive-Homomorphic Functional Commitments and Applications to Homomorphic Signatures. - Dario Catalano; Dario Fiore 001; Ida Tucker (IACR Cryptol. ePrint Arch., 2022)

Inner Product Functional Commitments with Constant-Size Public Parameters and Openings. - Hien Chu; Dario Fiore 001; Dimitris Kolonelos; Dominique Schröder (IACR Cryptol. ePrint Arch., 2022)

cq: Cached quotients for fast lookups. - Liam Eagen; Dario Fiore 001; Ariel Gabizon (IACR Cryptol. ePrint Arch., 2022)

Ring Signatures with User-Controlled Linkability. - Dario Fiore 001; Lydia Garms; Dimitris Kolonelos; Claudio Soriente; Ida Tucker (IACR Cryptol. ePrint Arch., 2022)

Efficient Zero-Knowledge Proofs on Signed Data with Applications to Verifiable Computation on Data Streams. - Dario Fiore 001; Ida Tucker (IACR Cryptol. ePrint Arch., 2022)

Chainable Functional Commitments for Unbounded-Depth Circuits. - David Balbás; Dario Catalano; Dario Fiore 001; Russell W. F. Lai (TCC (3), 2023)

Modular Sumcheck Proofs with Applications to Machine Learning and Image Processing. - David Balbás; Dario Fiore 001; María Isabel González Vasco; Damien Robissout; Claudio Soriente (IACR Cryptol. ePrint Arch., 2023)

Lookup Arguments: Improvements, Extensions and Applications to Zero-Knowledge Decision Trees. - Matteo Campanelli; Antonio Faonio; Dario Fiore 001; Tianyu Li 002; Helger Lipmaa (IACR Cryptol. ePrint Arch., 2023)

From Polynomial IOP and Commitments to Non-malleable zkSNARKs. - Antonio Faonio; Dario Fiore 001; Markulf Kohlweiss; Luigi Russo 001; Michal Zajac 001 (IACR Cryptol. ePrint Arch., 2023)

Cuckoo Commitments: Registration-Based Encryption and Key-Value Map Commitments for Large Spaces. - Dario Fiore 001; Dimitris Kolonelos; Paola de Perthuis (IACR Cryptol. ePrint Arch., 2023)

Zero-knowledge proofs for set membership: efficient, succinct, modular. - Daniel Benarroch; Matteo Campanelli; Dario Fiore 001; Kobi Gurkan; Dimitris Kolonelos (Des. Codes Cryptogr., 2023)

Fully-Succinct Multi-Key Homomorphic Signatures from Standard Assumptions. - Gaspard Anthoine; David Balbás; Dario Fiore 001 (IACR Cryptol. ePrint Arch., 2024)

Real-world Universal zkSNARKs are non-malleable. - Antonio Faonio; Dario Fiore 001; Luigi Russo 001 (IACR Cryptol. ePrint Arch., 2024)

Algebraic Zero Knowledge Contingent Payment. - Javier Gomez-Martinez; Dimitrios Vasilopoulos; Pedro Moreno-Sanchez; Dario Fiore 001 (IACR Cryptol. ePrint Arch., 2024)

Progressive and efficient verification for digital signatures: extensions and experimental results. - Cecilia Boschini; Dario Fiore 001; Elena Pagnin; Luca Torresetti; Andrea Visconti (J. Cryptogr. Eng., 2024)

Verification-efficient Homomorphic Signatures for Verifiable Computation over Data Streams. - Gaspard Anthoine; Daniele Cozzo; Dario Fiore 001 (IACR Cryptol. ePrint Arch., 2025)

Tetris! Traceable Extendable Threshold Ring Signatures and More. - Gennaro Avitabile; Vincenzo Botta; Dario Fiore 001 (IACR Cryptol. ePrint Arch., 2025)

On the Power of Polynomial Preprocessing: Proving Computations in Sublinear Time, and More. - Matteo Campanelli; Mario Carrillo; Ignacio Cascudo; Dario Fiore 001; Danilo Francati; Rosario Gennaro (IACR Cryptol. ePrint Arch., 2025)

When Can We Incrementally Prove Computations of Arbitrary Depth? - Matteo Campanelli; Dario Fiore 001; Mahak Pancholi (IACR Cryptol. ePrint Arch., 2025)

Verifiable Computation for Approximate Homomorphic Encryption Schemes. - Ignacio Cascudo; Anamaria Costache; Daniele Cozzo; Dario Fiore 001; Antonio Guimarães; Eduardo Soria-Vazquez (IACR Cryptol. ePrint Arch., 2025)

Natively Compatible Super-Efficient Lookup Arguments and How to Apply Them. - Matteo Campanelli; Dario Fiore 001; Rosario Gennaro (J. Cryptol., 2025)