Kamu erişimi zorunlu olan makaleler - Samuel RanellucciDaha fazla bilgi edinin
Hiçbir yerde sunulmuyor: 1
The crypto-democracy and the trustworthy (position paper)
S Gambs, S Ranellucci, A Tapp
International Workshop on Data Privacy Management, 58-76, 2014
Zorunlu olanlar: National Natural Science Foundation of China, Danish Council for Independent …
Bir yerde sunuluyor: 17
Global-scale secure multiparty computation
X Wang, S Ranellucci, J Katz
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications …, 2017
Zorunlu olanlar: US National Science Foundation, US Department of Defense
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
Zorunlu olanlar: European Commission
Authenticated Garbling and Communication-Efficient, Constant-Round, Secure Two-Party Computation.
J Katz, S Ranellucci, X Wang
IACR Cryptol. ePrint Arch. 2017, 30, 2017
Zorunlu olanlar: US National Science Foundation
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
Zorunlu olanlar: European Commission
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
Zorunlu olanlar: US National Science Foundation, US Department of Defense
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
Zorunlu olanlar: US Department of Defense
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
Zorunlu olanlar: US National Science Foundation, US Department of Defense
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
Zorunlu olanlar: Swiss National Science Foundation
Reactive garbling: Foundation, instantiation, application
JB Nielsen, S Ranellucci
Advances in Cryptology–ASIACRYPT 2016: 22nd International Conference on the …, 2016
Zorunlu olanlar: European Commission
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
Zorunlu olanlar: Danish Council for Independent Research, Danish National Research Foundation …
Resource-efficient OT combiners with active security
I Cascudo, I Damgård, O Farràs, S Ranellucci
Theory of Cryptography Conference, 461-486, 2017
Zorunlu olanlar: US National Science Foundation, Danish Council for Independent Research …
Generalizing efficient multiparty computation
BM David, R Nishimaki, S Ranellucci, A Tapp
International Conference on Information Theoretic Security, 15-32, 2015
Zorunlu olanlar: Danish Council for Independent Research, Danish National Research Foundation …
Efficient generic zero-knowledge proofs from commitments
S Ranellucci, A Tapp, R Zakarias
International Conference on Information Theoretic Security, 190-212, 2016
Zorunlu olanlar: Danish Council for Independent Research, Danish National Research Foundation …
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
Zorunlu olanlar: Danish Council for Independent Research, Danish National Research Foundation …
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
Zorunlu olanlar: US National Science Foundation, US Department of Defense
On the computational overhead of MPC with dishonest majority
JB Nielsen, S Ranellucci
IACR International Workshop on Public Key Cryptography, 369-395, 2017
Zorunlu olanlar: US National Science Foundation, European Commission
Efficient generic zero-knowledge proofs from commitments
S Ranellucci, A Tapp, RW Zakarias
Cryptology ePrint Archive, 2014
Zorunlu olanlar: Danish Council for Independent Research, Danish National Research Foundation …
Yayıncılık ve maddi kaynak bilgileri otomatik olarak bir bilgisayar programı tarafından belirlenmektedir