Остановите войну!
for scientists:
default search action
Tal Malkin
- > Home > Persons > Tal Malkin
Publications
- 2023
- [j17]Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran:
Topology-Hiding Communication from Minimal Assumptions. J. Cryptol. 36(4): 39 (2023) - 2022
- [c80]Marshall Ball, Oded Goldreich, Tal Malkin:
Randomness Extraction from Somewhat Dependent Sources. ITCS 2022: 12:1-12:14 - 2021
- [c78]Marshall Ball, Alper Çakan, Tal Malkin:
Linear Threshold Secret-Sharing with Binary Reconstruction. ITC 2021: 12:1-12:22 - [c77]Marshall Ball, Oded Goldreich, Tal Malkin:
Communication Complexity with Defective Randomness. CCC 2021: 14:1-14:10 - [i53]Marshall Ball, Alper Çakan, Tal Malkin:
Linear Threshold Secret-Sharing with Binary Reconstruction. Electron. Colloquium Comput. Complex. TR21 (2021) - [i51]Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran:
Topology-Hiding Communication from Minimal Assumptions. IACR Cryptol. ePrint Arch. 2021: 388 (2021) - 2020
- [c76]Marshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin, Li-Yang Tan:
Non-malleability Against Polynomial Tampering. CRYPTO (3) 2020: 97-126 - [c75]Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin:
Limits to Non-Malleability. ITCS 2020: 80:1-80:32 - [c74]Marshall Ball, Justin Holmgren, Yuval Ishai, Tianren Liu, Tal Malkin:
On the Complexity of Decomposable Randomized Encodings, Or: How Friendly Can a Garbling-Friendly PRF Be? ITCS 2020: 86:1-86:22 - [c72]Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran:
Topology-Hiding Communication from Minimal Assumptions. TCC (2) 2020: 473-501 - [i50]Marshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin, Li-Yang Tan:
Non-Malleability against Polynomial Tampering. Electron. Colloquium Comput. Complex. TR20 (2020) - [i49]Marshall Ball, Oded Goldreich, Tal Malkin:
Communication Complexity with Defective Randomness. Electron. Colloquium Comput. Complex. TR20 (2020) - [i48]Marshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin, Li-Yang Tan:
Non-Malleability against Polynomial Tampering. IACR Cryptol. ePrint Arch. 2020: 147 (2020) - 2019
- [c70]Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Huijia Lin, Tal Malkin:
Non-Malleable Codes Against Bounded Polynomial Time Tampering. EUROCRYPT (1) 2019: 501-530 - [c68]Marshall Ball, Elette Boyle, Ran Cohen, Tal Malkin, Tal Moran:
Is Information-Theoretic Topology-Hiding Computation Possible? TCC (1) 2019: 502-530 - [i46]Marshall Ball, Oded Goldreich, Tal Malkin:
Randomness Extraction from Somewhat Dependent Sources. Electron. Colloquium Comput. Complex. TR19 (2019) - [i43]Marshall Ball, Brent Carmer, Tal Malkin, Mike Rosulek, Nichole Schimanski:
Garbled Neural Networks are Practical. IACR Cryptol. ePrint Arch. 2019: 338 (2019) - [i41]Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin:
Limits to Non-Malleability. IACR Cryptol. ePrint Arch. 2019: 449 (2019) - [i38]Marshall Ball, Elette Boyle, Ran Cohen, Tal Malkin, Tal Moran:
Is Information-Theoretic Topology-Hiding Computation Possible? IACR Cryptol. ePrint Arch. 2019: 1094 (2019) - 2018
- [c65]Marshall Ball, Elette Boyle, Tal Malkin, Tal Moran:
Exploring the Boundaries of Topology-Hiding Computation. EUROCRYPT (3) 2018: 294-325 - [c64]Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin:
Non-malleable Codes from Average-Case Hardness: $${\mathsf {A}}{\mathsf {C}}^0$$ , Decision Trees, and Streaming Space-Bounded Tampering. EUROCRYPT (3) 2018: 618-650 - [c63]Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan:
Non-Malleable Codes for Small-Depth Circuits. FOCS 2018: 826-837 - [i37]Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan:
Non-Malleable Codes for Small-Depth Circuits. CoRR abs/1802.07673 (2018) - [i35]Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan:
Non-Malleable Codes for Small-Depth Circuits. Electron. Colloquium Comput. Complex. TR18 (2018) - [i34]Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan:
Non-Malleable Codes for Small-Depth Circuits. IACR Cryptol. ePrint Arch. 2018: 207 (2018) - [i31]Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Huijia Lin, Tal Malkin:
Non-Malleable Codes Against Bounded Polynomial Time Tampering. IACR Cryptol. ePrint Arch. 2018: 1015 (2018) - 2017
- [i29]Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin:
Non-Malleable Codes from Average-Case Hardness: AC0, Decision Trees, and Streaming Space-Bounded Tampering. IACR Cryptol. ePrint Arch. 2017: 1061 (2017) - 2016
- [c60]Marshall Ball, Tal Malkin, Mike Rosulek:
Garbling Gadgets for Boolean and Arithmetic Circuits. CCS 2016: 565-577 - [c59]Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin:
Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits. EUROCRYPT (2) 2016: 881-908 - [i26]Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin:
Non-Malleable Codes for Bounded Depth, Bounded Fan-in Circuits. IACR Cryptol. ePrint Arch. 2016: 307 (2016) - [i22]Marshall Ball, Tal Malkin, Mike Rosulek:
Garbling Gadgets for Boolean and Arithmetic Circuits. IACR Cryptol. ePrint Arch. 2016: 969 (2016)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-21 17:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint