Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Samuel Ranellucci"'
Publikováno v:
Advances in Cryptology – EUROCRYPT 2022 ISBN: 9783031069437
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::91468fe5e1ac902d95b67de36d478cb5
https://doi.org/10.1007/978-3-031-06944-4_7
https://doi.org/10.1007/978-3-031-06944-4_7
Publikováno v:
CCS
We construct new protocols for two parties to securely compute on the items in their intersection. Our protocols make use of an untrusted third party that has no input. The use of this party allows us to construct highly efficient protocols that are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e2263039cc6c5d1a146e9ae222944090
https://doi.org/10.1145/3319535.3345661
https://doi.org/10.1145/3319535.3345661
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319968773
CRYPTO (3)
CRYPTO (3)
Wang et al. (CCS 2017) recently proposed a protocol for malicious secure two-party computation that represents the state-of-the-art with regard to concrete efficiency in both the single-execution and amortized settings, with or without preprocessing.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::783f644c0c6bab7db3c9e2c387450ee6
https://doi.org/10.1007/978-3-319-96878-0_13
https://doi.org/10.1007/978-3-319-96878-0_13
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030033316
ASIACRYPT (3)
ASIACRYPT (3)
We construct new four-party protocols for secure computation that are secure against a single malicious corruption. Our protocols can perform computations over a binary ring, and require sending just 1.5 ring elements per party, per gate. In the spec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cf7a9d10c1c14fcbe92021b10b3c63e6
https://doi.org/10.1007/978-3-030-03332-3_3
https://doi.org/10.1007/978-3-030-03332-3_3
Publikováno v:
CCS
We propose a new, constant-round protocol for multi-party computation of boolean circuits that is secure against an arbitrary number of malicious corruptions. At a high level, we extend and generalize recent work of Wang et al. in the two-party setti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d16fb9d02ef78cd4ef8c6056178f2f5a
https://doi.org/10.1145/3133956.3133979
https://doi.org/10.1145/3133956.3133979
Publikováno v:
CCS
We propose a simple and efficient framework for obtaining efficient constant-round protocols for maliciously secure two-party computation. Our framework uses a function-independent preprocessing phase to generate authenticated information for the two
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::58288ad83b57e357bd5ce1de7dddc3c1
https://doi.org/10.1145/3133956.3134053
https://doi.org/10.1145/3133956.3134053
Publikováno v:
Theory of Cryptography ISBN: 9783319705026
TCC (2)
TCC (2)
An OT-combiner takes n candidate implementations of the oblivious transfer (OT) functionality, some of which may be faulty, and produces a secure instance of oblivious transfer as long as a large enough number of the candidates are secure. We see an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::069800f94a3bf5e4dee3dfaf2ffc53e2
https://doi.org/10.1007/978-3-319-70503-3_15
https://doi.org/10.1007/978-3-319-70503-3_15
Publikováno v:
Advances in Cryptology – CRYPTO 2017-37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20–24, 2017, Proceedings, Part I
Advances in Cryptology – CRYPTO 2017 ISBN: 9783319636870
CRYPTO (1)
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – CRYPTO 2017
Advances in Cryptology – CRYPTO 2017 ISBN: 9783319636870
CRYPTO (1)
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – CRYPTO 2017
We propose a new protocol, nicknamed TinyTable, for maliciously secure 2-party computation in the preprocessing model. One version of the protocol is useful in practice and allows, for instance, secure AES encryption with latency about 1 ms and amort
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::73e9d568a54f62a6e709c40c83335cc1
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319491745
ICITS
ICITS
Even though zero-knowledge has existed for more than 30 years, few generic and efficient constructions for zero-knowledge exist. In this paper, we present a new kind of commitment scheme on which we can build a novel and efficient zero-knowledge prot
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::99d79575ea94aa88a6afc1d69c60aaaa
https://doi.org/10.1007/978-3-319-49175-2_10
https://doi.org/10.1007/978-3-319-49175-2_10
Autor:
Samuel Ranellucci, Jesper Buus Nielsen
Publikováno v:
Advances in Cryptology – ASIACRYPT 2016 ISBN: 9783662538890
ASIACRYPT (2)
ASIACRYPT (2)
Garbled circuits is a cryptographic technique, which has been used among other things for the construction of two and three-party secure computation, private function evaluation and secure outsourcing. Garbling schemes is a primitive which formalizes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a58dffe0cfdc76d3ca131b3d7f37f8c1
https://doi.org/10.1007/978-3-662-53890-6_34
https://doi.org/10.1007/978-3-662-53890-6_34