Antonio Faonio

EURECOM — France

Computer Science · Physical Sciences

11h-index461citations45works5.72yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Cryptography and Data Security(40), Cryptographic Implementations and Security(20), Security and Verification in Computing(12), Blockchain Technology Applications and Security(8), Chaos-based Image/Signal Encryption(8)

Publications45 total

SNARKs for Virtual Machines Are Non-malleable
Lecture notes in computer science·2025· 1 cited
Real-World Universal zkSNARKs are Non-Malleable
2024· 5 citedOpen Access
Lookup Arguments: Improvements, Extensions and Applications to Zero-Knowledge Decision Trees
Lecture notes in computer science·2024· 11 citedOpen Access
Almost Tightly-Secure Re-randomizable and Replayable CCA-Secure Public Key Encryption
Lecture notes in computer science·2023· 1 cited
From Polynomial IOP and Commitments to Non-malleable zkSNARKs
Lecture notes in computer science·2023· 11 citedOpen Access
Short Non-Malleable Codes from Related-Key Secure Block Ciphers, Revisited
IACR Transactions on Symmetric Cryptology·2022· 4 citedOpen Access
The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free
IEEE Transactions on Information Theory·2022· 3 cited
Subversion-Resilient Enhanced Privacy ID
Lecture notes in computer science·2022Open Access
Mix-Nets from Re-randomizable and Replayable CCA-Secure Public-Key Encryption
Lecture notes in computer science·2022· 2 citedOpen Access
Auditable Asymmetric Password Authenticated Public Key Establishment
Lecture notes in computer science·2022Open Access
The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free
Lecture notes in computer science·2021· 4 cited
Continuously Non-Malleable Secret Sharing: Joint Tampering, Plain Model and Capacity.
IACR Cryptology ePrint Archive·2021
Lunar: A Toolbox for More Efficient Universal and Updatable zkSNARKs and Commit-and-Prove Extensions
Lecture notes in computer science·2021· 54 cited
Continuously Non-malleable Secret Sharing: Joint Tampering, Plain Model and Capacity
Lecture notes in computer science·2021· 8 cited
Practical Continuously Non-malleable Randomness Encoders in the Random Oracle Model
Lecture notes in computer science·2021· 1 cited
Non-Malleable Secret Sharing against Bounded Joint-Tampering Attacks in the Plain Model.
IACR Cryptology ePrint Archive·2020
Improving the Efficiency of Re-randomizable and Replayable CCA Secure Public Key Encryption
Lecture notes in computer science·2020· 8 cited
Non-malleable Secret Sharing Against Bounded Joint-Tampering Attacks in the Plain Model
Lecture notes in computer science·2020· 17 cited
Continuously non-malleable codes with split-state refresh
Theoretical Computer Science·2019· 3 citedOpen Access
Rate-Optimizing Compilers for Continuously Non-malleable Codes
Lecture notes in computer science·2019· 11 cited
page 1 of 3Next →

Frequent Co-authors

Daniele Venturi(22), Jesper Buus Nielsen(10), Dario Fiore(8), Gianluca Brian(8), Mark Simkin(7), Giuseppe Ateniese(6), Luigi Russo(5), Maciej Obremski(4), Ilario Bonacina(3), Nicola Galesi(3), Matteo Campanelli(3), João Ribeiro(3), Sandro Coretti(2), Seny Kamara(2), Maciej Skórski(2), Claudio Soriente(2), Anaïs Querol(1), Hadrián Rodríguez(1), Bernardo Magri(1), Breno de Medeiros(1)