Takip et
Samuel Ranellucci
Samuel Ranellucci
Postdoc
cs.au.dk üzerinde doğrulanmış e-posta adresine sahip
Başlık
Alıntı yapanlar
Alıntı yapanlar
Yıl
Global-scale secure multiparty computation
X Wang, S Ranellucci, J Katz
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications …, 2017
2682017
Fast secure multiparty ECDSA with practical distributed key generation and applications to cryptocurrency custody
Y Lindell, A Nof
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications …, 2018
2542018
Authenticated Garbling and Communication-Efficient, Constant-Round, Secure Two-Party Computation.
J Katz, S Ranellucci, X Wang
IACR Cryptol. ePrint Arch. 2017, 30, 2017
248*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
102*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
682018
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
502018
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
472019
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
282020
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
212020
On the efficiency of bit commitment reductions
S Ranellucci, A Tapp, S Winkler, J Wullschleger
Advances in Cryptology–ASIACRYPT 2011: 17th International Conference on the …, 2011
152011
System and method for performing key operations during a multi-party computation process
S Ranellucci
US Patent 11,658,815, 2023
142023
Reactive garbling: Foundation, instantiation, application
JB Nielsen, S Ranellucci
Advances in Cryptology–ASIACRYPT 2016: 22nd International Conference on the …, 2016
11*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
102016
Resource-efficient OT combiners with active security
I Cascudo, I Damgård, O Farràs, S Ranellucci
Theory of Cryptography Conference, 461-486, 2017
9*2017
Highly efficient ot-based multiplication protocols
I Haitner, N Makriyannis, S Ranellucci, E Tsfadia
Annual International Conference on the Theory and Applications of …, 2022
82022
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
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
52015
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
32018
On the computational overhead of MPC with dishonest majority
JB Nielsen, S Ranellucci
IACR International Workshop on Public Key Cryptography, 369-395, 2017
32017
Sistem, işlemi şu anda gerçekleştiremiyor. Daha sonra yeniden deneyin.
Makaleler 1–20