| Concurrent non-malleable commitments (and more) in 3 rounds M Ciampi, R Ostrovsky, L Siniscalchi, I Visconti Advances in Cryptology–CRYPTO 2016: 36th Annual International Cryptology …, 2016 | 57 | 2016 |
| Improved OR-composition of sigma-protocols M Ciampi, G Persiano, A Scafuro, L Siniscalchi, I Visconti Theory of Cryptography: 13th International Conference, TCC 2016-A, Tel Aviv …, 2016 | 51 | 2016 |
| Online/offline OR composition of sigma protocols M Ciampi, G Persiano, A Scafuro, L Siniscalchi, I Visconti Advances in Cryptology–EUROCRYPT 2016: 35th Annual International Conference …, 2016 | 47 | 2016 |
| Four-round concurrent non-malleable commitments from one-way functions M Ciampi, R Ostrovsky, L Siniscalchi, I Visconti Advances in Cryptology–CRYPTO 2017: 37th Annual International Cryptology …, 2017 | 46 | 2017 |
| Balancing privacy and accountability in blockchain identity management I Damgård, C Ganesh, H Khoshakhlagh, C Orlandi, L Siniscalchi Cryptographers’ Track at the RSA Conference, 552-576, 2021 | 44* | 2021 |
| A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles M Ciampi, G Persiano, L Siniscalchi, I Visconti Theory of Cryptography: 13th International Conference, TCC 2016-A, Tel Aviv …, 2016 | 44 | 2016 |
| Round-optimal secure two-party computation from trapdoor permutations M Ciampi, R Ostrovsky, L Siniscalchi, I Visconti Theory of Cryptography: 15th International Conference, TCC 2017, Baltimore …, 2017 | 39 | 2017 |
| Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds M Ciampi, R Ostrovsky, L Siniscalchi, I Visconti Theory of Cryptography Conference, 711-742, 2017 | 35 | 2017 |
| Managing constraints in role based access control C Blundo, S Cimato, L Siniscalchi IEEE Access 8, 140497-140511, 2020 | 20 | 2020 |
| Publicly verifiable proofs from blockchains A Scafuro, L Siniscalchi, I Visconti IACR International Workshop on Public Key Cryptography, 374-401, 2019 | 20 | 2019 |
| Multiparty computation with covert security and public verifiability P Scholl, M Simkin, L Siniscalchi Cryptology ePrint Archive, 2021 | 17 | 2021 |
| How to extract useful randomness from unreliable sources D Aggarwal, M Obremski, J Ribeiro, L Siniscalchi, I Visconti Advances in Cryptology–EUROCRYPT 2020: 39th Annual International Conference …, 2020 | 17 | 2020 |
| Broadcast-optimal two round MPC with an honest majority I Damgård, B Magri, D Ravi, L Siniscalchi, S Yakoubov Annual International Cryptology Conference, 155-184, 2021 | 13 | 2021 |
| PRUCC-RM: permission-role-usage cardinality constrained role mining C Blundo, S Cimato, L Siniscalchi 2017 IEEE 41st Annual Computer Software and Applications Conference (COMPSAC …, 2017 | 12 | 2017 |
| Targeted advertising that protects the privacy of social networks users C Blundo, C De Maio, M Parente, L Siniscalchi Human-centric Computing and Information Sciences 11 (18), 2021 | 10 | 2021 |
| Role mining heuristics for permission-role-usage cardinality constraints C Blundo, S Cimato, L Siniscalchi The Computer Journal 65 (6), 1386-1411, 2022 | 8 | 2022 |
| Multi-client functional encryption for separable functions M Ciampi, L Siniscalchi, H Waldner IACR International Conference on Public-Key Cryptography, 724-753, 2021 | 8 | 2021 |
| Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments I Damgård, T Kazana, M Obremski, V Raj, L Siniscalchi Theory of Cryptography Conference, 225-254, 2018 | 8 | 2018 |
| Minimizing setup in broadcast-optimal two round MPC I Damgård, D Ravi, L Siniscalchi, S Yakoubov Annual International Conference on the Theory and Applications of …, 2023 | 7 | 2023 |
| Privacy amplification with tamperable memory via non-malleable two-source extractors D Aggarwal, M Obremski, J Ribeiro, M Simkin, L Siniscalchi IEEE Transactions on Information Theory 68 (8), 5475-5495, 2022 | 7* | 2022 |
