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)

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)

Combining Private Set-Intersection with Secure Two-Party Computation. - Michele Ciampi; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2018)

Timed Signatures and Zero-Knowledge Proofs -Timestamping in the Blockchain Era-. - Aydin Abadi; Michele Ciampi; Aggelos Kiayias; Vassilis Zikas (IACR Cryptol. ePrint Arch., 2019)

On Round Optimal Secure Multiparty Computation from Minimal Assumptions. - Arka Rai Choudhuri; Michele Ciampi; Vipul Goyal; Abhishek Jain 002; Rafail Ostrovsky (IACR Cryptol. ePrint Arch., 2019)

Four-Round Secure Multiparty Computation from General Assumptions. - Michele Ciampi; Rafail Ostrovsky (IACR Cryptol. ePrint Arch., 2019)

Secure Quantum Two-Party Computation: Impossibility and Constructions. - Michele Ciampi; Alexandru Cojocaru; Elham Kashefi; Atul Mantri (IACR Cryptol. ePrint Arch., 2020)

Updatable Blockchains. - Michele Ciampi; Nikos Karayannidis; Aggelos Kiayias; Dionysis Zindros (IACR Cryptol. ePrint Arch., 2020)

Collusion-Preserving Computation without a Mediator. - Michele Ciampi; Yun Lu 001; Vassilis Zikas (IACR Cryptol. ePrint Arch., 2020)

Round-Optimal and Communication-Efficient Multiparty Computation. - Michele Ciampi; Rafail Ostrovsky; Hendrik Waldner; Vassilis Zikas (IACR Cryptol. ePrint Arch., 2020)

On Adaptive Security of Delayed-Input Sigma Protocols and Fiat-Shamir NIZKs. - Michele Ciampi; Roberto Parisella; Daniele Venturi 001 (IACR Cryptol. ePrint Arch., 2020)

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

Oblivious Transfer from Trapdoor Permutations in Minimal Rounds. - Arka Rai Choudhuri; Michele Ciampi; Vipul Goyal; Abhishek Jain 002; Rafail Ostrovsky (IACR Cryptol. ePrint Arch., 2021)

Threshold Garbled Circuits and Ad Hoc Secure Computation. - Michele Ciampi; Vipul Goyal; Rafail Ostrovsky (IACR Cryptol. ePrint Arch., 2021)

FairMM: A Fast and Frontrunning-Resistant Crypto Market-Maker. - Michele Ciampi; Muhammad Ishaq; Malik Magdon-Ismail; Rafail Ostrovsky; Vassilis Zikas (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)

Agile Cryptography: A Composable Approach. - Christian Badertscher; Michele Ciampi; Aggelos Kiayias (IACR Cryptol. ePrint Arch., 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)

Agile Cryptography: A Universally Composable Approach. - Christian Badertscher; Michele Ciampi; Aggelos Kiayias (TCC (4), 2023)

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)

Multi-Theorem Fiat-Shamir Transform from Correlation-Intractable Hash Functions. - Michele Ciampi; Yu Xia 008 (IACR Cryptol. ePrint Arch., 2023)

Etherless Ethereum tokens: Simulating native tokens in Ethereum. - John Andrews; Michele Ciampi; Vassilis Zikas (J. Comput. Syst. Sci., 2023)

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)

Universal Composable Transaction Serialization with Order Fairness. - Michele Ciampi; Aggelos Kiayias; Yu Shen 002 (IACR Cryptol. ePrint Arch., 2024)

Universal Adaptor Signatures from Blackbox Multi-Party Computation. - Michele Ciampi; Xiangyu Liu; Ioannis Tzannetos; Vassilis Zikas (IACR Cryptol. ePrint Arch., 2024)

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

Two-Tier Black-box Blockchains and Application to Instant Layer-1 Payments. - Michele Ciampi; Yun Lu 001; Rafail Ostrovsky; Vassilis Zikas (IACR Cryptol. ePrint Arch., 2025)

Black-Box Constant-Round Secure 2PC with Succinct Communication. - Michele Ciampi; Ankit Kumar Misra; Rafail Ostrovsky; Akash Shah (IACR Cryptol. ePrint Arch., 2025)

Robust Non-Interactive Zero-Knowledge Combiners. - Michele Ciampi; Lorenzo Magliocco; Daniele Venturi 001; Yu Xia 008 (IACR Cryptol. ePrint Arch., 2025)

Delayed-Input Multi-Party Computation. - Michele Ciampi; Jure Sternad; Yu Xia 008 (IACR Cryptol. ePrint Arch., 2025)

Efficient NIZK Arguments with Straight-Line Simulation and Extraction. - Michele Ciampi; Ivan Visconti (IACR Cryptol. ePrint Arch., 2025)

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