Zobrazeno 1 - 10
of 110
pro vyhledávání: '"Tal Malkin"'
Autor:
Alex Nicita, Tal Malkin, Ghada Almashaqbeh, Seungwook Han, Eran Tromer, Fabrice Benhamouda, Abhishek Shah, Tal Rabin, Daniel Jaroslawicz
Publikováno v:
Proceedings on Privacy Enhancing Technologies, Vol 2021, Iss 4, Pp 528-548 (2021)
Existing models for non-interactive MPC cannot provide full privacy for inputs, because they inherently leak the residual function (i.e., the output of the function on the honest parties’ input together with all possible values of the adversarial i
Publikováno v:
Computer Security – ESORICS 2022 ISBN: 9783031171390
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6094ef67e94c860149c102b5746948a3
https://doi.org/10.1007/978-3-031-17140-6_11
https://doi.org/10.1007/978-3-031-17140-6_11
Publikováno v:
Theory of Cryptography ISBN: 9783031223648
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::72aad0fa1af66e9ef20dfa487f8fb024
https://doi.org/10.1007/978-3-031-22365-5_25
https://doi.org/10.1007/978-3-031-22365-5_25
Autor:
Ghada Almashaqbeh, Ran Canetti, Yaniv Erlich, Jonathan Gershoni, Tal Malkin, Itsik Pe’er, Anna Roitburd-Berman, Eran Tromer
Publikováno v:
Advances in Cryptology – EUROCRYPT 2022 ISBN: 9783031069437
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::30fa4fc16709eff585b2f1aa379b2839
https://doi.org/10.1007/978-3-031-06944-4_26
https://doi.org/10.1007/978-3-031-06944-4_26
Publikováno v:
Theory of Cryptography ISBN: 9783030643775
TCC (2)
TCC (2)
Topology-hiding broadcast (THB) enables parties communicating over an incomplete network to broadcast messages while hiding the topology from within a given class of graphs. THB is a central tool underlying general topology-hiding secure computation
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::739d0b7f4de48834dfc79c6be31d7d2f
https://doi.org/10.1007/978-3-030-64378-2_17
https://doi.org/10.1007/978-3-030-64378-2_17
Publikováno v:
Advances in Cryptology – CRYPTO 2020 ISBN: 9783030568764
CRYPTO (3)
CRYPTO (3)
We present the first explicit construction of a non-malleable code that can handle tampering functions that are bounded-degree polynomials. Prior to our work, this was only known for degree-1 polynomials (affine tampering functions), due to Chattopad
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b38bd72e579e5328ad67fc641ca15b8b
https://doi.org/10.1007/978-3-030-56877-1_4
https://doi.org/10.1007/978-3-030-56877-1_4
Publikováno v:
nnovations in Theoretical Computer Science Conference, ITCS 2020
Garbling schemes, also known as decomposable randomized encodings (DRE), have found many applications in cryptography. However, despite a large body of work on constructing such schemes, very little is known about their limitations. We initiate a sys
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7b5157b06a02313a3feab3455185c5fa
Autor:
Tal Malkin, Chris Peikert
The four-volume set, LNCS 12825, LNCS 12826, LNCS 12827, and LNCS 12828, constitutes the refereed proceedings of the 41st Annual International Cryptology Conference, CRYPTO 2021. Crypto has traditionally been held at UCSB every year, but due to the C
Publikováno v:
Designs, Codes and Cryptography. 86:641-663
We give a new black-box transformation from any semantically secure encryption scheme into a non-malleable one which has a better rate than the best previous work of Coretti et al. (in: Kushilevitz and Malkin (eds) TCC 2016-A, Part I, Springer, Heide