| 2026 | EuroCrypt | OneTwoPAKE: Two-Round Strong Asymmetric PAKE with Ideal Security. | Yashvanth Kondi, Ian McQuoid, Kelsey Melissaris, Claudio Orlandi, Lawrence Roy, LaKyah Tyner |
| 2026 | EuroCrypt | Computationally Succinct Authentication from DCR - Attribute-Based Laconic Function Evaluation and More. | Pierre Meyer, Claudio Orlandi, Lawrence Roy, Peter Scholl |
| 2025 | CRYPTO | Silent Circuit Relinearisation: Sublinear-Size (Boolean and Arithmetic) Garbled Circuits from DCR. | Pierre Meyer, Claudio Orlandi, Lawrence Roy, Peter Scholl |
| 2025 | FC | Securely Computing One-Sided Matching Markets. | James Hsin-yu Chiang, Ivan Damgrd, Claudio Orlandi, Mahak Pancholi, Mark Simkin |
| 2025 | ICML | Distributed Differentially Private Data Analytics via Secure Sketching. | Jakob Burkhardt, Hannah Keller, Claudio Orlandi, Chris Schwiegelshohn |
| 2025 | TCC | Privately Constrained PRFs from DCR: Puncturing and Bounded Waring Rank. | Amik Raj Behera, Pierre Meyer, Claudio Orlandi, Lawrence Roy, Peter Scholl |
| 2024 | WWW | Differentially Private Selection from Secure Distributed Computing. | Ivan Damgrd, Hannah Keller, Boel Nelson, Claudio Orlandi, Rasmus Pagh |
| 2024 | SCN | An Improved Threshold Homomorphic Cryptosystem Based on Class Groups. | Lennart Braun, Guilhem Castagnos, Ivan Damgrd, Fabien Laguillaumie, Kelsey Melissaris, Claudio Orlandi, Ida Tucker |
| 2024 | TCC | Rate-1 Arithmetic Garbling From Homomorphic Secret Sharing. | Pierre Meyer, Claudio Orlandi, Lawrence Roy, Peter Scholl |
| 2023 | CCS | Improved Distributed RSA Key Generation Using the Miller-Rabin Test. | Jakob Burkhardt, Ivan Damgrd, Tore Kasper Frederiksen, Satrajit Ghosh, Claudio Orlandi |
| 2023 | CRYPTO | Secure Multiparty Computation from Threshold Encryption Based on Class Groups. | Lennart Braun, Ivan Damgrd, Claudio Orlandi |
| 2023 | CRYPTO | Two-Round Stateless Deterministic Two-Party Schnorr Signatures from Pseudorandom Correlation Functions. | Yashvanth Kondi, Claudio Orlandi, Lawrence Roy |
| 2023 | EuroCrypt | Witness-Succinct Universally-Composable SNARKs. | Chaya Ganesh, Yashvanth Kondi, Claudio Orlandi, Mahak Pancholi, Akira Takahashi, Daniel Tschudi |
| 2023 | PKC | Structure-Preserving Compilers from New Notions of Obfuscations. | Matteo Campanelli, Danilo Francati, Claudio Orlandi |
| 2022 | CCS | Laconic Private Set-Intersection From Pairings. | Diego F. Aranha, Chuanwei Lin, Claudio Orlandi, Mark Simkin |
| 2022 | CRYPTO | An Algebraic Framework for Silent Preprocessing with Trustless Setup and Active Security. | Damiano Abram, Ivan Damgrd, Claudio Orlandi, Peter Scholl |
| 2022 | EuroCrypt | Fiat-Shamir Bulletproofs are Non-Malleable (in the Algebraic Group Model). | Chaya Ganesh, Claudio Orlandi, Mahak Pancholi, Akira Takahashi, Daniel Tschudi |
| 2022 | PKC | ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines. | Diego F. Aranha, Emil Madsen Bennedsen, Matteo Campanelli, Chaya Ganesh, Claudio Orlandi, Akira Takahashi |
| 2022 | PKC | On the Bottleneck Complexity of MPC with Correlated Randomness. | Claudio Orlandi, Divya Ravi, Peter Scholl |
| 2022 | SP | Low-Bandwidth Threshold ECDSA via Pseudorandom Correlation Generators. | Damiano Abram, Ariel Nof, Claudio Orlandi, Peter Scholl, Omer Shlomovits |
| 2022 | SCN | On Access Control Encryption Without Sanitization. | Cecilia Boschini, Ivan Damgrd, Claudio Orlandi |
| 2022 | SCN | Zero-Knowledge for Homomorphic Key-Value Commitments with Applications to Privacy-Preserving Ledgers. | Matteo Campanelli, Felix Engelmann, Claudio Orlandi |
| 2021 | ESORICS | Virtual ASICs: Generalized Proof-of-Stake Mining in Cryptocurrencies. | Chaya Ganesh, Claudio Orlandi, Daniel Tschudi, Aviv Zohar |
| 2021 | EuroCrypt | The Rise of Paillier: Homomorphic Secret Sharing and Public-Key Silent OT. | Claudio Orlandi, Peter Scholl, Sophia Yakoubov |
| 2021 | PKC | Two-Round n-out-of-n and Multi-signatures and Trapdoor Commitment from Lattices. | Ivan Damgrd, Claudio Orlandi, Akira Takahashi, Mehdi Tibouchi |
| 2021 | SP | Refresh When You Wake Up: Proactive Threshold Wallets with Offline Devices. | Yashvanth Kondi, Bernardo Magri, Claudio Orlandi, Omer Shlomovits |
| 2020 | CRYPTO | Black-Box Transformations from Passive to Covert Security with Public Verifiability. | Ivan Damgrd, Claudio Orlandi, Mark Simkin |
| 2020 | ESORICS | Securing DNSSEC Keys via Threshold ECDSA from Generic MPC. | Anders P. K. Dalskov, Claudio Orlandi, Marcel Keller, Kris Shrishak, Haya Schulmann |
| 2020 | EuroCrypt | Security of Hedged Fiat-Shamir Signatures Under Fault Attacks. | Diego F. Aranha, Claudio Orlandi, Akira Takahashi, Greg Zaverucha |
| 2020 | SCN | Secure Generalized Deduplication via Multi-Key Revealing Encryption. | Daniel E. Lucani, Lars Nielsen, Claudio Orlandi, Elena Pagnin, Rasmus Vestergaard |
| 2020 | TCC | Stronger Security and Constructions of Multi-designated Verifier Signatures. | Ivan Damgrd, Helene Haagh, Rebekah Mercer, Anca Nitulescu, Claudio Orlandi, Sophia Yakoubov |
| 2019 | ASIACRYPT | Quisquis: A New Design for Anonymous Cryptocurrencies. | Prastudy Fauzi, Sarah Meiklejohn, Rebekah Mercer, Claudio Orlandi |
| 2019 | CRYPTO | Proofs of Replicated Storage Without Timing Assumptions. | Ivan Damgrd, Chaya Ganesh, Claudio Orlandi |
| 2019 | EuroCrypt | Proof-of-Stake Protocols for Privacy-Aware Blockchains. | Chaya Ganesh, Claudio Orlandi, Daniel Tschudi |
| 2019 | SAGT | Sharing Information with Competitors. | Simina Brnzei, Claudio Orlandi, Guang Yang |
| 2018 | CCS | Can You Trust Your Encrypted Cloud?: An Assessment of SpiderOakONE's Security. | Anders P. K. Dalskov, Claudio Orlandi |
| 2018 | CRYPTO | Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings. | Ivan Damgrd, Claudio Orlandi, Mark Simkin |
| 2018 | SCN | Combining Private Set-Intersection with Secure Two-Party Computation. | Michele Ciampi, Claudio Orlandi |
| 2017 | CCS | 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 |
| 2017 | PKC | Access Control Encryption for Equality, Comparison, and More. | Georg Fuchsbauer, Romain Gay, Lucas Kowalczyk, Claudio Orlandi |
| 2016 | CCS | On the CCA (in)Security of MTProto. | Jakob Jakobsen, Claudio Orlandi |
| 2016 | TCC | Access Control Encryption: Enforcing Information Flow with Cryptography. | Ivan Damgrd, Helene Haagh, Claudio Orlandi |
| 2016 | TCC | Cross and Clean: Amortized Garbled Circuits with Constant Overhead. | Jesper Buus Nielsen, Claudio Orlandi |
| 2015 | EuroCrypt | Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge. | Tore Kasper Frederiksen, Jesper Buus Nielsen, Claudio Orlandi |
| 2015 | FC | Privacy-Enhancing Overlays in Bitcoin. | Sarah Meiklejohn, Claudio Orlandi |
| 2014 | CCS | A Framework for Outsourcing of Secure Computation. | Thomas P. Jakobsen, Jesper Buus Nielsen, Claudio Orlandi |
| 2014 | SCN | Publicly Auditable Secure Multi-Party Computation. | Carsten Baum, Ivan Damgrd, Claudio Orlandi |
| 2014 | SCN | Obfuscation ⇒ (IND-CPA Security !⇒ Circular Security). | Antonio Marcedone, Claudio Orlandi |
| 2014 | TCC | Statistical Concurrent Non-malleable Zero Knowledge. | Claudio Orlandi, Rafail Ostrovsky, Vanishree Rao, Amit Sahai, Ivan Visconti |
| 2013 | ASIACRYPT | Hiding the Input-Size in Secure Two-Party Computation. | Yehuda Lindell, Kobbi Nissim, Claudio Orlandi |
| 2013 | CCS | Zero-knowledge using garbled circuits: how to prove non-algebraic statements efficiently. | Marek Jawurek, Florian Kerschbaum, Claudio Orlandi |
| 2013 | EuroCrypt | MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions. | Tore Kasper Frederiksen, Thomas Pelle Jakobsen, Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi |
| 2013 | TCC | On the Power of Correlated Randomness in Secure Computation. | Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, Claudio Orlandi, Anat Paskin-Cherniavsky |
| 2012 | ASIACRYPT | Calling Out Cheaters: Covert Security with Public Verifiability. | Gilad Asharov, Claudio Orlandi |
| 2012 | CRYPTO | A New Approach to Practical Active-Secure Two-Party Computation. | Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, Sai Sheshank Burra |
| 2011 | ASIACRYPT | Lower and Upper Bounds for Deniable Public-Key Encryption. | Rikke Bendlin, Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi |
| 2011 | EuroCrypt | Semi-homomorphic Encryption and Multiparty Computation. | Rikke Bendlin, Ivan Damgrd, Claudio Orlandi, Sarah Zakarias |
| 2011 | ICASSP | Is multiparty computation any good in practice? | Claudio Orlandi |
| 2010 | ASIACRYPT | On Invertible Sampling and Adaptive Security. | Yuval Ishai, Abishek Kumarasubramanian, Claudio Orlandi, Amit Sahai |
| 2010 | CRYPTO | Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost. | Ivan Damgrd, Claudio Orlandi |
| 2010 | TCC | On the Necessary and Sufficient Assumptions for UC Computation. | Ivan Damgrd, Jesper Buus Nielsen, Claudio Orlandi |
| 2009 | TCC | LEGO for Two-Party Secure Computation. | Jesper Buus Nielsen, Claudio Orlandi |
| 2008 | ICISC | Essentially Optimal Universally Composable Oblivious Transfer. | Ivan Damgrd, Jesper Buus Nielsen, Claudio Orlandi |
| 2008 | SEC | Enhancing Privacy in Remote Data Classification. | Alessandro Piva, Claudio Orlandi, Michele Caini, Tiziano Bianchi, Mauro Barni |