default search action
Dario Fiore 0001
Person information
- affiliation: IMDEA Software Institute, Madrid, Spain
- affiliation (former): Max Planck Institute for Software Systems, Saarbrücken, Germany
- affiliation: New York University, Department of Computer Science, NY, USA
- affiliation: École Normale Supérieure, Paris, France
- affiliation (PhD 2010): University of Catania, Italy
Other persons with the same name
- Dario Fiore 0002 — FHS St. Gallen, St. Gallen, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j19]Cecilia Boschini
, Dario Fiore
Progressive and efficient verification for digital signatures: extensions and experimental results. J. Cryptogr. Eng. 14(3): 551-575 (2024) - [c66]Antonio Faonio, Dario Fiore, Luigi Russo:
Real-World Universal zkSNARKs are Non-Malleable. CCS 2024: 3138-3151 - [c65]Gaspard Anthoine
Fully-Succinct Multi-key Homomorphic Signatures from Standard Assumptions. CRYPTO (3) 2024: 317-351 - [c64]Matteo Campanelli
Witness Encryption for Succinct Functional Commitments and Applications. Public Key Cryptography (2) 2024: 132-167 - [c63]Matteo Campanelli
Lookup Arguments: Improvements, Extensions and Applications to Zero-Knowledge Decision Trees. Public Key Cryptography (2) 2024: 337-369 - [i63]Antonio Faonio, Dario Fiore, Luigi Russo:
Real-world Universal zkSNARKs are non-malleable. IACR Cryptol. ePrint Arch. 2024: 721 (2024) - [i62]Gaspard Anthoine, David Balbás, Dario Fiore:
Fully-Succinct Multi-Key Homomorphic Signatures from Standard Assumptions. IACR Cryptol. ePrint Arch. 2024: 895 (2024) - [i61]Matteo Campanelli, Dario Fiore, Rosario Gennaro:
Natively Compatible Super-Efficient Lookup Arguments and How to Apply Them. IACR Cryptol. ePrint Arch. 2024: 1058 (2024) - [i60]Javier Gomez-Martinez, Dimitrios Vasilopoulos, Pedro Moreno-Sanchez, Dario Fiore:
Algebraic Zero Knowledge Contingent Payment. IACR Cryptol. ePrint Arch. 2024: 1930 (2024) - 2023
- [j18]Daniel Benarroch, Matteo Campanelli
Zero-knowledge proofs for set membership: efficient, succinct, modular. Des. Codes Cryptogr. 91(11): 3457-3525 (2023) - [c62]Dario Fiore
Cuckoo Commitments: Registration-Based Encryption and Key-Value Map Commitments for Large Spaces. ASIACRYPT (5) 2023: 166-200 - [c61]David Balbás
Modular Sumcheck Proofs with Applications to Machine Learning and Image Processing. CCS 2023: 1437-1451 - [c60]Gennaro Avitabile
Extendable Threshold Ring Signatures with Enhanced Anonymity. Public Key Cryptography (1) 2023: 281-311 - [c59]Dario Catalano, Dario Fiore, Emanuele Giunta:
Efficient and Universally Composable Single Secret Leader Election from Pairings. Public Key Cryptography (1) 2023: 471-499 - [c58]David Balbás
Chainable Functional Commitments for Unbounded-Depth Circuits. TCC (3) 2023: 363-393 - [c57]Antonio Faonio
From Polynomial IOP and Commitments to Non-malleable zkSNARKs. TCC (3) 2023: 455-485 - [i59]Antonio Faonio, Dario Fiore, Markulf Kohlweiss, Luigi Russo, Michal Zajac:
From Polynomial IOP and Commitments to Non-malleable zkSNARKs. IACR Cryptol. ePrint Arch. 2023: 569 (2023) - [i58]David Balbás, Dario Fiore, María Isabel González Vasco, Damien Robissout, Claudio Soriente:
Modular Sumcheck Proofs with Applications to Machine Learning and Image Processing. IACR Cryptol. ePrint Arch. 2023: 1342 (2023) - [i57]Dario Fiore, Dimitris Kolonelos, Paola de Perthuis:
Cuckoo Commitments: Registration-Based Encryption and Key-Value Map Commitments for Large Spaces. IACR Cryptol. ePrint Arch. 2023: 1389 (2023) - [i56]Matteo Campanelli, Antonio Faonio, Dario Fiore, Tianyu Li, Helger Lipmaa:
Lookup Arguments: Improvements, Extensions and Applications to Zero-Knowledge Decision Trees. IACR Cryptol. ePrint Arch. 2023: 1518 (2023) - 2022
- [c56]Cecilia Boschini
Progressive and Efficient Verification for Digital Signatures. ACNS 2022: 440-458 - [c55]Dario Catalano
Additive-Homomorphic Functional Commitments and Applications to Homomorphic Signatures. ASIACRYPT (4) 2022: 159-188 - [c54]Matteo Campanelli
Succinct Zero-Knowledge Batch Proofs for Set Accumulators. CCS 2022: 455-469 - [c53]Dario Fiore, Ida Tucker:
Efficient Zero-Knowledge Proofs on Signed Data with Applications to Verifiable Computation on Data Streams. CCS 2022: 1067-1080 - [c52]Antonio Faonio
Subversion-Resilient Enhanced Privacy ID. CT-RSA 2022: 562-588 - [c51]Dario Fiore, Lydia Garms, Dimitris Kolonelos, Claudio Soriente, Ida Tucker:
Ring Signatures with User-Controlled Linkability. ESORICS (2) 2022: 405-426 - [c50]Dario Catalano, Dario Fiore, Emanuele Giunta
Adaptively Secure Single Secret Leader Election from DDH. PODC 2022: 430-439 - [c49]Hien Chu
Inner Product Functional Commitments with Constant-Size Public Parameters and Openings. SCN 2022: 639-662 - [c48]Dario Catalano
On the Impossibility of Algebraic Vector Commitments in Pairing-Free Groups. TCC (2) 2022: 274-299 - [i55]Hien Chu, Dario Fiore, Dimitris Kolonelos, Dominique Schröder:
Inner Product Functional Commitments with Constant-Size Public Parameters and Openings. IACR Cryptol. ePrint Arch. 2022: 524 (2022) - [i54]Dario Catalano, Dario Fiore, Emanuele Giunta:
Adaptively Secure Single Secret Leader Election from DDH. IACR Cryptol. ePrint Arch. 2022: 687 (2022) - [i53]Dario Catalano, Dario Fiore, Rosario Gennaro, Emanuele Giunta:
On the Impossibility of Algebraic Vector Commitments in Pairing-Free Groups. IACR Cryptol. ePrint Arch. 2022: 696 (2022) - [i52]Dario Catalano, Dario Fiore, Ida Tucker:
Additive-Homomorphic Functional Commitments and Applications to Homomorphic Signatures. IACR Cryptol. ePrint Arch. 2022: 1331 (2022) - [i51]David Balbás, Dario Catalano, Dario Fiore, Russell W. F. Lai:
Functional Commitments for Circuits from Falsifiable Assumptions. IACR Cryptol. ePrint Arch. 2022: 1365 (2022) - [i50]Dario Fiore, Ida Tucker:
Efficient Zero-Knowledge Proofs on Signed Data with Applications to Verifiable Computation on Data Streams. IACR Cryptol. ePrint Arch. 2022: 1393 (2022) - [i49]Matteo Campanelli, Dario Fiore, Hamidreza Khoshakhlagh:
Witness Encryption for Succinct Functional Commitments and Applications. IACR Cryptol. ePrint Arch. 2022: 1510 (2022) - [i48]Gennaro Avitabile, Vincenzo Botta, Dario Fiore:
Extendable Threshold Ring Signatures with Enhanced Anonymity. IACR Cryptol. ePrint Arch. 2022: 1568 (2022) - [i47]Dario Fiore, Lydia Garms, Dimitris Kolonelos, Claudio Soriente, Ida Tucker:
Ring Signatures with User-Controlled Linkability. IACR Cryptol. ePrint Arch. 2022: 1743 (2022) - [i46]Liam Eagen, Dario Fiore, Ariel Gabizon:
cq: Cached quotients for fast lookups. IACR Cryptol. ePrint Arch. 2022: 1763 (2022) - 2021
- [j17]Miguel Ambrona
Controlled Functional Encryption Revisited: Multi-Authority Extensions and Efficient Schemes for Quadratic Functions. Proc. Priv. Enhancing Technol. 2021(1): 21-42 (2021) - [j16]Somayeh Dolatnezhad Samarin, Dario Fiore, Daniele Venturi, Morteza Amini
A compiler for multi-key homomorphic signatures for Turing machines. Theor. Comput. Sci. 889: 145-170 (2021) - [c47]Matteo Campanelli
Lunar: A Toolbox for More Efficient Universal and Updatable zkSNARKs and Commit-and-Prove Extensions. ASIACRYPT (3) 2021: 3-33 - [c46]Daniel Benarroch, Matteo Campanelli
Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular. Financial Cryptography (1) 2021: 393-414 - [c45]Alexandre Bois, Ignacio Cascudo
Flexible and Efficient Verifiable Computation on Encrypted Data. Public Key Cryptography (2) 2021: 528-558 - [i45]Dario Catalano, Dario Fiore, Emanuele Giunta:
Efficient and Universally Composable Single Secret Leader Election from Pairings. IACR Cryptol. ePrint Arch. 2021: 344 (2021) - [i44]Cecilia Boschini, Dario Fiore, Elena Pagnin:
On the Efficiency and Flexibility of Signature Verification. IACR Cryptol. ePrint Arch. 2021: 832 (2021) - [i43]Somayeh Dolatnezhad Samarin, Dario Fiore, Daniele Venturi, Morteza Amini:
A compiler for multi-key homomorphic signatures for Turing machines. IACR Cryptol. ePrint Arch. 2021: 1651 (2021) - [i42]Matteo Campanelli, Dario Fiore, Semin Han, Jihye Kim, Dimitris Kolonelos, Hyunok Oh:
Succinct Zero-Knowledge Batch Proofs for Set Accumulators. IACR Cryptol. ePrint Arch. 2021: 1672 (2021) - 2020
- [j15]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, Srdjan Capkun, David A. Basin, Jan Beutel, Dennis Jackson, Marc Roeschlin, Patrick Leu, Bart Preneel, Nigel P. Smart, Aysajan Abidin, Seda Gurses, Michael Veale, Cas Cremers, Michael Backes, Nils Ole Tippenhauer, Reuben Binns, Ciro Cattuto, Alain Barrat, Dario Fiore, Manuel Barbosa, Rui Oliveira, José Pereira:
Decentralized Privacy-Preserving Proximity Tracing. IEEE Data Eng. Bull. 43(2): 36-66 (2020) - [c44]Antonio Faonio
Improving the Efficiency of Re-randomizable and Replayable CCA Secure Public Key Encryption. ACNS (1) 2020: 271-291 - [c43]Matteo Campanelli
Incrementally Aggregatable Vector Commitments and Applications to Verifiable Decentralized Storage. ASIACRYPT (2) 2020: 3-35 - [c42]Dario Fiore, Anca Nitulescu, David Pointcheval:
Boosting Verifiable Computation on Encrypted Data. Public Key Cryptography (2) 2020: 124-154 - [c41]Dario Catalano, Mario Di Raimondo, Dario Fiore, Irene Giacomelli:
Mon$\mathbb {Z}_{2^{k}}$a: Fast Maliciously Secure Two Party Computation on $\mathbb {Z}_{2^{k}}$. Public Key Cryptography (2) 2020: 357-386 - [i41]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, Kenneth G. Paterson, Srdjan Capkun, David A. Basin, Jan Beutel, Dennis Jackson, Marc Roeschlin, Patrick Leu, Bart Preneel, Nigel P. Smart, Aysajan Abidin, Seda F. Gürses, Michael Veale, Cas Cremers, Michael Backes, Nils Ole Tippenhauer, Reuben Binns, Ciro Cattuto, Alain Barrat, Dario Fiore, Manuel Barbosa, Rui Oliveira, José Pereira:
Decentralized Privacy-Preserving Proximity Tracing. CoRR abs/2005.12273 (2020) - [i40]Dario Fiore, Anca Nitulescu, David Pointcheval:
Boosting Verifiable Computation on Encrypted Data. IACR Cryptol. ePrint Arch. 2020: 132 (2020) - [i39]Matteo Campanelli, Dario Fiore, Nicola Greco, Dimitris Kolonelos, Luca Nizzardo:
Vector Commitment Techniques and Applications to Verifiable Decentralized Storage. IACR Cryptol. ePrint Arch. 2020: 149 (2020) - [i38]Matteo Campanelli, Antonio Faonio
Lunar: a Toolbox for More Efficient Universal and Updatable zkSNARKs and Commit-and-Prove Extensions. IACR Cryptol. ePrint Arch. 2020: 1069 (2020) - [i37]Antonio Faonio, Dario Fiore, Luca Nizzardo, Claudio Soriente:
Subversion-Resilient Enhanced Privacy ID. IACR Cryptol. ePrint Arch. 2020: 1450 (2020) - [i36]Alexandre Bois, Ignacio Cascudo, Dario Fiore, Dongwoo Kim:
Flexible and Efficient Verifiable Computation on Encrypted Data. IACR Cryptol. ePrint Arch. 2020: 1526 (2020)
2010 – 2019
- 2019
- [j14]Dario Fiore, Aikaterini Mitrokotsa
Multi-key homomorphic authenticators. IET Inf. Secur. 13(6): 618-638 (2019) - [j13]Gilles Barthe, Edvard Fagerholm, Dario Fiore, John C. Mitchell
Automated Analysis of Cryptographic Assumptions in Generic Group Models. J. Cryptol. 32(2): 324-360 (2019) - [c40]Antonio Faonio
Structure-Preserving and Re-randomizable RCCA-Secure Public Key Encryption and Its Applications. ASIACRYPT (3) 2019: 159-190 - [c39]Matteo Campanelli
LegoSNARK: Modular Design and Composition of Succinct Zero-Knowledge Proofs. CCS 2019: 2075-2092 - [i35]Matteo Campanelli, Dario Fiore, Anaïs Querol:
LegoSNARK: Modular Design and Composition of Succinct Zero-Knowledge Proofs. IACR Cryptol. ePrint Arch. 2019: 142 (2019) - [i34]Dario Catalano, Mario Di Raimondo, Dario Fiore, Irene Giacomelli:
Monℤ2ka: Fast Maliciously Secure Two Party Computation on ℤ2k. IACR Cryptol. ePrint Arch. 2019: 211 (2019) - [i33]Antonio Faonio
Structure-Preserving and Re-randomizable RCCA-secure Public Key Encryption and its Applications. IACR Cryptol. ePrint Arch. 2019: 955 (2019) - [i32]Daniel Benarroch, Matteo Campanelli, Dario Fiore, Dimitris Kolonelos:
Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular. IACR Cryptol. ePrint Arch. 2019: 1255 (2019) - 2018
- [j12]Dario Catalano, Dario Fiore, Luca Nizzardo
Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions. Des. Codes Cryptogr. 86(10): 2197-2246 (2018) - [j11]Dario Catalano, Dario Fiore:
Practical Homomorphic Message Authenticators for Arithmetic Circuits. J. Cryptol. 31(1): 23-59 (2018) - [c38]Dario Catalano, Dario Fiore, Luca Nizzardo:
On the Security Notions for Homomorphic Signatures. ACNS 2018: 183-201 - [c37]Michel Abdalla
Multi-Input Functional Encryption for Inner Products: Function-Hiding Realizations and Constructions Without Pairings. CRYPTO (1) 2018: 597-627 - [c36]Dario Fiore, Elena Pagnin
Matrioska: A Compiler for Multi-key Homomorphic Signatures. SCN 2018: 43-62 - [i31]Dario Fiore, Elena Pagnin:
Matrioska: A Compiler for Multi-Key Homomorphic Signatures. IACR Cryptol. ePrint Arch. 2018: 616 (2018) - 2017
- [j10]Dario Fiore, María Isabel González Vasco
Partitioned Group Password-Based Authenticated Key Exchange. Comput. J. 60(12): 1912-1922 (2017) - [j9]Dario Catalano, Dario Fiore, Rosario Gennaro:
A certificateless approach to onion routing. Int. J. Inf. Sec. 16(3): 327-343 (2017) - [c35]Carmen Elisabetta Zaira Baltico, Dario Catalano, Dario Fiore, Romain Gay
Practical Functional Encryption for Quadratic Functions with Applications to Predicate Encryption. CRYPTO (1) 2017: 67-98 - [c34]Manuel Barbosa
Labeled Homomorphic Encryption - Scalable and Privacy-Preserving Processing of Outsourced Data. ESORICS (1) 2017: 146-166 - [c33]Yevgeniy Dodis, Dario Fiore:
Unilaterally-Authenticated Key Exchange. Financial Cryptography 2017: 542-560 - [i30]Yevgeniy Dodis, Dario Fiore:
Unilaterally-Authenticated Key Exchange. IACR Cryptol. ePrint Arch. 2017: 109 (2017) - [i29]Dario Fiore, María Isabel González Vasco, Claudio Soriente:
Partitioned Group Password-Based Authenticated Key Exchange. IACR Cryptol. ePrint Arch. 2017: 141 (2017) - [i28]Carmen Elisabetta Zaira Baltico, Dario Catalano, Dario Fiore, Romain Gay:
Practical Functional Encryption for Quadratic Functions with Applications to Predicate Encryption. IACR Cryptol. ePrint Arch. 2017: 151 (2017) - [i27]Manuel Barbosa, Dario Catalano, Dario Fiore:
Labeled Homomorphic Encryption: Scalable and Privacy-Preserving Processing of Outsourced Data. IACR Cryptol. ePrint Arch. 2017: 326 (2017) - [i26]Michel Abdalla, Dario Catalano, Dario Fiore, Romain Gay, Bogdan Ursu:
Multi-Input Functional Encryption for Inner Products: Function-Hiding Realizations and Constructions without Pairings. IACR Cryptol. ePrint Arch. 2017: 972 (2017) - 2016
- [j8]Gilles Barthe
Strongly-optimal structure preserving signatures from Type II pairings: synthesis and lower bounds. IET Inf. Secur. 10(6): 358-371 (2016) - [c32]Dario Fiore, Aikaterini Mitrokotsa
Multi-key Homomorphic Authenticators. ASIACRYPT (2) 2016: 499-530 - [c31]Dario Fiore, Cédric Fournet, Esha Ghosh, Markulf Kohlweiss
Hash First, Argue Later: Adaptive Verifiable Computations on Outsourced Data. CCS 2016: 1304-1316 - [c30]Johannes Krupp, Dominique Schröder
Nearly Optimal Verifiable Data Streaming. Public Key Cryptography (1) 2016: 417-445 - [c29]Dario Fiore, Anca Nitulescu:
On the (In)Security of SNARKs in the Presence of Oracles. TCC (B1) 2016: 108-138 - [i25]Dario Fiore, Anca Nitulescu:
On the (In)security of SNARKs in the Presence of Oracles. IACR Cryptol. ePrint Arch. 2016: 112 (2016) - [i24]Dario Fiore, Aikaterini Mitrokotsa, Luca Nizzardo, Elena Pagnin:
Multi-Key Homomorphic Authenticators. IACR Cryptol. ePrint Arch. 2016: 804 (2016) - [i23]Dario Fiore, Cédric Fournet, Esha Ghosh, Markulf Kohlweiss, Olga Ohrimenko, Bryan Parno:
Hash First, Argue Later: Adaptive Verifiable Computations on Outsourced Data. IACR Cryptol. ePrint Arch. 2016: 985 (2016) - [i22]Carmen Elisabetta Zaira Baltico, Dario Catalano, Dario Fiore:
Practical Functional Encryption for Bilinear Forms. IACR Cryptol. ePrint Arch. 2016: 1104 (2016) - [i21]Dario Catalano, Dario Fiore, Luca Nizzardo:
On the Security Notions for Homomorphic Signatures. IACR Cryptol. ePrint Arch. 2016: 1175 (2016) - 2015
- [j7]Dario Catalano, Dario Fiore, Rosario Gennaro, Konstantinos Vamvourellis:
Algebraic (trapdoor) one-way functions: Constructions and applications. Theor. Comput. Sci. 592: 143-165 (2015) - [c28]Dario Catalano, Dario Fiore:
Using Linearly-Homomorphic Encryption to Evaluate Degree-2 Functions on Encrypted Data. CCS 2015: 1518-1529 - [c27]Dario Catalano, Dario Fiore, Luca Nizzardo:
Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys. CRYPTO (2) 2015: 254-274 - [c26]Gilles Barthe, Edvard Fagerholm, Dario Fiore, Andre Scedrov
Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds. Public Key Cryptography 2015: 355-376 - [c25]Michael Backes, Manuel Barbosa
ADSNARK: Nearly Practical and Privacy-Preserving Proofs on Authenticated Data. IEEE Symposium on Security and Privacy 2015: 271-286 - [i20]Gilles Barthe, Edvard Fagerholm, Dario Fiore, Andre Scedrov, Benedikt Schmidt, Mehdi Tibouchi:
Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds. IACR Cryptol. ePrint Arch. 2015: 19 (2015) - [i19]Dario Catalano, Dario Fiore:
Practical Homomorphic MACs for Arithmetic Circuits. IACR Cryptol. ePrint Arch. 2015: 194 (2015) - [i18]Johannes Krupp
Nearly Optimal Verifiable Data Streaming (Full Version). IACR Cryptol. ePrint Arch. 2015: 333 (2015) - [i17]Dario Catalano, Dario Fiore, Rosario Gennaro, Luca Nizzardo:
Generalizing Homomorphic MACs for Arithmetic Circuits. IACR Cryptol. ePrint Arch. 2015: 396 (2015) - [i16]Dario Catalano, Dario Fiore, Luca Nizzardo:
Programmable Hash Functions go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys. IACR Cryptol. ePrint Arch. 2015: 826 (2015) - 2014
- [j6]Michel Abdalla
Verifiable Random Functions: Relations to Identity-Based Key Encapsulation and New Constructions. J. Cryptol. 27(3): 544-593 (2014) - [c24]Dario Fiore, Rosario Gennaro, Valerio Pastro:
Efficiently Verifiable Computation on Encrypted Data. CCS 2014: 844-855 - [c23]Gilles Barthe, Edvard Fagerholm, Dario Fiore, John C. Mitchell, Andre Scedrov
Automated Analysis of Cryptographic Assumptions in Generic Group Models. CRYPTO (1) 2014: 95-112 - [c22]Dario Catalano, Dario Fiore, Bogdan Warinschi:
Homomorphic Signatures with Efficient Verification for Polynomial Functions. CRYPTO (1) 2014: 371-389 - [c21]Dario Catalano, Dario Fiore, Rosario Gennaro, Luca Nizzardo:
Generalizing Homomorphic MACs for Arithmetic Circuits. Public Key Cryptography 2014: 538-555 - [c20]Yevgeniy Dodis, Dario Fiore:
Interactive Encryption and Message Authentication. SCN 2014: 494-513 - [i15]Gilles Barthe, Edvard Fagerholm, Dario Fiore, John C. Mitchell, Andre Scedrov, Benedikt Schmidt:
Automated Analysis of Cryptographic Assumptions in Generic Group Models. IACR Cryptol. ePrint Arch. 2014: 458 (2014) - [i14]Dario Catalano, Dario Fiore, Bogdan Warinschi:
Homomorphic Signatures with Efficient Verification for Polynomial Functions. IACR Cryptol. ePrint Arch. 2014: 469 (2014) - [i13]Michael Backes, Dario Fiore, Raphael M. Reischuk:
Nearly Practical and Privacy-Preserving Proofs on Authenticated Data. IACR Cryptol. ePrint Arch. 2014: 617 (2014) - [i12]Dario Catalano, Dario Fiore:
Boosting Linearly-Homomorphic Encryption to Evaluate Degree-2 Functions on Encrypted Data. IACR Cryptol. ePrint Arch. 2014: 813 (2014) - 2013
- [j5]Dario Catalano, Mario Di Raimondo, Dario Fiore, Rosario Gennaro, Orazio Puglisi:
Fully non-interactive onion routing with forward secrecy. Int. J. Inf. Sec. 12(1): 33-47 (2013) - [j4]Emmanuel Bresson, Dario Catalano, Mario Di Raimondo, Dario Fiore, Rosario Gennaro:
Off-line/on-line signatures revisited: a general unifying paradigm, efficient threshold variants and experimental results. Int. J. Inf. Sec. 12(6): 439-465 (2013) - [c19]Michael Backes, Dario Fiore, Raphael M. Reischuk:
Verifiable delegation of computation on outsourced data. CCS 2013: 863-874 - [c18]Michael Backes, Dario Fiore, Esfandiar Mohammadi:
Privacy-Preserving Accountable Computation. ESORICS 2013: 38-56 - [c17]Dario Catalano, Dario Fiore:
Practical Homomorphic MACs for Arithmetic Circuits. EUROCRYPT 2013: 336-352 - [c16]Dario Catalano, Dario Fiore:
Vector Commitments and Their Applications. Public Key Cryptography 2013: 55-72 - [c15]Dario Catalano, Dario Fiore, Rosario Gennaro, Konstantinos Vamvourellis:
Algebraic (Trapdoor) One-Way Functions and Their Applications. TCC 2013: 680-699 - [i11]Michael Backes, Dario Fiore, Raphael M. Reischuk:
Verifiable Delegation of Computation on Outsourced Data. IACR Cryptol. ePrint Arch. 2013: 469 (2013) - [i10]Yevgeniy Dodis, Dario Fiore:
Interactive Encryption, Message Authentication, and Anonymous Key Exchange. IACR Cryptol. ePrint Arch. 2013: 817 (2013) - 2012
- [j3]Dario Fiore, Rosario Gennaro, Nigel P. Smart:
Relations between the security models for certificateless encryption and ID-based key agreement. Int. J. Inf. Sec. 11(1): 1-22 (2012) - [c14]Dario Fiore, Rosario Gennaro:
Publicly verifiable delegation of large polynomials and matrix computations, with applications. CCS 2012: 501-512 - [c13]Michel Abdalla
From Selective to Full Security: Semi-generic Transformations in the Standard Model. Public Key Cryptography 2012: 316-333 - [c12]Dario Catalano, Dario Fiore, Bogdan Warinschi:
Efficient Network Coding Signatures in the Standard Model. Public Key Cryptography 2012: 680-696 - [c11]Dario Fiore, Dominique Schröder
Uniqueness Is a Different Story: Impossibility of Verifiable Random Functions from Trapdoor Permutations. TCC 2012: 636-653 - [i9]Dario Fiore, Rosario Gennaro:
Publicly Verifiable Delegation of Large Polynomials and Matrix Computations, with Applications. IACR Cryptol. ePrint Arch. 2012: 281 (2012) - [i8]Michel Abdalla, Dario Fiore, Vadim Lyubashevsky:
From Selective to Full Security: Semi-Generic Transformations in the Standard Model. IACR Cryptol. ePrint Arch. 2012: 341 (2012) - [i7]Dario Fiore, Rosario Gennaro:
Improved Publicly Verifiable Delegation of Large Polynomials and Matrix Computations. IACR Cryptol. ePrint Arch. 2012: 434 (2012) - 2011
- [j2]Dario Catalano, Mario Di Raimondo, Dario Fiore, Mariagrazia Messina:
Zero-Knowledge Sets With Short Proofs. IEEE Trans. Inf. Theory 57(4): 2488-2502 (2011) - [c10]Dario Catalano, Mario Di Raimondo, Dario Fiore, Rosario Gennaro, Orazio Puglisi:
Fully Non-interactive Onion Routing with Forward-Secrecy. ACNS 2011: 255-273 - [c9]Dario Catalano, Dario Fiore, Bogdan Warinschi:
Adaptive Pseudo-free Groups and Applications. EUROCRYPT 2011: 207-223 - [i6]Dario Catalano, Dario Fiore, Bogdan Warinschi:
Adaptive Pseudo-Free Groups and Applications. IACR Cryptol. ePrint Arch. 2011: 53 (2011) - [i5]Dario Catalano, Dario Fiore:
Concise Vector Commitments and their Applications to Zero-Knowledge Elementary Databases. IACR Cryptol. ePrint Arch. 2011: 495 (2011) - [i4]Dario Catalano, Dario Fiore, Bogdan Warinschi:
Efficient Network Coding Signatures in the Standard Model. IACR Cryptol. ePrint Arch. 2011: 696 (2011) - 2010
- [j1]Dario Fiore, Rosario Gennaro:
Identity-Based Key Exchange Protocols without Pairings. Trans. Comput. Sci. 10: 42-77 (2010) - [c8]Mauro Barni, Tiziano Bianchi
A privacy-compliant fingerprint recognition system based on homomorphic encryption and Fingercode templates. BTAS 2010: 1-7 - [c7]Dario Fiore, Rosario Gennaro:
Making the Diffie-Hellman Protocol Identity-Based. CT-RSA 2010: 165-178 - [c6]Mauro Barni, Tiziano Bianchi
Privacy-preserving fingercode authentication. MM&Sec 2010: 231-240 - [c5]Dario Fiore, Rosario Gennaro, Nigel P. Smart:
Constructing Certificateless Encryption and ID-Based Encryption from ID-Based Key Agreement. Pairing 2010: 167-186 - [i3]Dario Fiore, Dominique Schröder:
Uniqueness is a Different Story: Impossibility of Verifiable Random Functions from Trapdoor Permutations. IACR Cryptol. ePrint Arch. 2010: 648 (2010)
2000 – 2009
- 2009
- [c4]Dario Catalano, Dario Fiore, Rosario Gennaro:
Certificateless onion routing. CCS 2009: 151-160 - [c3]Michel Abdalla
Verifiable Random Functions from Identity-Based Key Encapsulation. EUROCRYPT 2009: 554-571 - [i2]Dario Fiore, Rosario Gennaro:
Making the Diffie-Hellman Protocol Identity-Based. IACR Cryptol. ePrint Arch. 2009: 174 (2009) - [i1]Dario Fiore, Rosario Gennaro, Nigel P. Smart:
Constructing Certificateless Encryption and ID-Based Encryption from ID-Based Key Agreement. IACR Cryptol. ePrint Arch. 2009: 600 (2009) - 2008
- [c2]Dario Catalano, Dario Fiore, Mariagrazia Messina:
Zero-Knowledge Sets with Short Proofs. EUROCRYPT 2008: 433-450 - [c1]Dario Catalano, Mario Di Raimondo, Dario Fiore, Rosario Gennaro:
Off-Line/On-Line Signatures: Theoretical Aspects and Experimental Results. Public Key Cryptography 2008: 101-120
Coauthor Index
[c59] [c58] [c55] [c50] [c48] [i54] [i53] [i52] [i51] [i45] [c41] [i34] [j12] [j11] [c38] [c37] [j9] [c35] [c34] [i28] [i27] [i26] [i22] [i21] [j7] [c28] [c27] [i19] [i17] [i16] [j6] [c22] [c21] [i14] [i12] [j5] [j4] [c17] [c16] [c15] [c12] [j2] [c10] [c9] [i6] [i5] [i4] [c8] [c6] [c4] [c3] [c2] [c1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-13 20:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: