Faonio, Antonio
39  results:
Search for persons X
?
1

Lookup Arguments: Improvements, Extensions and Applications..:

, In: Lecture Notes in Computer Science; Public-Key Cryptography – PKC 2024,
Campanelli, Matteo ; Faonio, Antonio ; Fiore, Dario.. - p. 337-369 , 2024
 
?
2

From Polynomial IOP and Commitments to Non-malleable zkSNAR..:

, In: Theory of Cryptography; Lecture Notes in Computer Science,
Faonio, Antonio ; Fiore, Dario ; Kohlweiss, Markulf.. - p. 455-485 , 2023
 
?
3

Almost Tightly-Secure Re-randomizable and Replayable CCA-Se..:

, In: Lecture Notes in Computer Science; Public-Key Cryptography – PKC 2023,
 
?
4

Auditable Asymmetric Password Authenticated Public Key Esta..:

, In: Cryptology and Network Security; Lecture Notes in Computer Science,
 
?
6

Mix-Nets from Re-randomizable and Replayable CCA-Secure Pub..:

, In: Lecture Notes in Computer Science; Security and Cryptography for Networks,
Faonio, Antonio ; Russo, Luigi - p. 172-196 , 2022
 
?
7

The Mother of All Leakages: How to Simulate Noisy Leakages ..:

Brian, Gianluca ; Faonio, Antonio ; Obremski, Maciej...
IEEE Transactions on Information Theory.  68 (2022)  12 - p. 8197-8227 , 2022
 
?
8

Subversion-Resilient Enhanced Privacy ID:

, In: Topics in Cryptology – CT-RSA 2022; Lecture Notes in Computer Science,
Faonio, Antonio ; Fiore, Dario ; Nizzardo, Luca. - p. 562-588 , 2022
 
?
9

Practical Continuously Non-malleable Randomness Encoders in..:

, In: Cryptology and Network Security; Lecture Notes in Computer Science,
Faonio, Antonio - p. 273-291 , 2021
 
?
10

The Mother of All Leakages: How to Simulate Noisy Leakages ..:

, In: Lecture Notes in Computer Science; Advances in Cryptology – EUROCRYPT 2021,
Brian, Gianluca ; Faonio, Antonio ; Obremski, Maciej... - p. 408-437 , 2021
 
?
11

Lunar: A Toolbox for More Efficient Universal and Updatable..:

, In: Lecture Notes in Computer Science; Advances in Cryptology – ASIACRYPT 2021,
 
?
12

Continuously Non-malleable Secret Sharing: Joint Tampering,..:

, In: Theory of Cryptography; Lecture Notes in Computer Science,
 
?
13

Non-malleable Secret Sharing Against Bounded Joint-Tamperin..:

, In: Advances in Cryptology – CRYPTO 2020; Lecture Notes in Computer Science,
 
?
14

Improving the Efficiency of Re-randomizable and Replayable ..:

, In: Applied Cryptography and Network Security; Lecture Notes in Computer Science,
Faonio, Antonio ; Fiore, Dario - p. 271-291 , 2020
 
?
15

Non-malleable Secret Sharing in the Computational Setting: ..:

, In: Advances in Cryptology – CRYPTO 2019; Lecture Notes in Computer Science,
Faonio, Antonio ; Venturi, Daniele - p. 448-479 , 2019
 
1-15