default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDanilo Francati
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Danilo Francati, Daniele Friolo, Giulio Malavolta, Daniele Venturi:
Multi-key and Multi-input Predicate Encryption (for Conjunctions) from Learning with Errors. J. Cryptol. 37(3): 24 (2024)- [c15]Danilo Francati
, Daniele Venturi:
Non-malleable Fuzzy Extractors. ACNS (1) 2024: 135-155 - [c14]Danilo Francati, Daniele Venturi:
Evolving Secret Sharing Made Short. ASIACRYPT (7) 2024: 69-99 - [c13]Giuseppe Ateniese, Foteini Baldimtsi, Matteo Campanelli, Danilo Francati, Ioanna Karantaidou:
Advancing Scalability in Decentralized Storage: A Novel Approach to Proof-of-Replication via Polynomial Evaluation. CRYPTO (2) 2024: 3-39 - [c12]Hanlin Zhang, Benjamin L. Edelman, Danilo Francati, Daniele Venturi, Giuseppe Ateniese, Boaz Barak:
Watermarks in the Sand: Impossibility of Strong Watermarking for Language Models. ICML 2024 - [c11]Dario Pasquini, Danilo Francati, Giuseppe Ateniese, Evgenios M. Kornaropoulos:
Breach Extraction Attacks: Exposing and Addressing the Leakage in Second Generation Compromised Credential Checking Services. SP 2024: 1405-1423 - 2023
- [c10]Danilo Francati, Daniele Friolo, Monosij Maitra, Giulio Malavolta, Ahmadreza Rahimi, Daniele Venturi:
Registered (Inner-Product) Functional Encryption. ASIACRYPT (5) 2023: 98-133 - [c9]Danilo Francati, Daniele Friolo, Giulio Malavolta, Daniele Venturi:
Multi-key and Multi-input Predicate Encryption from Learning with Errors. EUROCRYPT (3) 2023: 573-604 - [c8]Giuseppe Ateniese, Long Chen, Danilo Francati, Dimitrios Papadopoulos, Qiang Tang:
Verifiable Capacity-Bound Functions: A New Primitive from Kolmogorov Complexity - (Revisiting Space-Based Security in the Adaptive Setting). Public Key Cryptography (2) 2023: 63-93 - [c7]Matteo Campanelli, Danilo Francati, Claudio Orlandi:
Structure-Preserving Compilers from New Notions of Obfuscations. Public Key Cryptography (2) 2023: 663-693 - [i17]Hanlin Zhang, Benjamin L. Edelman, Danilo Francati, Daniele Venturi, Giuseppe Ateniese, Boaz Barak:
Watermarks in the Sand: Impossibility of Strong Watermarking for Generative Models. CoRR abs/2311.04378 (2023) - [i16]Danilo Francati, Daniele Friolo, Monosij Maitra, Giulio Malavolta, Ahmadreza Rahimi, Daniele Venturi:
Registered (Inner-Product) Functional Encryption. IACR Cryptol. ePrint Arch. 2023: 395 (2023) - [i15]Danilo Francati, Daniele Venturi:
Evolving Secret Sharing Made Short. IACR Cryptol. ePrint Arch. 2023: 1534 (2023) - [i14]Giuseppe Ateniese, Foteini Baldimtsi, Matteo Campanelli, Danilo Francati, Ioanna Karantaidou:
Advancing Scalability in Decentralized Storage: A Novel Approach to Proof-of-Replication via Polynomial Evaluation. IACR Cryptol. ePrint Arch. 2023: 1569 (2023) - [i13]Hanlin Zhang, Benjamin L. Edelman, Danilo Francati, Daniele Venturi, Giuseppe Ateniese, Boaz Barak:
Watermarks in the Sand: Impossibility of Strong Watermarking for Generative Models. IACR Cryptol. ePrint Arch. 2023: 1776 (2023) - [i12]Dario Pasquini, Danilo Francati, Giuseppe Ateniese, Evgenios M. Kornaropoulos:
Breach Extraction Attacks: Exposing and Addressing the Leakage in Second Generation Compromised Credential Checking Services. IACR Cryptol. ePrint Arch. 2023: 1848 (2023) - 2022
- [c6]Dario Pasquini, Danilo Francati, Giuseppe Ateniese:
Eluding Secure Aggregation in Federated Learning via Model Inconsistency. CCS 2022: 2429-2443 - [i11]Matteo Campanelli, Danilo Francati, Claudio Orlandi:
Structure-Preserving Compilers from New Notions of Obfuscations. IACR Cryptol. ePrint Arch. 2022: 732 (2022) - [i10]Danilo Francati, Daniele Friolo, Giulio Malavolta, Daniele Venturi:
Multi-key and Multi-input Predicate Encryption from Learning with Errors. IACR Cryptol. ePrint Arch. 2022: 806 (2022) - 2021
- [j2]Giuseppe Ateniese, Danilo Francati, David Nuñez, Daniele Venturi:
Match Me if You Can: Matchmaking Encryption and Its Applications. J. Cryptol. 34(3): 16 (2021) - [j1]Giuseppe Ateniese, Danilo Francati, Bernardo Magri, Daniele Venturi:
Immunization against complete subversion without random oracles. Theor. Comput. Sci. 859: 1-36 (2021) - [c5]Danilo Francati, Giuseppe Ateniese, Abdoulaye Faye, Andrea Maria Milazzo, Angelo Massimo Perillo, Luca Schiatti, Giuseppe Giordano:
Audita: A Blockchain-based Auditing Framework for Off-chain Storage. SBC@AsiaCCS 2021: 5-10 - [c4]Danilo Francati, Alessio Guidi, Luigi Russo, Daniele Venturi:
Identity-Based Matchmaking Encryption Without Random Oracles. INDOCRYPT 2021: 415-435 - [i9]Dario Pasquini, Danilo Francati, Giuseppe Ateniese:
Eluding Secure Aggregation in Federated Learning via Model Inconsistency. CoRR abs/2111.07380 (2021) - [i8]Giuseppe Ateniese, Long Chen, Danilo Francati, Dimitrios Papadopoulos, Qiang Tang:
Verifiable Capacity-bound Functions: A New Primitive from Kolmogorov Complexity. IACR Cryptol. ePrint Arch. 2021: 162 (2021) - [i7]Danilo Francati, Alessio Guidi, Luigi Russo, Daniele Venturi:
Identity-Based Matchmaking Encryption without Random Oracles. IACR Cryptol. ePrint Arch. 2021: 1660 (2021) - 2020
- [c3]Adriano Di Luzio, Danilo Francati, Giuseppe Ateniese:
Arcula: A Secure Hierarchical Deterministic Wallet for Multi-asset Blockchains. CANS 2020: 323-343
2010 – 2019
- 2019
- [c2]Giuseppe Ateniese, Danilo Francati, Bernardo Magri, Daniele Venturi:
Public Immunization Against Complete Subversion Without Random Oracles. ACNS 2019: 465-485 - [c1]Giuseppe Ateniese, Danilo Francati, David Nuñez, Daniele Venturi:
Match Me if You Can: Matchmaking Encryption and Its Applications. CRYPTO (2) 2019: 701-731 - [i6]Adriano Di Luzio, Danilo Francati, Giuseppe Ateniese:
Arcula: A Secure Hierarchical Deterministic Wallet for Multi-asset Blockchains. CoRR abs/1906.05919 (2019) - [i5]Danilo Francati, Giuseppe Ateniese, Abdoulaye Faye, Andrea Maria Milazzo, Angelo Massimo Perillo, Luca Schiatti, Giuseppe Giordano:
Audita: A Blockchain-based Auditing Framework for Off-chain Storage. CoRR abs/1911.08515 (2019) - [i4]Adriano Di Luzio, Danilo Francati, Giuseppe Ateniese:
Arcula: A Secure Hierarchical Deterministic Wallet for Multi-asset Blockchains. IACR Cryptol. ePrint Arch. 2019: 704 (2019) - [i3]Giuseppe Ateniese, Danilo Francati, Bernardo Magri, Daniele Venturi:
Immunization against Complete Subversion without Random Oracles. IACR Cryptol. ePrint Arch. 2019: 1173 (2019) - [i2]Danilo Francati, Giuseppe Ateniese, Abdoulaye Faye, Andrea Maria Milazzo, Angelo Massimo Perillo, Luca Schiatti, Giuseppe Giordano:
Audita: A Blockchain-based Auditing Framework for Off-chain Storage. IACR Cryptol. ePrint Arch. 2019: 1345 (2019) - 2018
- [i1]Giuseppe Ateniese, Danilo Francati, David Nuñez, Daniele Venturi:
Match Me if You Can: Matchmaking Encryption and its Applications. IACR Cryptol. ePrint Arch. 2018: 1094 (2018)
Coauthor Index
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 2025-01-09 19:33 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:
