Daniele Venturi
| Titolo | Pubblicato in | Anno |
|---|---|---|
| The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2021 |
| A compiler for multi-key homomorphic signatures for Turing machines | THEORETICAL COMPUTER SCIENCE | 2021 |
| Shielded Computations in Smart Contracts Overcoming Forks | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2021 |
| Continuously Non-malleable Secret Sharing: Joint Tampering, Plain Model and Capacity | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2021 |
| Identity-Based Matchmaking Encryption Without Random Oracles | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2021 |
| Subversion-resilient signatures: Definitions, constructions and applications | THEORETICAL COMPUTER SCIENCE | 2020 |
| Continuously Non-malleable Codes in the Split-State Model | JOURNAL OF CRYPTOLOGY | 2020 |
| Non-malleable Encryption: Simpler, Shorter, Stronger | JOURNAL OF CRYPTOLOGY | 2020 |
| Cryptographic reverse firewalls for interactive proof systems | THEORETICAL COMPUTER SCIENCE | 2020 |
| Cryptographic reverse firewalls for interactive proof systems | Leibniz International Proceedings in Informatics, LIPIcs | 2020 |
| Non-malleable secret sharing against bounded joint-tampering attacks in the plain model | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2020 |
| On adaptive security of delayed-input sigma protocols and fiat-shamir nizks | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2020 |
| Vision: What If They All Die? Crypto Requirements For Key People | 2020 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW) | 2020 |
| A Black-Box Construction of Fully-Simulatable, Round-Optimal Oblivious Transfer from Strongly Uniform Key Agreement | Theory of Cryptography | 2019 |
| Public immunization against complete subversion without random oracles | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2019 |
| Match me if you can: matchmaking encryption and its applications | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2019 |
| Rate-optimizing compilers for continuously non-malleable codes | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2019 |
| Continuously Non-malleable Secret Sharing for General Access Structures | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2019 |
| Non-malleable Secret Sharing in the Computational Setting: Adaptive Tampering, Noisy-Leakage Resilience, and Improved Rate | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2019 |
| Continuously non-malleable codes with split-state refresh | THEORETICAL COMPUTER SCIENCE | 2019 |
© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma