Journal Papers, Conference Proceedings

Journals:

• D. Fiore, A. Mitrokotsa, L. Nizzardo, E. Pagnin.
  Multi-Key Homomorphic Authenticators
  IET Information Security, April 2019 [DOI]
• G. Barthe, E. Fagerholm, D. Fiore, J. Mitchell, A. Scedrov, B. Schmidt.
  Automated Analysis of Cryptographic Assumptions in Generic Group Models
  Journal of Cryptology, December 2018 [DOI]
• D. Catalano, D. Fiore, and L. Nizzardo
  Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions
  Design, Codes and Cryptography, December 2017 [DOI]
• D. Fiore, M. I. Gonzalez Vasco, C. Soriente
  Partitioned Group Password-Based Authenticated Key Exchange
  The Computer Journal, 2017 [DOI].
• D. Catalano and D. Fiore
  Practical Homomorphic Message Authenticators for Arithmetic Circuits
  Journal of Cryptology, vol. 31(1), pages 23-59, 2018 [DOI].
• D. Catalano, D. Fiore, R. Gennaro.
  A certificateless approach to onion routing
  International Journal of Information Security. vol. 16(3), pages 327-343, 2017 [DOI].
• G. Barthe, E. Fagerholm, D. Fiore, A. Scedrov, B. Schmidt, M. Tibouchi.
  Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds
  IET Information Security, vol. 10(6), pages 358-371, 2016 [DOI]
• D. Catalano, D. Fiore, R. Gennaro, and K. Vamvourellis
  Algebraic (Trapdoor) One-Way Functions: Constructions and Applications
  Theoretical Computer Science, vol. 592, pages 143-165, 2015 [DOI]
• M. Abdalla, D. Catalano, and D. Fiore
  Verifiable Random Functions: Relations to Identity-Based Key-Encapsulation and New Constructions
  Journal of Cryptology, vol. 27(3), pages 544-593, 2014 [DOI].
• E. Bresson, D. Catalano, M. Di Raimondo, D. Fiore, and R. Gennaro
  Off-Line/On-Line Signatures revisited: a general unifying paradigm, efficient threshold variants and experimental results
  International Journal of Information Security, vol. 12(6), pages 439-465, 2013 [DOI].
• D. Catalano, M. Di Raimondo, D. Fiore, R. Gennaro, and O. Puglisi
  Fully Non-Interactive Onion Routing with Forward-Secrecy
  International Journal of Information Security, vol. 12(1), pages 33-47. Springer 2013 [DOI].
• D. Fiore, R. Gennaro and N.P. Smart
  Relations between the security models for Certificateless Encryption and ID-Based Key Agreement
  International Journal of Information Security, vol. 11(1), pages 1-22. Springer 2012. [DOI]
• D. Catalano, M. Di Raimondo, D. Fiore and M. Messina
  Zero-Knowledge Sets with Short Proofs
  IEEE Transactions on Information Theory, vol. 57(4), pages 2488-2502.
  [DOI link] – [PDF]
• D. Fiore and R. Gennaro
  Identity-Based Key-Exchange Protocols without Pairings
  Transactions on Computational Sciences X. Special Issue on Security in Computing, Part I.
  LNCS 6340, pp. 42-77. Springer-Verlag 2010. [PDF]

Conference proceedings

2021

• A. Bois, I. Cascudo, D. Fiore, D. Kim
  Flexible and Efficient Verifiable Computation on Encrypted Data
  PKC 2021 [Full version]
• D. Benarroch, M. Campanelli, D. Fiore, K. Gurkan, D. Kolonelos
  Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular
  Financial Cryptography 2021.
  [Full version]
• M. Ambrona, D. Fiore, C. Soriente
  Controlled Functional Encryption Revisited: Multi-Authority Extensions and Efficient Schemes for Quadratic Functions
  PETS 2021. [paper]

2020

• M. Campanelli, D. Fiore, N. Greco, D. Kolonelos, L. Nizzardo
  Incrementally Aggregatable Vector Commitments and Applications to Verifiable Decentralized Storage
  ASIACRYPT 2020.
  [Full version]
• A. Faonio, D. Fiore
  Improving the Efficiency of Re-Randomizable and Replayable CCA Secure Public Key Encryption
  ACNS 2020.
• D. Fiore, A. Nitulescu, D. Pointcheval
  Boosting Verifiable Computation on Encrypted Data
  PKC 2020.
  [Full version]
• D. Catalano, M. Di Raimondo, D. Fiore, I. Giacomelli
  MonZa: Fast Maliciously Secure Two Party Computation on Z_{2^k}
  PKC 2020
  [Full version]

2019

• A. Faonio, D. Fiore, J. Herranz, C. Ràfols
  Structure-Preserving and Re-randomizable RCCA-secure Public Key Encryption and its Applications
  ASIACRYPT 2019.
  [Full version]
• M. Campanelli, D. Fiore, A. Querol
  LegoSNARK: Modular Design and Composition of Succinct Zero-Knowledge Proofs
  ACM CCS 2019.
  [Full version] [Code]

2018

• D. Fiore, E. Pagnin
  Matrioska: A Compiler for Multi-Key Homomorphic Signatures
  SCN 2018.
  [Full version]
• M. Abdalla, D. Catalano, D. Fiore, R. Gay, B. Ursu.
  Multi-Input Functional Encryption for Inner Products: Function-Hiding Realizations and Constructions without Pairings
  CRYPTO 2018.
  [Full version]
• D. Catalano, D.Fiore, L. Nizzardo
  On the Security Notions for Homomorphic Signatures
  ACNS 2018.
  [Full version]

2017

• M. Barbosa, D. Catalano, D.Fiore.
  Labeled Homomorphic Encryption: Scalable and Privacy-Preserving Processing of Outsourced Data
  ESORICS 2017.
  [Full version] [labHE Implementation]
• C. E. Z. Baltico, D. Catalano, D. Fiore, R. Gay.
  Practical Functional Encryption for Quadratic Functions with Applications to Predicate Encryption
  CRYPTO 2017.
  [Full version]
• Y. Dodis, D. Fiore.
  Unilaterally-Authenticated Key Exchange
  Financial Cryptography and Data Security 2017.

2016

• D. Fiore, A. Mitrokotsa, L. Nizzardo, E. Pagnin.
  Multi-Key Homomorphic Authenticators
  ASIACRYPT 2016.
  [Full version]
• D. Fiore and A. Nitulescu
  On the (In)security of SNARKs in the Presence of Oracles
  TCC 2016-B.
  [Full version]
• D. Fiore, C. Fournet, E. Gosh, M. Kohlweiss, O. Ohrimenko, B. Parno.
  Hash First, Argue Later. Adaptive Verifiable Computations on Outsourced Data
  ACM CCS 2016.
• J. Krupp, D. Schroeder, M. Simkin, D. Fiore, G. Ateniese, S. Nuernberger.
  Nearly Optimal Verifiable Data Streaming
  PKC 2016.
  [Full version]

2015

• D. Catalano and D. Fiore
  Using Linearly-Homomorphic Encryption to Evaluate Degree-2 Functions on Encrypted Data
  ACM CCS 2015.
  [Preliminary full version]
• D. Catalano, D. Fiore, L. Nizzardo
  Programmable Hash Functions go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys
  CRYPTO 2015.
  [Full version]
• M. Backes, M. Barbosa, D. Fiore, and R. M. Reischuk
  ADSNARK: Nearly Practical and Privacy-Preserving Proofs on Authenticated Data
  36th IEEE Symposium on Security and Privacy (Oakland) 2015.
  [Full version] [ADSNARK implementation as a libsnark extension]
• G. Barthe, E. Fagerholm, D. Fiore, A. Scedrov, B. Schmidt, M. Tibouchi.
  Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds
  PKC 2015.
  [Full version]

2014

• D. Fiore, R. Gennaro, and V. Pastro
  Efficiently Verifiable Computation on Encrypted Data
  ACM CCS 2014.
  [Full Version] [Related implementation: HAL]
• Y. Dodis, and D. Fiore
  Interactive Encryption and Message Authentication
  SCN 2014
  [Full version – ePrint]
• G. Barthe, E. Fagerholm, D. Fiore, J. Mitchell, A. Scedrov, B. Schmidt.
  Automated Analysis of Cryptographic Assumptions in Generic Group Models
  CRYPTO 2014.
  [IACR version] [Our GenericGroupAnalyzer tool]
• D. Catalano, D. Fiore, and B. Warinschi
  Homomorphic Signatures with Efficient Verification for Polynomial Functions
  CRYPTO 2014.
  [IACR version]
• D. Catalano, D. Fiore, R. Gennaro, and L. Nizzardo
  Generalizing Homomorphic MACs for Arithmetic Circuits
  PKC 2014.
  [Full version]

2013

• M. Backes, D. Fiore and R. M. Reischuk
  Verifiable Delegation of Computation on Outsourced Data
  ACM CCS 2013.
  [Full version – ePrint] [Implementation (subsumed) in HAL]
• M. Backes, D. Fiore and E. Mohammadi
  Privacy Preserving Accountable Computation
  ESORICS 2013.
• D. Catalano and D. Fiore
  Practical Homomorphic MACs for Arithmetic Circuits
  Eurocrypt 2013.
  [Full version] [Implementation in HAL]
• D. Catalano, D. Fiore, R. Gennaro and K. Vamvourellis
  Algebraic (Trapdoor) One-Way Functions and their Applications
  In the Proceedings of the 10th Theory of Cryptography Conference – TCC 2013, Tokyo, Japan. March 3-6, 2013 – LNCS 7785, pp. 680-699.
  [Full version – ePrint] [Journal version]
• D. Catalano and D. Fiore
  Vector Commitments and their Applications
  In the Proceedings of the 16th IACR International Conference on Practice and Theory of Public-Key Cryptography – PKC 2013, Nara, Japan. February 26 – March 1, 2013 – LNCS 7778, pp. 55-72.
  [Full version – ePrint]

2012

• D. Fiore and R. Gennaro
  Publicly Verifiable Delegation of Large Polynomials and Matrix Computations, with Applications
  In the proceedings of the 19th ACM Conference on Computer and Communications Security – ACM CCS 2012, Raleigh, NC, USA. October 16-18, 2012. pp. 501-512
  [Full version – ePrint]
• D. Catalano, D. Fiore and B. Warinschi
  Efficient Network Coding Signatures in the Standard Model
  In the Proceedings of the 15th IACR International Conference on Practice and Theory of Public-Key Cryptography – PKC 2012, Darmstadt, Germany. May 21-23, 2012 – LNCS 7293, pp. 680-696.
  [Full version – ePrint]
• M. Abdalla, D. Fiore and V. Lyubashevsky
  From Selective to Full Security: Semi-Generic Transformations in the Standard Model
  In the Proceedings of the 15th IACR International Conference on Practice and Theory of Public-Key Cryptography – PKC 2012, Darmstadt, Germany. May 21-23, 2012 – LNCS 7293, pp. 316-333.
  [Full version – ePrint]
• D. Fiore and D. Schroeder
  Uniqueness is a Different Story: Impossibility of Verifiable Random Functions from Trapdoor Permutations
  In the Proceedings of the 9th Theory of Cryptography Conference – TCC 2012, Taormina, Italy. March 19-21, 2012 – LNCS 7194, pp. 636-653.
  [Preliminary full version – ePrint]

2011

• D. Catalano, M. Di Raimondo, D. Fiore, R. Gennaro, and O. Puglisi
  Fully Non-Interactive Onion Routing with Forward-Secrecy
  In the Proceedings of the 9th International Conference on Applied Cryptography and Network Security – ACNS 2011, Nerja, Spain. June 2011 – LNCS 6715, pp.255-273.
  [Proceedings version]
  Invited to a Special Issue of International Journal of Information Security. 
• D. Catalano, D. Fiore and B. Warinschi
  Adaptive Pseudo-Free Groups and Applications
  In proceedings of the 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tallin (Estonia), May 2011 – EUROCRYPT 2011 – LNCS 6632, pp. 207-223.
  [Proceedings version] – [Full version – ePrint]

2010

• D. Fiore, R. Gennaro and N.P. Smart
  Constructing Certificateless Encryption and ID-Based Encryption from ID-Based Key Agreement
  In proceedings of the 4th International Conference on Pairing-Based Cryptography – Pairing 2010, Yamanaka Hot Spring, Japan, December 13-15, 2010 – LNCS 6487, pp. 167-186.
  [Proceedings version] – [Full version – ePrint]
• M. Barni, T. Bianchi, D. Catalano, M. Di Raimondo, R. Dionida Labati, P. Failla, D. Fiore, R. Lazzeretti, V. Piuri, and F. Scotti
  A Privacy-Compliant Fingerprint Recognition System Based on Homomorphic Encryption and Fingercode Templates
  In proceedings of the 4th IEEE International Conference on Biometrics: Theory, Applications and Systems (BTAS 2010), September 27-29, 2010, Washington, D.C., USA. IEEE Press.
  [Proceedings version]
• M. Barni, T. Bianchi, D. Catalano, M. Di Raimondo, R. Dionida Labati, P. Failla, D. Fiore, R. Lazzeretti, V. Piuri, and F. Scotti
  Privacy-Preserving Fingercode Authentication
  In proceedings of the 12th ACM Workshop on Multimedia and Security (ACM MM&Sec 2010), pp. 231-241.
  [Proceedings version]
• D. Fiore and R. Gennaro
  Making the Diffie-Hellman Protocol Identity-Based
  In proceedings of The Cryptographers’ Track at the RSA Conference 2010, San Francisco, CA (USA)  – CT-RSA 2010, LNCS 5985, pp. 165-178.
  [Proceedings version] – [Full version – ePrint]

2009

• D. Catalano, D. Fiore and R. Gennaro
  Certificateless Onion Routing
  In proceedings of the 16th ACM Conference on Computer and Communications Security, Chicago, IL (USA) – ACM CCS 2009 – ACM, ISBN 978-1-60558-894-0, Order no. 537091, pp. 151-160.
  [Proceedings version]
• M. Abdalla, D. Catalano and D. Fiore
  Verifiable Random Functions from Identity-based Key Encapsulation
  In proceedings of the 28th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cologne (Germany), April 2009 – EUROCRYPT 2009 – LNCS 5479, pp. 554-571.
  [Proceedings version] – [Full version]

2008

• D. Catalano, D. Fiore and M. Messina
  Zero-Knowledge Sets with short proofs
  In proceedings of the 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Istanbul (Turkey), April 2008 – EUROCRYPT 2008 – LNCS 4965, pp. 433-450.
  [Proceedings version] – [Full version: refer to the Journal paper]
  
• D. Catalano, M. Di Raimondo, D. Fiore and R. Gennaro
  Off-Line/On-Line Signatures: Theoretical aspects and Experimental Results
  In Proceedings of the 11th International Workshop on Practice and Theory in Public Key Cryptography, Barcelona, Spain, March 2008 (PKC 2008) – LNCS 4939, pp. 101-120.
  [Proceedings version] – [Full version]
  

PhD thesis:

• Dario Fiore
  Efficient Cryptographic Constructions from Bilinear Maps
  PhD Thesis. Department of Mathematics and Computer Science, University of Catania. Submitted on December 2009 and defended on March 2010.