Follow
Samuel Ranellucci
Title
Cited by
Cited by
Year
Global-scale secure multiparty computation
X Wang, S Ranellucci, J Katz
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications …, 2017
1492017
Authenticated Garbling and Communication-Efficient, Constant-Round, Secure Two-Party Computation.
J Katz, S Ranellucci, X Wang
IACR Cryptol. ePrint Arch. 2017, 30, 2017
134*2017
Gate-scrambling revisited-or: The TinyTable protocol for 2-party secure computation
I Damgård, JB Nielsen, M Nielsen, S Ranellucci
Cryptology ePrint Archive, 2016
58*2016
Secure computation with low communication from cross-checking
SD Gordon, S Ranellucci, X Wang
International Conference on the Theory and Application of Cryptology and …, 2018
262018
Optimizing authenticated garbling for faster secure two-party computation
J Katz, S Ranellucci, M Rosulek, X Wang
Annual International Cryptology Conference, 365-391, 2018
262018
On the efficiency of bit commitment reductions
S Ranellucci, A Tapp, S Winkler, J Wullschleger
International Conference on the Theory and Application of Cryptology and …, 2011
142011
Two-party private set intersection with an untrusted third party
PH Le, S Ranellucci, SD Gordon
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications …, 2019
122019
Secure parallel computation on national scale volumes of data
S Mazloom, PH Le, S Ranellucci, SD Gordon
29th USENIX Security Symposium (USENIX Security 20), 2487-2504, 2020
92020
Reactive garbling: Foundation, instantiation, application
JB Nielsen, S Ranellucci
International Conference on the Theory and Application of Cryptology and …, 2016
9*2016
Oblivious transfer from any non-trivial elastic noisy channel via secret key agreement
I Cascudo, I Damgård, F Lacerda, S Ranellucci
Theory of Cryptography Conference, 204-234, 2016
92016
Resource-efficient OT combiners with active security
I Cascudo, I Damgård, O Farràs, S Ranellucci
Theory of Cryptography Conference, 461-486, 2017
7*2017
Generalizing efficient multiparty computation
BM David, R Nishimaki, S Ranellucci, A Tapp
International Conference on Information Theoretic Security, 15-32, 2015
62015
GlobalGscale secure multiparty computation
W Xiao, S Ranellucci, J Katz
Proc of the 2017 ACM SIGSACConf. New York: ACM 3956, 2017
52017
Efficient generic zero-knowledge proofs from commitments
S Ranellucci, A Tapp, R Zakarias
International Conference on Information Theoretic Security, 190-212, 2016
52016
On the computational overhead of MPC with dishonest majority
JB Nielsen, S Ranellucci
IACR International Workshop on Public Key Cryptography, 369-395, 2017
42017
Security of linear secret-sharing schemes against mass surveillance
I Giacomelli, RF Olimid, S Ranellucci
International Conference on Cryptology and Network Security, 43-58, 2015
32015
Efficient generic zero-knowledge proofs from commitments
S Ranellucci, A Tapp, RW Zakarias
Cryptology ePrint Archive, 2014
32014
Best of both worlds in secure computation, with low communication overhead
D Genkin, SD Gordon, S Ranellucci
International Conference on Applied Cryptography and Network Security, 340-359, 2018
22018
The crypto-democracy and the trustworthy (position paper)
S Gambs, S Ranellucci, A Tapp
Data Privacy Management, Autonomous Spontaneous Security, and Security …, 2014
22014
Secure Two-Party Computation via Leaky Generalized Oblivious Transfer.
S Ranellucci, A Tapp
IACR Cryptol. ePrint Arch. 2013, 99, 2013
12013
The system can't perform the operation now. Try again later.
Articles 1–20