Improved OR Composition of Sigma-Protocols. - Michele Ciampi; Giuseppe Persiano; Alessandra Scafuro; Luisa Siniscalchi; Ivan Visconti (IACR Cryptol. ePrint Arch., 2015)

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 (IACR Cryptol. ePrint Arch., 2015)

Concurrent Non-Malleable Commitments (and More) in 3 Rounds. - Michele Ciampi; Rafail Ostrovsky; Luisa Siniscalchi; Ivan Visconti (IACR Cryptol. ePrint Arch., 2016)

On Round-Efficient Non-Malleable Protocols. - Michele Ciampi; Rafail Ostrovsky; Luisa Siniscalchi; Ivan Visconti (IACR Cryptol. ePrint Arch., 2016)

Online/Offline OR Composition of Sigma Protocols. - Michele Ciampi; Giuseppe Persiano; Alessandra Scafuro; Luisa Siniscalchi; Ivan Visconti (IACR Cryptol. ePrint Arch., 2016)

PRUCC-RM: Permission-Role-Usage Cardinality Constrained Role Mining. - Carlo Blundo; Stelvio Cimato; Luisa Siniscalchi (COMPSAC (2), 2017)

Four-Round Concurrent Non-Malleable Commitments from One-Way Functions. - Michele Ciampi; Rafail Ostrovsky; Luisa Siniscalchi; Ivan Visconti (CRYPTO (2), 2017)

Round-Optimal Secure Two-Party Computation from Trapdoor Permutations. - Michele Ciampi; Rafail Ostrovsky; Luisa Siniscalchi; Ivan Visconti (IACR Cryptol. ePrint Arch., 2017)

Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds. - Michele Ciampi; Rafail Ostrovsky; Luisa Siniscalchi; Ivan Visconti (IACR Cryptol. ePrint Arch., 2017)

PostProcessing in Constrained Role Mining. - Carlo Blundo; Stelvio Cimato; Luisa Siniscalchi (IDEAL (1), 2018)

Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments. - Ivan Damgård; Tomasz Kazana; Maciej Obremski; Varun Raj; Luisa Siniscalchi (IACR Cryptol. ePrint Arch., 2018)

An intelligent and private method to profile social network users. - Carlo Blundo; Carmen De Maio; Mimmo Parente; Luisa Siniscalchi (FUZZ-IEEE, 2019)

How to Extract Useful Randomness from Unreliable Sources. - Divesh Aggarwal; Maciej Obremski; João Ribeiro 002; Luisa Siniscalchi; Ivan Visconti (IACR Cryptol. ePrint Arch., 2019)

Publicly Verifiable Proofs from Blockchains. - Alessandra Scafuro; Luisa Siniscalchi; Ivan Visconti (IACR Cryptol. ePrint Arch., 2019)

Managing Constraints in Role Based Access Control. - Carlo Blundo; Stelvio Cimato; Luisa Siniscalchi (IEEE Access, 2020)

Computational and Information-Theoretic Two-Source (Non-Malleable) Extractors. - Divesh Aggarwal; Maciej Obremski; João Ribeiro 002; Mark Simkin 001; Luisa Siniscalchi (IACR Cryptol. ePrint Arch., 2020)

Two-Source Non-Malleable Extractors and Applications to Privacy Amplification with Tamperable Memory. - Divesh Aggarwal; Maciej Obremski; João Ribeiro 002; Mark Simkin 001; Luisa Siniscalchi (IACR Cryptol. ePrint Arch., 2020)

Multi-Client Functional Encryption for Separable Functions. - Michele Ciampi; Luisa Siniscalchi; Hendrik Waldner (IACR Cryptol. ePrint Arch., 2020)

Balancing Privacy and Accountability in Blockchain Transactions. - Ivan Damgård; Chaya Ganesh; Hamidreza Khoshakhlagh; Claudio Orlandi; Luisa Siniscalchi (IACR Cryptol. ePrint Arch., 2020)

Broadcast-Optimal Two Round MPC with an Honest Majority. - Ivan Damgård; Bernardo Magri; Luisa Siniscalchi; Sophia Yakoubov (IACR Cryptol. ePrint Arch., 2020)

Publicly Verifiable Zero Knowledge from (Collapsing) Blockchains. - Alessandra Scafuro; Luisa Siniscalchi; Ivan Visconti (IACR Cryptol. ePrint Arch., 2020)

Broadcast-Optimal Two Round MPC with an Honest Majority. - Ivan Damgård; Bernardo Magri; Divya Ravi 001; Luisa Siniscalchi; Sophia Yakoubov (CRYPTO (2), 2021)

Balancing Privacy and Accountability in Blockchain Identity Management. - Ivan Damgård; Chaya Ganesh; Hamidreza Khoshakhlagh; Claudio Orlandi; Luisa Siniscalchi (CT-RSA, 2021)

Multiparty Computation with Covert Security and Public Verifiability. - Peter Scholl; Mark Simkin 001; Luisa Siniscalchi (IACR Cryptol. ePrint Arch., 2021)

On Sufficient Oracles for Secure Computation with Identifiable Abort. - Mark Simkin 001; Luisa Siniscalchi; Sophia Yakoubov (IACR Cryptol. ePrint Arch., 2021)

Four-Round Black-Box Non-malleable Schemes from One-Way Permutations. - Michele Ciampi; Emmanuela Orsini; Luisa Siniscalchi (TCC (2), 2022)

Role Mining Heuristics for Permission-Role-Usage Cardinality Constraints. - Carlo Blundo; Stelvio Cimato; Luisa Siniscalchi (Comput. J., 2022)

Four-Round Black-Box Non-Malleable Commitments from One-Way Permutations. - Michele Ciampi; Emmanuela Orsini; Luisa Siniscalchi (IACR Cryptol. ePrint Arch., 2022)

Round-Optimal Multi-Party Computation with Identifiable Abort. - Michele Ciampi; Divya Ravi 001; Luisa Siniscalchi; Hendrik Waldner (IACR Cryptol. ePrint Arch., 2022)

Minimizing Setup in Broadcast-Optimal Two Round MPC. - Ivan Damgård; Divya Ravi 001; Luisa Siniscalchi; Sophia Yakoubov (IACR Cryptol. ePrint Arch., 2022)

Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors. - Divesh Aggarwal; Maciej Obremski; João Ribeiro 002; Mark Simkin 001; Luisa Siniscalchi (IEEE Trans. Inf. Theory, 2022)

Broadcast-Optimal Four-Round MPC in the Plain Model. - Michele Ciampi; Ivan Damgård; Divya Ravi 001; Luisa Siniscalchi; Yu Xia 008; Sophia Yakoubov (IACR Cryptol. ePrint Arch., 2023)

List Oblivious Transfer and Applications to Round-Optimal Black-Box Multiparty Coin Tossing. - Michele Ciampi; Rafail Ostrovsky; Luisa Siniscalchi; Hendrik Waldner (IACR Cryptol. ePrint Arch., 2023)

Round-Optimal Black-Box Multiparty Computation from Polynomial-Time Assumptions. - Michele Ciampi; Rafail Ostrovsky; Luisa Siniscalchi; Hendrik Waldner (IACR Cryptol. ePrint Arch., 2023)

Broadcast-Optimal Two Round MPC with Asynchronous Peer-to-Peer Channels. - Ivan Damgård; Divya Ravi 001; Luisa Siniscalchi; Sophia Yakoubov (IACR Cryptol. ePrint Arch., 2023)

Heuristics for constrained role mining in the post-processing framework. - Carlo Blundo; Stelvio Cimato; Luisa Siniscalchi (J. Ambient Intell. Humaniz. Comput., 2023)

Incremental Time-Deniable Signatures. - Luisa Siniscalchi; Ivan Visconti (ESORICS (4), 2024)

Universally Composable SNARKs with Transparent Setup without Programmable Random Oracle. - Christian Badertscher; Matteo Campanelli; Michele Ciampi; Luigi Russo 001; Luisa Siniscalchi (IACR Cryptol. ePrint Arch., 2024)

Rewardable Naysayer Proofs. - Gennaro Avitabile; Luisa Siniscalchi; Ivan Visconti (IACR Cryptol. ePrint Arch., 2025)

Black-Box (and Fast) Non-Malleable Zero Knowledge. - Vincenzo Botta; Michele Ciampi; Emmanuela Orsini; Luisa Siniscalchi; Ivan Visconti (IACR Cryptol. ePrint Arch., 2025)

Round and Computational Efficiency of Multi-party Protocols - Michele Ciampi; Luisa Siniscalchi (Springer, 2026)