Filter Results:
- Full text PDF available (38)
Publication Year
2006
2018
- This year (4)
- Last 5 years (33)
- Last 10 years (47)
Publication Type
Co-author
Journals and Conferences
Data Set Used
Learn More
- Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, Sai Sheshank Burra
- IACR Cryptology ePrint Archive
- 2011
We propose a new approach to practical two-party computation secure against an active adversary. All prior practical protocols were based on Yao’s garbled circuits. We use an OT-based approach and… (More)
- Rikke Bendlin, Ivan Damgård, Claudio Orlandi, Sarah Zakarias
- IACR Cryptology ePrint Archive
- 2010
An additively-homomorphic encryption scheme enables us to compute linear functions of an encrypted input by manipulating only the ciphertexts. We define the relaxed notion of a semi-homomorphic… (More)
- Tore Kasper Frederiksen, Thomas P. Jakobsen, Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi
- IACR Cryptology ePrint Archive
- 2013
One of the main tools to construct secure two-party computation protocols are Yao garbled circuits. Using the cut-and-choose technique, one can get reasonably efficient Yao-based protocols with… (More)
- Jesper Buus Nielsen, Claudio Orlandi
- IACR Cryptology ePrint Archive
- 2008
This paper continues the recent line of work of making Yao’s garbled circuit approach to two-party computation secure against an active adversary. We propose a new cut-and-choose based approach… (More)
- Irene Giacomelli, Jesper Madsen, Claudio Orlandi
- IACR Cryptology ePrint Archive
- 2016
In this paper we describe ZKBoo1, a proposal for practically efficient zero-knowledge arguments especially tailored for Boolean circuits and report on a proof-ofconcept implementation. As an… (More)
- Mauro Barni, Claudio Orlandi, Alessandro Piva
- MM&Sec
- 2006
The problem of secure data processing by means of a neural network (NN) is addressed. Secure processing refers to the possibility that the NN owner does not get any knowledge about the processed data… (More)
Mechanism design deals with distributed algorithms that are executed with self-interested agents. The designer, whose objective is to optimize some function of the agents private types, needs to… (More)
- Melissa Chase, David Derler, +5 authors Gregory M. Zaverucha
- IACR Cryptology ePrint Archive
- 2017
We propose a new class of post-quantum digital signature schemes that: (a) derive their security entirely from the security of symmetric-key primitives, believed to be quantum-secure, and (b) have… (More)
- Marek Jawurek, Florian Kerschbaum, Claudio Orlandi
- IACR Cryptology ePrint Archive
- 2013
Zero-knowledge protocols are one of the fundamental concepts in modern cryptography and have countless applications. However, after more than 30 years from their introduction, there are only very few… (More)
- Ivan Damgård, Helene Haagh, Claudio Orlandi
- IACR Cryptology ePrint Archive
- 2016
We initiate the study of Access Control Encryption (ACE), a novel cryptographic primitive that allows fine-grained access control, by giving different rights to different users not only in terms of… (More)