Samuel Ranellucci
Cited by
Cited by
Global-scale secure multiparty computation
X Wang, S Ranellucci, J Katz
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications …, 2017
Authenticated Garbling and Communication-Efficient, Constant-Round, Secure Two-Party Computation.
J Katz, S Ranellucci, X Wang
IACR Cryptol. ePrint Arch. 2017, 30, 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
Optimizing authenticated garbling for faster secure two-party computation
J Katz, S Ranellucci, M Rosulek, X Wang
Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology …, 2018
Secure computation with low communication from cross-checking
SD Gordon, S Ranellucci, X Wang
Advances in Cryptology–ASIACRYPT 2018: 24th International Conference on the …, 2018
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
On the Efficiency of Bit Commitment Reductions.
S Ranellucci, A Tapp, S Winkler, J Wullschleger
ASIACRYPT, 520-537, 2011
Secure parallel computation on national scale volumes of data
S Mazloom, PH Le, S Ranellucci, SD Gordon
Proceedings of the 29th USENIX Conference on Security Symposium, 2487-2504, 2020
Reactive garbling: Foundation, instantiation, application
JB Nielsen, S Ranellucci
Advances in Cryptology–ASIACRYPT 2016: 22nd International Conference on the …, 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: 14th International Conference, TCC 2016-B, Beijing …, 2016
System and method for deterministic signing of a message using a multi-party computation (MPC) process
S Ranellucci, Y Lindell
US Patent 10,833,871, 2020
Resource-efficient OT combiners with active security
I Cascudo, I Damgård, O Farràs, S Ranellucci
Theory of Cryptography: 15th International Conference, TCC 2017, Baltimore …, 2017
Generalizing efficient multiparty computation
BM David, R Nishimaki, S Ranellucci, A Tapp
Information Theoretic Security: 8th International Conference, ICITS 2015 …, 2015
Efficient generic zero-knowledge proofs from commitments
S Ranellucci, A Tapp, R Zakarias
Information Theoretic Security: 9th International Conference, ICITS 2016 …, 2016
On the computational overhead of MPC with dishonest majority
JB Nielsen, S Ranellucci
Public-Key Cryptography–PKC 2017: 20th IACR International Conference on …, 2017
Security of linear secret-sharing schemes against mass surveillance
I Giacomelli, RF Olimid, S Ranellucci
Cryptology and Network Security: 14th International Conference, CANS 2015 …, 2015
System and method for performing key operations during a multi-party computation process
S Ranellucci
US Patent App. 16/945,948, 2022
Best of both worlds in secure computation, with low communication overhead
D Genkin, SD Gordon, S Ranellucci
Applied Cryptography and Network Security: 16th International Conference …, 2018
Efficient generic zero-knowledge proofs from commitments
S Ranellucci, A Tapp, RW Zakarias
Cryptology ePrint Archive, 2014
Highly efficient ot-based multiplication protocols
I Haitner, N Makriyannis, S Ranellucci, E Tsfadia
Advances in Cryptology–EUROCRYPT 2022: 41st Annual International Conference …, 2022
The system can't perform the operation now. Try again later.
Articles 1–20