Danilo Francati

Orcid: 0000-0002-4639-0636

According to our database1, Danilo Francati authored at least 19 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Multi-key and Multi-input Predicate Encryption (for Conjunctions) from Learning with Errors.
J. Cryptol., September, 2024

Watermarks in the Sand: Impossibility of Strong Watermarking for Language Models.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Non-malleable Fuzzy Extractors.
Proceedings of the Applied Cryptography and Network Security, 2024

2023
Watermarks in the Sand: Impossibility of Strong Watermarking for Generative Models.
IACR Cryptol. ePrint Arch., 2023

Breach Extraction Attacks: Exposing and Addressing the Leakage in Second Generation Compromised Credential Checking Services.
IACR Cryptol. ePrint Arch., 2023

Evolving Secret Sharing Made Short.
IACR Cryptol. ePrint Arch., 2023

Registered (Inner-Product) Functional Encryption.
IACR Cryptol. ePrint Arch., 2023

Advancing Scalability in Decentralized Storage: A Novel Approach to Proof-of-Replication via Polynomial Evaluation.
IACR Cryptol. ePrint Arch., 2023

Verifiable Capacity-Bound Functions: A New Primitive from Kolmogorov Complexity - (Revisiting Space-Based Security in the Adaptive Setting).
Proceedings of the Public-Key Cryptography - PKC 2023, 2023

2022
Multi-key and Multi-input Predicate Encryption from Learning with Errors.
IACR Cryptol. ePrint Arch., 2022

Structure-Preserving Compilers from New Notions of Obfuscations.
IACR Cryptol. ePrint Arch., 2022

Eluding Secure Aggregation in Federated Learning via Model Inconsistency.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021
Immunization against complete subversion without random oracles.
Theor. Comput. Sci., 2021

Match Me if You Can: Matchmaking Encryption and Its Applications.
J. Cryptol., 2021

Identity-Based Matchmaking Encryption without Random Oracles.
IACR Cryptol. ePrint Arch., 2021

Verifiable Capacity-bound Functions: A New Primitive from Kolmogorov Complexity.
IACR Cryptol. ePrint Arch., 2021

2019
Arcula: A Secure Hierarchical Deterministic Wallet for Multi-asset Blockchains.
IACR Cryptol. ePrint Arch., 2019

Audita: A Blockchain-based Auditing Framework for Off-chain Storage.
IACR Cryptol. ePrint Arch., 2019

Public Immunization Against Complete Subversion Without Random Oracles.
Proceedings of the Applied Cryptography and Network Security, 2019


  Loading...