| 2025 | ASIACRYPT | Broadcast-Optimal Secure Computation from Black-Box Oblivious Transfer. | Michele Ciampi, Divya Ravi, Luisa Siniscalchi, Yu Xia |
| 2025 | CRYPTO | Universally Composable SNARKs with Transparent Setup without Programmable Random Oracle. | Christian Badertscher, Matteo Campanelli, Michele Ciampi, Luigi Russo, Luisa Siniscalchi |
| 2025 | EuroCrypt | Round-Optimal Black-Box Multiparty Computation from Polynomial-Time Assumptions. | Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Hendrik Waldner |
| 2025 | FC | Short Paper: Rewardable Naysayer Proofs. | Gennaro Avitabile, Luisa Siniscalchi, Ivan Visconti |
| 2025 | TCC | Information-Theoretic Broadcast-Optimal MPC. | Michele Ciampi, Ivan Damgrd, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov |
| 2024 | CRYPTO | Black-Box (and Fast) Non-malleable Zero Knowledge. | Vincenzo Botta, Michele Ciampi, Emmanuela Orsini, Luisa Siniscalchi, Ivan Visconti |
| 2024 | ESORICS | Incremental Time-Deniable Signatures. | Luisa Siniscalchi, Ivan Visconti |
| 2023 | CRYPTO | List Oblivious Transfer and Applications to Round-Optimal Black-Box Multiparty Coin Tossing. | Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Hendrik Waldner |
| 2023 | EuroCrypt | Minimizing Setup in Broadcast-Optimal Two Round MPC. | Ivan Damgrd, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov |
| 2023 | TCC | Broadcast-Optimal Four-Round MPC in the Plain Model. | Michele Ciampi, Ivan Damgrd, Divya Ravi, Luisa Siniscalchi, Yu Xia, Sophia Yakoubov |
| 2022 | EuroCrypt | Round-Optimal Multi-party Computation with Identifiable Abort. | Michele Ciampi, Divya Ravi, Luisa Siniscalchi, Hendrik Waldner |
| 2022 | SCN | On Sufficient Oracles for Secure Computation with Identifiable Abort. | Mark Simkin, Luisa Siniscalchi, Sophia Yakoubov |
| 2022 | TCC | Four-Round Black-Box Non-malleable Schemes from One-Way Permutations. | Michele Ciampi, Emmanuela Orsini, Luisa Siniscalchi |
| 2021 | CRYPTO | Broadcast-Optimal Two Round MPC with an Honest Majority. | Ivan Damgrd, Bernardo Magri, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov |
| 2021 | PKC | Multi-Client Functional Encryption for Separable Functions. | Michele Ciampi, Luisa Siniscalchi, Hendrik Waldner |
| 2021 | PKC | Publicly Verifiable Zero Knowledge from (Collapsing) Blockchains. | Alessandra Scafuro, Luisa Siniscalchi, Ivan Visconti |
| 2020 | EuroCrypt | How to Extract Useful Randomness from Unreliable Sources. | Divesh Aggarwal, Maciej Obremski, Joo Ribeiro, Luisa Siniscalchi, Ivan Visconti |
| 2019 | PKC | Publicly Verifiable Proofs from Blockchains. | Alessandra Scafuro, Luisa Siniscalchi, Ivan Visconti |
| 2018 | IDEAL | PostProcessing in Constrained Role Mining. | Carlo Blundo, Stelvio Cimato, Luisa Siniscalchi |
| 2018 | TCC | Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments. | Ivan Damgrd, Tomasz Kazana, Maciej Obremski, Varun Raj, Luisa Siniscalchi |
| 2017 | COMPSAC | PRUCC-RM: Permission-Role-Usage Cardinality Constrained Role Mining. | Carlo Blundo, Stelvio Cimato, Luisa Siniscalchi |
| 2017 | CRYPTO | Four-Round Concurrent Non-Malleable Commitments from One-Way Functions. | Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti |
| 2017 | TCC | Round-Optimal Secure Two-Party Computation from Trapdoor Permutations. | Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti |
| 2017 | TCC | Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds. | Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti |
| 2016 | CRYPTO | Concurrent Non-Malleable Commitments (and More) in 3 Rounds. | Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti |
| 2016 | EuroCrypt | Online/Offline OR Composition of Sigma Protocols. | Michele Ciampi, Giuseppe Persiano, Alessandra Scafuro, Luisa Siniscalchi, Ivan Visconti |
| 2016 | TCC | Improved OR-Composition of Sigma-Protocols. | Michele Ciampi, Giuseppe Persiano, Alessandra Scafuro, Luisa Siniscalchi, Ivan Visconti |
| 2016 | TCC | A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles. | Michele Ciampi, Giuseppe Persiano, Luisa Siniscalchi, Ivan Visconti |