Claudio Orlandi
Claudio Orlandi
Associate Professor, Department of Computer Science, Aarhus University, Denmark
Η διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα - Αρχική σελίδα
Παρατίθεται από
Παρατίθεται από
A new approach to practical active-secure two-party computation
J Nielsen, P Nordholt, C Orlandi, SS Burra
Advances in Cryptology–CRYPTO 2012, 681-700, 2012
Semi-homomorphic encryption and multiparty computation
R Bendlin, I Damgård, C Orlandi, S Zakarias
Annual International Conference on the Theory and Applications of …, 2011
LEGO for two-party secure computation
JB Nielsen, C Orlandi
Theory of Cryptography Conference, 368-386, 2009
Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives.
M Chase, D Derler, S Goldfeder, C Orlandi, S Ramacher, C Rechberger, ...
ACM Conference on Computer and Communications Security 2017 2017, 1825-1842, 2017
ZKBoo: Faster Zero-Knowledge for Boolean Circuits.
I Giacomelli, J Madsen, C Orlandi
USENIX Security Symposium 2016, 1069--1083, 2016
The simplest protocol for oblivious transfer
T Chou, C Orlandi
International Conference on Cryptology and Information Security in Latin …, 2015
A privacy-preserving protocol for neural-network-based computation
M Barni, C Orlandi, A Piva
Proceedings of the 8th workshop on Multimedia and security, 146-151, 2006
Oblivious neural network computing via homomorphic encryption
C Orlandi, A Piva, M Barni
EURASIP Journal on Information Security 2007, 1-11, 2007
Zero-Knowledge Using Garbled Circuits: How To Prove Non-Algebraic Statements Efficiently
M Jawurek, F Kerschbaum, C Orlandi
ACM Conference on Computer and Communications Security 2013, 955-966, 2013
Privacy-enhancing overlays in bitcoin
S Meiklejohn, C Orlandi
International Conference on Financial Cryptography and Data Security, 127-141, 2015
Publicly auditable secure multi-party computation
C Baum, I Damgård, C Orlandi
International Conference on Security and Cryptography for Networks, 175-196, 2014
MiniLEGO: Efficient Secure Two-Party Computation From General Assumptions
TK Frederiksen, TP Jakobsen, JB Nielsen, PS Nordholt, C Orlandi
Advances in Cryptology–EUROCRYPT 2013, 537-556, 2013
Privacy-aware mechanism design
K Nissim, C Orlandi, R Smorodinsky
Proceedings of the 13th ACM Conference on Electronic Commerce, 774-789, 2012
On the power of correlated randomness in secure computation
Y Ishai, E Kushilevitz, S Meldgaard, C Orlandi, A Paskin-Cherniavsky
Theory of Cryptography Conference, 600-620, 2013
Multiparty computation for dishonest majority: From passive to active security at low cost
I Damgård, C Orlandi
Annual cryptology conference, 558-576, 2010
Is multiparty computation any good in practice?
C Orlandi
2011 IEEE International Conference on Acoustics, Speech and Signal …, 2011
Privacy-Free Garbled Circuits with Applications To Efficient Zero-Knowledge
TK Frederiksen, JB Nielsen, C Orlandi
Cryptology ePrint Archive, Report 2014/598, 2014
Privatepool: Privacy-preserving ridesharing
P Hallgren, C Orlandi, A Sabelfeld
2017 IEEE 30th Computer Security Foundations Symposium (CSF), 276-291, 2017
Quisquis: A new design for anonymous cryptocurrencies
P Fauzi, S Meiklejohn, R Mercer, C Orlandi
International Conference on the Theory and Application of Cryptology and …, 2019
Combining private set-intersection with secure two-party computation
M Ciampi, C Orlandi
International Conference on Security and Cryptography for Networks, 464-482, 2018
Δεν είναι δυνατή η εκτέλεση της ενέργειας από το σύστημα αυτή τη στιγμή. Προσπαθήστε ξανά αργότερα.
Άρθρα 1–20