A privacy-preserving protocol for neural-network-based computation. - Mauro Barni; Claudio Orlandi; Alessandro Piva (MM&Sec, 2006)

Zero-knowledge ST-DM watermarking. - Alessandro Piva; Vito Cappellini; Daniele Corazzi; Alessia De Rosa; Claudio Orlandi; Mauro Barni (Security, Steganography, and Watermarking of Multimedia Contents, 2006)

Oblivious Neural Network Computing via Homomorphic Encryption. - Claudio Orlandi; Alessandro Piva; Mauro Barni (EURASIP J. Inf. Secur., 2007)

Enhancing Privacy in Remote Data Classification. - Alessandro Piva; Claudio Orlandi; Michele Caini; Tiziano Bianchi; Mauro Barni (SEC, 2008)

Essentially Optimal Universally Composable Oblivious Transfer. - Ivan Damgård; Jesper Buus Nielsen; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2008)

LEGO for Two Party Secure Computation. - Jesper Buus Nielsen; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2008)

On the Necessary and Sufficient Assumptions for UC Computation. - Ivan Damgård; Jesper Buus Nielsen; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2009)

On Invertible Sampling and Adaptive Security. - Yuval Ishai; Abishek Kumarasubramanian; Claudio Orlandi; Amit Sahai (ASIACRYPT, 2010)

Semi-Homomorphic Encryption and Multiparty Computation. - Rikke Bendlin; Ivan Damgård; Claudio Orlandi; Sarah Zakarias (IACR Cryptol. ePrint Arch., 2010)

Multiparty Computation for Dishonest Majority: from Passive to Active Security at Low Cost. - Ivan Damgård; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2010)

Is multiparty computation any good in practice? - Claudio Orlandi (ICASSP, 2011)

Lower and Upper Bounds for Deniable Public-Key Encryption. - Rikke Bendlin; Jesper Buus Nielsen; Peter Sebastian Nordholt; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2011)

A New Approach to Practical Active-Secure Two-Party Computation. - Jesper Buus Nielsen; Peter Sebastian Nordholt; Claudio Orlandi; Sai Sheshank Burra (IACR Cryptol. ePrint Arch., 2011)

Privacy-aware mechanism design. - Kobbi Nissim; Claudio Orlandi; Rann Smorodinsky (EC, 2012)

Calling out Cheaters: Covert Security With Public Verifiability. - Gilad Asharov; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2012)

Hiding the Input-Size in Secure Two-Party Computation. - Yehuda Lindell; Kobbi Nissim; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2012)

On the Power of Correlated Randomness in Secure Computation. - Yuval Ishai; Eyal Kushilevitz; Sigurd Meldgaard; Claudio Orlandi; Anat Paskin-Cherniavsky (TCC, 2013)

MiniLEGO: Efficient Secure Two-Party Computation From General Assumptions. - Tore Kasper Frederiksen; Thomas Pelle Jakobsen; Jesper Buus Nielsen; Peter Sebastian Nordholt; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2013)

Zero-Knowledge Using Garbled Circuits: How To Prove Non-Algebraic Statements Efficiently. - Marek Jawurek; Florian Kerschbaum; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2013)

Obfuscation ==> (IND-CPA Security =/=> Circular Security). - Antonio Marcedone; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2013)

Publicly Auditable Secure Multi-Party Computation. - Carsten Baum; Ivan Damgård; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2014)

Privacy-Free Garbled Circuits with Applications To Efficient Zero-Knowledge. - Tore Kasper Frederiksen; Jesper Buus Nielsen; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2014)

Statistical Concurrent Non-Malleable Zero Knowledge. - Claudio Orlandi; Rafail Ostrovsky; Vanishree Rao; Amit Sahai; Ivan Visconti (IACR Cryptol. ePrint Arch., 2014)

Privacy-Enhancing Overlays in Bitcoin. - Sarah Meiklejohn; Claudio Orlandi (Financial Cryptography Workshops, 2015)

The Simplest Protocol for Oblivious Transfer. - Tung Chou; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2015)

How to Bootstrap Anonymous Communication. - Sune K. Jakobsen; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2015)

On the CCA (in)security of MTProto. - Jakob Jakobsen; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2015)

Cross and Clean: Amortized Garbled Circuits with Constant Overhead. - Jesper Buus Nielsen; Claudio Orlandi (TCC (B1), 2016)

Non-Interactive Verifiable Secret Sharing For Monotone Circuits. - Ge Bai; Ivan Damgård; Claudio Orlandi; Yu Xia 005 (IACR Cryptol. ePrint Arch., 2016)

Access Control Encryption: Enforcing Information Flow with Cryptography. - Ivan Damgård; Helene Haagh; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2016)

Digital Signatures from Symmetric-Key Primitives. - David Derler; Claudio Orlandi; Sebastian Ramacher; Christian Rechberger; Daniel Slamanig (IACR Cryptol. ePrint Arch., 2016)

ZKBoo: Faster Zero-Knowledge for Boolean Circuits. - Irene Giacomelli; Jesper Madsen; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2016)

Revealing Encryption for Partial Ordering. - Helene Haagh; Yue Ji; Chenxing Li; Claudio Orlandi; Yifan Song (IACR Cryptol. ePrint Arch., 2016)

A Framework for Outsourcing of Secure Computation. - Thomas P. Jakobsen; Jesper Buus Nielsen; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2016)

Cross&Clean: Amortized Garbled Circuits with Constant Overhead. - Jesper Buus Nielsen; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2016)

PrivatePool: Privacy-Preserving Ridesharing. - Per A. Hallgren; Claudio Orlandi; Andrei Sabelfeld (CSF, 2017)

Faster Zero-Knowledge Protocols and Applications - (Invited Talk Abstract). - Claudio Orlandi (SECITC, 2017)

Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives. - Melissa Chase; David Derler; Steven Goldfeder; Claudio Orlandi; Sebastian Ramacher; Christian Rechberger; Daniel Slamanig; Greg Zaverucha (IACR Cryptol. ePrint Arch., 2017)

Assessing the No-Knowledge Property of SpiderOak ONE. - Anders P. K. Dalskov; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2017)

Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings. - Ivan Damgård; Claudio Orlandi; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2017)

Access Control Encryption for Equality, Comparison, and More. - Georg Fuchsbauer; Romain Gay; Lucas Kowalczyk; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2017)

Security of Symmetric Primitives under Incorrect Usage of Keys. - Pooya Farshim; Claudio Orlandi; Razvan Rosie (IACR Trans. Symmetric Cryptol., 2017)

Can You Trust Your Encrypted Cloud?: An Assessment of SpiderOakONE's Security. - Anders P. K. Dalskov; Claudio Orlandi (AsiaCCS, 2018)

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

Proofs of Replicated Storage Without Timing Assumptions. - Ivan Damgård; Chaya Ganesh; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2018)

QuisQuis: A New Design for Anonymous Cryptocurrencies. - Prastudy Fauzi; Sarah Meiklejohn; Rebekah Mercer; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2018)

Proof-of-Stake Protocols for Privacy-Aware Blockchains. - Chaya Ganesh; Claudio Orlandi; Daniel Tschudi (IACR Cryptol. ePrint Arch., 2018)

Transputation: Transport Framework for Secure Computation. - Markus Brandt; Claudio Orlandi; Kris Shrishak; Haya Schulmann (Krypto-Tag, 2019)

Sharing Information with Competitors. - Simina Brânzei; Claudio Orlandi; Guang Yang 020 (SAGT, 2019)

Security of Hedged Fiat-Shamir Signatures under Fault Attacks. - Diego F. Aranha; Claudio Orlandi; Akira Takahashi 002; Greg Zaverucha (IACR Cryptol. ePrint Arch., 2019)

Optimizing Transport Layer for Secure Computation. - Markus Brandt; Claudio Orlandi; Kris Shrishak; Haya Schulmann (IACR Cryptol. ePrint Arch., 2019)

Securing DNSSEC Keys via Threshold ECDSA From Generic MPC. - Anders P. K. Dalskov; Marcel Keller; Claudio Orlandi; Kris Shrishak; Haya Schulmann (IACR Cryptol. ePrint Arch., 2019)

Stronger Notions and Constructions for Multi-Designated Verifier Signatures. - Ivan Damgård; Helene Haagh; Rebekah Mercer; Anca Nitulescu; Claudio Orlandi; Sophia Yakoubov (IACR Cryptol. ePrint Arch., 2019)

Commodity-Based 2PC for Arithmetic Circuits. - Ivan Damgård; Helene Haagh; Michael Nielsen 001; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2019)

Use your Brain! Arithmetic 3PC For Any Modulus with Active Security. - Hendrik Eerikson; Claudio Orlandi; Pille Pullonen; Joonas Puura; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2019)

Refresh When You Wake Up: Proactive Threshold Wallets with Offline Devices. - Yashvanth Kondi; Bernardo Magri; Claudio Orlandi; Omer Shlomovits (IACR Cryptol. ePrint Arch., 2019)

TOPPool: Time-aware Optimized Privacy-Preserving Ridesharing. - Elena Pagnin; Gunnar Gunnarsson; Pedram Talebi; Claudio Orlandi; Andrei Sabelfeld (Proc. Priv. Enhancing Technol., 2019)

Optimal Transport Layer for Secure Computation. - Markus Brandt; Claudio Orlandi; Kris Shrishak; Haya Schulmann (ICETE (2), 2020)

Use Your Brain! Arithmetic 3PC for Any Modulus with Active Security. - Hendrik Eerikson; Marcel Keller; Claudio Orlandi; Pille Pullonen; Joonas Puura; Mark Simkin 001 (ITC, 2020)

Stronger Security and Constructions of Multi-designated Verifier Signatures. - Ivan Damgård; Helene Haagh; Rebekah Mercer; Anca Nitulescu; Claudio Orlandi; Sophia Yakoubov (TCC (2), 2020)

LSS Homomorphisms and Applications to Secure Signatures, Proactive Secret Sharing and Input Certification. - Diego F. Aranha; Anders P. K. Dalskov; Daniel Escudero 001; Claudio Orlandi (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)

Black-Box Transformations from Passive to Covert Security with Public Verifiability. - Ivan Damgård; Claudio Orlandi; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2020)

Virtual ASICs: Generalized Proof-of-Stake Mining in Cryptocurrencies. - Chaya Ganesh; Claudio Orlandi; Daniel Tschudi; Aviv Zohar (IACR Cryptol. ePrint Arch., 2020)

Secure Generalized Deduplication via Multi-Key Revealing Encryption. - Daniel E. Lucani; Lars Nielsen; Claudio Orlandi; Elena Pagnin; Rasmus Vestergaard (IACR Cryptol. ePrint Arch., 2020)

Stronger Notions and a More Efficient Construction of Threshold Ring Signatures. - Alexander Munch-Hansen; Claudio Orlandi; Sophia Yakoubov (IACR Cryptol. ePrint Arch., 2020)

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

Improved Threshold Signatures, Proactive Secret Sharing, and Input Certification from LSS Isomorphisms. - Diego F. Aranha; Anders P. K. Dalskov; Daniel Escudero 001; Claudio Orlandi (LATINCRYPT, 2021)

Low-Bandwidth Threshold ECDSA via Pseudorandom Correlation Generators. - Damiano Abram; Ariel Nof; Claudio Orlandi; Peter Scholl; Omer Shlomovits (IACR Cryptol. ePrint Arch., 2021)

ECLIPSE: Enhanced Compiling method for Pedersen-committed zkSNARK Engines. - Diego F. Aranha; Emil Madsen Bennedsen; Matteo Campanelli; Chaya Ganesh; Claudio Orlandi; Akira Takahashi 002 (IACR Cryptol. ePrint Arch., 2021)

Zero-Knowledge for Homomorphic Key-Value Commitments with Applications to Privacy-Preserving Ledgers. - Matteo Campanelli; Felix Engelmann; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2021)

Fiatâ"Shamir Bulletproofs are Non-Malleable (in the Algebraic Group Model). - Chaya Ganesh; Claudio Orlandi; Mahak Pancholi; Akira Takahashi 002; Daniel Tschudi (IACR Cryptol. ePrint Arch., 2021)

On the Bottleneck Complexity of MPC with Correlated Randomness. - Claudio Orlandi; Divya Ravi 001; Peter Scholl (IACR Cryptol. ePrint Arch., 2021)

The Rise of Paillier: Homomorphic Secret Sharing and Public-Key Silent OT. - Claudio Orlandi; Peter Scholl; Sophia Yakoubov (IACR Cryptol. ePrint Arch., 2021)

TOPPool: Time-aware Optimized Privacy-Preserving Ridesharing. - Elena Pagnin; Gunnar Gunnarsson; Pedram Talebi; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2021)

High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer. - Sai Sheshank Burra; Enrique Larraia; Jesper Buus Nielsen; Peter Sebastian Nordholt; Claudio Orlandi; Emmanuela Orsini; Peter Scholl; Nigel P. Smart (J. Cryptol., 2021)

Fiat-Shamir Bulletproofs are Non-Malleable (in the Algebraic Group Model). - Chaya Ganesh; Claudio Orlandi; Mahak Pancholi; Akira Takahashi 002; Daniel Tschudi (EUROCRYPT (2), 2022)

An Algebraic Framework for Silent Preprocessing with Trustless Setup and Active Security. - Damiano Abram; Ivan Damgård; Claudio Orlandi; Peter Scholl (IACR Cryptol. ePrint Arch., 2022)

Laconic Private Set-Intersection From Pairings. - Diego F. Aranha; Chuanwei Lin; Claudio Orlandi; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2022)

On Access Control Encryption without Sanitization. - Cecilia Boschini; Ivan Damgård; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2022)

Secure Multiparty Computation from Threshold Encryption based on Class Groups. - Lennart Braun; Ivan Damgård; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2022)

Structure-Preserving Compilers from New Notions of Obfuscations. - Matteo Campanelli; Danilo Francati; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2022)

Witness-Succinct Universally-Composable SNARKs. - Chaya Ganesh; Yashvanth Kondi; Claudio Orlandi; Mahak Pancholi; Akira Takahashi 002; Daniel Tschudi (IACR Cryptol. ePrint Arch., 2022)

Two-Round n-out-of-n and Multi-Signatures and Trapdoor Commitment from Lattices. - Ivan Damgård; Claudio Orlandi; Akira Takahashi 002; Mehdi Tibouchi (J. Cryptol., 2022)

Improved Distributed RSA Key Generation Using the Miller-Rabin Test. - Jakob Burkhardt; Ivan Damgård; Tore Kasper Frederiksen; Satrajit Ghosh; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2023)

Differentially Private Selection from Secure Distributed Computing. - Ivan Damgård; Hannah Keller; Boel Nelson; Claudio Orlandi; Rasmus Pagh (IACR Cryptol. ePrint Arch., 2023)

MPC with Low Bottleneck-Complexity: Information-Theoretic Security and More. - Hannah Keller; Claudio Orlandi; Anat Paskin-Cherniavsky; Divya Ravi 001 (IACR Cryptol. ePrint Arch., 2023)

Two-Round Stateless Deterministic Two-Party Schnorr Signatures From Pseudorandom Correlation Functions. - Yashvanth Kondi; Claudio Orlandi; Lawrence Roy (IACR Cryptol. ePrint Arch., 2023)

An Improved Threshold Homomorphic Cryptosystem Based on Class Groups. - Lennart Braun; Guilhem Castagnos; Ivan Damgård; Fabien Laguillaumie; Kelsey Melissaris; Claudio Orlandi; Ida Tucker (IACR Cryptol. ePrint Arch., 2024)

Distributed Differentially Private Data Analytics via Secure Sketching. - Jakob Burkhardt; Hannah Keller; Claudio Orlandi; Chris Schwiegelshohn (IACR Cryptol. ePrint Arch., 2024)

Securely Computing One-Sided Matching Markets. - James Hsin-Yu Chiang; Ivan Damgård; Claudio Orlandi; Mahak Pancholi; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2024)

Rate-1 Arithmetic Garbling from Homomorphic Secret-Sharing. - Pierre Meyer; Claudio Orlandi; Lawrence Roy; Peter Scholl (IACR Cryptol. ePrint Arch., 2024)

Privately Constrained PRFs from DCR: Puncturing and Bounded Waring Rank. - Amik Raj Behera; Pierre Meyer; Claudio Orlandi; Lawrence Roy; Peter Scholl (IACR Cryptol. ePrint Arch., 2025)

Silent Circuit Relinearisation: Sublinear-Size (Boolean and Arithmetic) Garbled Circuits from DCR. - Pierre Meyer; Claudio Orlandi; Lawrence Roy; Peter Scholl (IACR Cryptol. ePrint Arch., 2025)

Fiat-Shamir Bulletproofs are Non-malleable (in the Random Oracle Model). - Chaya Ganesh; Claudio Orlandi; Mahak Pancholi; Akira Takahashi 002; Daniel Tschudi (J. Cryptol., 2025)