Antonio Faonio

Orcid: 0000-0002-7152-6478

According to our database1, Antonio Faonio authored at least 28 papers between 2013 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Almost Tightly-Secure Re-Randomizable and Replayable CCA-secure Public Key Encryption.
IACR Cryptol. ePrint Arch., 2023

From Polynomial IOP and Commitments to Non-malleable zkSNARKs.
IACR Cryptol. ePrint Arch., 2023

Lookup Arguments: Improvements, Extensions and Applications to Zero-Knowledge Decision Trees.
IACR Cryptol. ePrint Arch., 2023

2022
The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free.
IEEE Trans. Inf. Theory, 2022

Mix-Nets from Re-Randomizable and Replayable CCA-secure Public-Key Encryption.
IACR Cryptol. ePrint Arch., 2022

Short Non-Malleable Codes from Related-Key Secure Block Ciphers, Revisited.
IACR Cryptol. ePrint Arch., 2022

2021
Practical Continuously Non-Malleable Randomness Encoders in the Random Oracle Model.
IACR Cryptol. ePrint Arch., 2021

Continuously Non-Malleable Secret Sharing: Joint Tampering, Plain Model and Capacity.
IACR Cryptol. ePrint Arch., 2021

2020
Auditable Asymmetric Password Authenticated Public Key Establishment.
IACR Cryptol. ePrint Arch., 2020

Subversion-Resilient Enhanced Privacy ID.
IACR Cryptol. ePrint Arch., 2020

Lunar: a Toolbox for More Efficient Universal and Updatable zkSNARKs and Commit-and-Prove Extensions.
IACR Cryptol. ePrint Arch., 2020

Non-Malleable Secret Sharing against Bounded Joint-Tampering Attacks in the Plain Model.
IACR Cryptol. ePrint Arch., 2020

Improving the Efficiency of Re-randomizable and Replayable CCA Secure Public Key Encryption.
Proceedings of the Applied Cryptography and Network Security, 2020

2019
Continuously non-malleable codes with split-state refresh.
Theor. Comput. Sci., 2019

Structure-Preserving and Re-randomizable RCCA-secure Public Key Encryption and its Applications.
IACR Cryptol. ePrint Arch., 2019

Non-Malleable Secret Sharing in the Computational Setting: Adaptive Tampering, Noisy-Leakage Resilience, and Improved Rate.
IACR Cryptol. ePrint Arch., 2019

Rate-Optimizing Compilers for Continuously Non-Malleable Codes.
IACR Cryptol. ePrint Arch., 2019

Continuously Non-Malleable Secret Sharing for General Access Structures.
IACR Cryptol. ePrint Arch., 2019

2018
Efficient Fully-Leakage Resilient One-More Signature Schemes.
IACR Cryptol. ePrint Arch., 2018

2017
Fully leakage-resilient signatures revisited: Graceful degradation, noisy leakage, and construction in the bounded-retrieval model.
Theor. Comput. Sci., 2017

2016
Efficient Public-Key Cryptography with Bounded Leakage and Tamper Resilience.
IACR Cryptol. ePrint Arch., 2016

Non-Malleable Codes with Split-State Refresh.
IACR Cryptol. ePrint Arch., 2016

2015
Predictable Arguments of Knowledge.
IACR Cryptol. ePrint Arch., 2015

Fully Leakage-Resilient Codes.
IACR Cryptol. ePrint Arch., 2015

Leakage-Resilient Identification Schemes from Zero-Knowledge Proofs of Storage.
IACR Cryptol. ePrint Arch., 2015

2014
Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation.
IACR Cryptol. ePrint Arch., 2014

Certified Bitcoins.
IACR Cryptol. ePrint Arch., 2014

2013
Proofs of Space: When Space is of the Essence.
IACR Cryptol. ePrint Arch., 2013


  Loading...