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
972017
Authenticated Garbling and Communication-Efficient, Constant-Round, Secure Two-Party Computation.
J Katz, S Ranellucci, X Wang
IACR Cryptol. ePrint Arch. 2017, 30, 2017
89*2017
Gate-scrambling Revisited-or: The TinyTable protocol for 2-Party Secure Computation.
I Damgård, JB Nielsen, M Nielsen, S Ranellucci
IACR Cryptol. ePrint Arch. 2016, 695, 2016
39*2016
Optimizing authenticated garbling for faster secure two-party computation
J Katz, S Ranellucci, M Rosulek, X Wang
Annual International Cryptology Conference, 365-391, 2018
202018
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
142018
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
102011
Reactive garbling: Foundation, instantiation, application
JB Nielsen, S Ranellucci
International Conference on the Theory and Application of Cryptology and …, 2016
9*2016
Generalizing efficient multiparty computation
BM David, R Nishimaki, S Ranellucci, A Tapp
International Conference on Information Theoretic Security, 15-32, 2015
62015
Efficient generic zero-knowledge proofs from commitments
S Ranellucci, A Tapp, R Zakarias
International Conference on Information Theoretic Security, 190-212, 2016
52016
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
42016
Resource-efficient OT combiners with active security
I Cascudo, I Damgård, O Farràs, S Ranellucci
Theory of Cryptography Conference, 461-486, 2017
32017
On the computational overhead of MPC with dishonest majority
JB Nielsen, S Ranellucci
IACR International Workshop on Public Key Cryptography, 369-395, 2017
32017
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, RW Zakarias
32014
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
22019
The crypto-democracy and the trustworthy (position paper)
S Gambs, S Ranellucci, A Tapp
Data Privacy Management, Autonomous Spontaneous Security, and Security …, 2014
22014
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
12018
Constant-round secure two-party computation from a linear number of oblivious transfer
S Ranellucci, A Tapp
Cryptology ePrint Archive, Report 2013/099, 2013. http://eprint. iacr. org …, 2013
12013
Secure Two-Party Computation via Leaky Generalized Oblivious Transfer.
S Ranellucci, A Tapp
IACR Cryptol. ePrint Arch. 2013, 99, 2013
12013
System and method for deterministic signing of a message using a multi-party computation (mpc) process
S Ranellucci, Y Lindell
US Patent App. 16/726,965, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–20