Homepage of Claudio Orlandi

About me

(Professional) Bio


Contact Info




I believe that all scientific publications should be freely available online, given that researcher and peer-reviewers are largely supported by public funding. Therefore I am committed to make all my papers availabe to the general public. If there is a paper of mine you would like to read but do not have access to, please write me and I will be happy to share a copy with you.

Statistical Concurrent Non-Malleable Zero Knowledge
Claudio Orlandi and Rafail Ostrovsky and Vanishree Rao and Amit Sahai and Ivan Visconti
TCC 2014. [ePrint].
Publicly Auditable Secure Multi-Party Computation
Carsten Baum and Ivan Damgård and Claudio Orlandi
Obfuscation ==> (IND-CPA Security =/=> Circular Security)
Antonio Marcedone, Claudio Orlandi
Hiding The Input Size in Secure Two-Party Computation
Yehuda Lindell, Kobbi Nissim, Claudio Orlandi
ASIACRYPT 2013. [ePrint]
Zero-Knowledge Using Garbled Circuits: How To Prove Non-Algebraic Statements Efficiently
Marek Jawurek and Florian Kerschbaum and Claudio Orlandi
ACM CCS 2013. [ePrint].
MiniLEGO: Efficient Secure Two-Party Computation From General Assumptions
Tore Frederiksen, Thomas P Jakobsen, Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi
EUROCRYPT 2013. [ePrint].
On the Power of Correlated Randomness in Secure Computation
Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, Claudio Orlandi, Anat Paskin-Cherniavsky,
TCC 2013. [draft].
Calling out Cheaters: Covert Security with Public Verifiability
Gilad Asharov, Claudio Orlandi
ASIACRYPT 2012. [ePrint].
A New Approach to Practical Active-Secure Two-Party Computation
Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, Sai Sheshank
CRYPTO 2012. [ePrint]. [arXiv].
Privacy-Aware Mechanism Design
Kobbi Nissim, Claudio Orlandi, Rann Smorodinsky
ACM Conference on Electronic Commerce 2012. [arXiv].
Lower and Upper Bounds for Deniable Public-Key Encryption
Rikke Bendlin, Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi
ASIACRYPT 2011. [ePrint].
First appeared as a preprint under the title "Receiver-deniable public-key encryption is impossible"
Is Multiparty Computation Any Good In Practice?
Claudio Orlandi
ICASSP 2011. [draft].
Semi-Homomorphic Encryption and Multiparty Computation
Rikke Bendlin, Ivan Damgård, Claudio Orlandi, Sarah Zakarias
EUROCRYPT 2011. [ePrint].
On Invertible Sampling and Adaptive Security
Yuval Ishai, Abhishek Kumarasubramanian, Claudio Orlandi, Amit Sahai
ASIACRYPT 2010. [draft].
Multiparty Computation for Dishonest Majority: from Passive to Active Security at Low Cost
Ivan Damgård, Claudio Orlandi
CRYPTO 2010. [ePrint].
On the Necessary and Sufficient Assumptions for UC Computation
Ivan Damgård, Jesper Buus Nielsen, Claudio Orlandi
TCC 2010. [ePrint].
LEGO for Two Party Secure Computation
Jesper Buus Nielsen, Claudio Orlandi
TCC 2009. [ePrint].
Essentially Optimal Universally Composable Oblivious Tranfer
Ivan Damgård, Jesper Buus Nielsen Claudio Orlandi
ICISC 2008. [ePrint].
Enhancing Privacy in Remote Data Classification
Alessandro Piva, Claudio Orlandi, Mauro Caini, Tiziano Bianchi, Mauro Barni
SEC 2008.
Oblivious Neural Network Computing from Homomorphic Encryption,
Claudio Orlandi, Alessandro Piva, Mauro Barni
EURASIP JIS, 2007, Special Issue on Signal Processing in the Encrypted Domain.
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, and Mauro Barni
SPIE Electronic Imaging 2006. Security, Steganography, and Watermarking of Multimedia Contents VIII.



Program Committee Member

Events, workshops, schools, ...


Last update:

Valid XHTML 1.0 Strict Valid CSS!