Tal Malkin

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 68

Top Venues

IACR Cryptol. ePrint Arch.

Electron. Colloquium Comput. Complex.

CoRR

ITCS

Massachusetts Institute of Technology, Cambridge, MA, USA (PHD)

Education History

Massachusetts Institute of Technology, Cambridge, MA, USA

PHD

Publications

Amos Beimel, Tal Malkin, Noam Mazor
Structural Lower Bounds on Black-Box Constructions of Pseudorandom Functions. IACR Cryptol. ePrint Arch. 2024 (2024)
Amos Beimel, Tal Malkin, Noam Mazor
Structural Lower Bounds on Black-Box Constructions of Pseudorandom Functions. CRYPTO (5) (2024)
Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran
Topology-Hiding Communication from Minimal Assumptions. J. Cryptol. 36 (4) (2023)
Chengyu Lin, Zeyu Liu, Tal Malkin
XSPIR: Efficient Symmetrically Private Information Retrieval from Ring-LWE. ESORICS (1) (2022)
Megumi Ando, Miranda Christ, Anna Lysyanskaya, Tal Malkin
Poly Onions: Achieving Anonymity in the Presence of Churn. TCC (2) (2022)
Megumi Ando, Miranda Christ, Anna Lysyanskaya, Tal Malkin
Poly Onions: Achieving Anonymity in the Presence of Churn. IACR Cryptol. ePrint Arch. 2022 (2022)
Marshall Ball, Oded Goldreich, Tal Malkin
Randomness Extraction from Somewhat Dependent Sources. ITCS (2022)
Ghada Almashaqbeh, Ran Canetti, Yaniv Erlich, Jonathan Gershoni, Tal Malkin, Itsik Pe'er, Anna Roitburd-Berman, Eran Tromer
Unclonable Polymers and Their Cryptographic Applications. IACR Cryptol. ePrint Arch. 2022 (2022)
Ghada Almashaqbeh, Ran Canetti, Yaniv Erlich, Jonathan Gershoni, Tal Malkin, Itsik Pe'er, Anna Roitburd-Berman, Eran Tromer
Unclonable Polymers and Their Cryptographic Applications. EUROCRYPT (1) (2022)
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 (2021)
Marshall Ball, Alper Çakan, Tal Malkin
Linear Threshold Secret-Sharing with Binary Reconstruction. Electron. Colloquium Comput. Complex. 28 (2021)
Ghada Almashaqbeh, Fabrice Benhamouda, Seungwook Han, Daniel Jaroslawicz, Tal Malkin, Alex Nicita, Tal Rabin, Abhishek Shah, Eran Tromer
Gage MPC: Bypassing Residual Function Leakage for Non-Interactive MPC. Proc. Priv. Enhancing Technol. 2021 (4) (2021)
Marshall Ball, Oded Goldreich, Tal Malkin
Communication Complexity with Defective Randomness. Computational Complexity Conference (2021)
Marshall Ball, Alper Çakan, Tal Malkin
Linear Threshold Secret-Sharing with Binary Reconstruction. ITC (2021)
Ghada Almashaqbeh, Fabrice Benhamouda, Seungwook Han, Daniel Jaroslawicz, Tal Malkin, Alex Nicita, Tal Rabin, Abhishek Shah, Eran Tromer
Gage MPC: Bypassing Residual Function Leakage for Non-Interactive MPC. IACR Cryptol. ePrint Arch. 2021 (2021)
Marshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin, Li-Yang Tan
Non-Malleability against Polynomial Tampering. Electron. Colloquium Comput. Complex. 27 (2020)
Marshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin, Li-Yang Tan
Non-Malleability against Polynomial Tampering. IACR Cryptol. ePrint Arch. 2020 (2020)
Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin
Limits to Non-Malleability. ITCS (2020)
Marshall Ball, Oded Goldreich, Tal Malkin
Communication Complexity with Defective Randomness. Electron. Colloquium Comput. Complex. 27 (2020)
Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran
Topology-Hiding Communication from Minimal Assumptions. TCC (2) (2020)
Kasper Green Larsen, Tal Malkin, Omri Weinstein, Kevin Yeo
Lower Bounds for Oblivious Near-Neighbor Search. SODA (2020)
Marshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin, Li-Yang Tan
Non-malleability Against Polynomial Tampering. CRYPTO (3) (2020)
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)
Marshall Ball, Brent Carmer, Tal Malkin, Mike Rosulek, Nichole Schimanski
Garbled Neural Networks are Practical. IACR Cryptol. ePrint Arch. 2019 (2019)
Alexandr Andoni, Tal Malkin, Negev Shekel Nosatzki
Two Party Distribution Testing: Communication and Security. ICALP (2019)
Marshall Ball, Elette Boyle, Ran Cohen, Tal Malkin, Tal Moran
Is Information-Theoretic Topology-Hiding Computation Possible? TCC (1) (2019)
Marshall Ball, Elette Boyle, Ran Cohen, Tal Malkin, Tal Moran
Is Information-Theoretic Topology-Hiding Computation Possible? IACR Cryptol. ePrint Arch. 2019 (2019)
James Bartusek, Brent Carmer, Abhishek Jain, Zhengzhong Jin, Tancrède Lepoint, Fermi Ma, Tal Malkin, Alex J. Malozemoff, Mariana Raykova
Public-Key Function-Private Hidden Vector Encryption (and More). IACR Cryptol. ePrint Arch. 2019 (2019)
Kasper Green Larsen, Tal Malkin, Omri Weinstein, Kevin Yeo
Lower Bounds for Oblivious Near-Neighbor Search. CoRR (2019)
Kasper Green Larsen, Tal Malkin, Omri Weinstein, Kevin Yeo
Lower Bounds for Oblivious Near-Neighbor Search. Electron. Colloquium Comput. Complex. 26 (2019)
Yuan Kang, Chengyu Lin, Tal Malkin, Mariana Raykova
Obfuscation from Polynomial Hardness: Beyond Decomposable Obfuscation. IACR Cryptol. ePrint Arch. 2019 (2019)
Kasper Green Larsen, Tal Malkin, Omri Weinstein, Kevin Yeo
Lower Bounds for Oblivious Near-Neighbor Search. IACR Cryptol. ePrint Arch. 2019 (2019)
Allison Bishop, Lucas Kowalczyk, Tal Malkin, Valerio Pastro, Mariana Raykova, Kevin Shi
In Pursuit of Clarity In Obfuscation. IACR Cryptol. ePrint Arch. 2019 (2019)
James Bartusek, Brent Carmer, Abhishek Jain, Zhengzhong Jin, Tancrède Lepoint, Fermi Ma, Tal Malkin, Alex J. Malozemoff, Mariana Raykova
Public-Key Function-Private Hidden Vector Encryption (and More). ASIACRYPT (3) (2019)
Marshall Ball, Oded Goldreich, Tal Malkin
Randomness Extraction from Somewhat Dependent Sources. Electron. Colloquium Comput. Complex. 26 (2019)
Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Huijia Lin, Tal Malkin
Non-Malleable Codes Against Bounded Polynomial Time Tampering. EUROCRYPT (1) (2019)
Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin
Limits to Non-Malleability. IACR Cryptol. ePrint Arch. 2019 (2019)
Alexandr Andoni, Tal Malkin, Negev Shekel Nosatzki
Two Party Distribution Testing: Communication and Security. CoRR (2018)
Allison Bishop, Lucas Kowalczyk, Tal Malkin, Valerio Pastro, Mariana Raykova, Kevin Shi
A Simple Obfuscation Scheme for Pattern-Matching with Wildcards. CRYPTO (3) (2018)
Alexandr Andoni, Tal Malkin, Negev Shekel Nosatzki
Two Party Distribution Testing: Communication and Security. IACR Cryptol. ePrint Arch. 2018 (2018)
Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan
Non-Malleable Codes for Small-Depth Circuits. Electron. Colloquium Comput. Complex. 25 (2018)
Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan
Non-Malleable Codes for Small-Depth Circuits. CoRR (2018)
Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan
Non-Malleable Codes for Small-Depth Circuits. IACR Cryptol. ePrint Arch. 2018 (2018)
Lucas Kowalczyk, Tal Malkin, Jonathan R. Ullman, Daniel Wichs
Hardness of Non-interactive Differential Privacy from One-Way Functions. CRYPTO (1) (2018)
Marshall Ball, Elette Boyle, Tal Malkin, Tal Moran
Exploring the Boundaries of Topology-Hiding Computation. EUROCRYPT (3) (2018)
Lucas Kowalczyk, Jiahui Liu, Tal Malkin, Kailash Meiyappan
Mitigating the One-Use Restriction in Attribute-Based Encryption. ICISC (2018)
Yuan Kang, Chengyu Lin, Tal Malkin, Mariana Raykova
Obfuscation from Polynomial Hardness: Beyond Decomposable Obfuscation. SCN (2018)
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)
Lucas Kowalczyk, Jiahui Liu, Tal Malkin, Kailash Meiyappan
Mitigating the One-Use Restriction in Attribute-Based Encryption. IACR Cryptol. ePrint Arch. 2018 (2018)
Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan
Non-Malleable Codes for Small-Depth Circuits. FOCS (2018)
Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee
A Black-Box Construction of Non-malleable Encryption from Semantically Secure Encryption. J. Cryptol. 31 (1) (2018)
Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Huijia Lin, Tal Malkin
Non-Malleable Codes Against Bounded Polynomial Time Tampering. IACR Cryptol. ePrint Arch. 2018 (2018)
Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee
Improved, black-box, non-malleable encryption from semantic security. Des. Codes Cryptogr. 86 (3) (2018)
Allison Bishop, Lucas Kowalczyk, Tal Malkin, Valerio Pastro, Mariana Raykova, Kevin Shi
A Simple Obfuscation Scheme for Pattern-Matching with Wildcards. IACR Cryptol. ePrint Arch. 2018 (2018)
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 (2017)
Lucas Kowalczyk, Tal Malkin, Jonathan R. Ullman, Daniel Wichs
Hardness of Non-Interactive Differential Privacy from One-Way Functions. IACR Cryptol. ePrint Arch. 2017 (2017)
Marshall Ball, Tal Malkin, Mike Rosulek
Garbling Gadgets for Boolean and Arithmetic Circuits. CCS (2016)
Lucas Kowalczyk, Tal Malkin, Jonathan R. Ullman, Mark Zhandry
Strong Hardness of Privacy from Weak Traitor Tracing. IACR Cryptol. ePrint Arch. 2016 (2016)
Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee
A Black-Box Construction of Non-Malleable Encryption from Semantically Secure Encryption. IACR Cryptol. ePrint Arch. 2016 (2016)
Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee
Improved, Black-Box, Non-Malleable Encryption from Semantic Security. IACR Cryptol. ePrint Arch. 2016 (2016)
Lucas Kowalczyk, Tal Malkin, Jonathan R. Ullman, Mark Zhandry
Strong Hardness of Privacy from Weak Traitor Tracing. CoRR (2016)
Marshall Ball, Tal Malkin, Mike Rosulek
Garbling Gadgets for Boolean and Arithmetic Circuits. IACR Cryptol. ePrint Arch. 2016 (2016)
Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin
Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits. EUROCRYPT (2) (2016)
Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin
Non-Malleable Codes for Bounded Depth, Bounded Fan-in Circuits. IACR Cryptol. ePrint Arch. 2016 (2016)
Lucas Kowalczyk, Tal Malkin, Jonathan R. Ullman, Mark Zhandry
Strong Hardness of Privacy from Weak Traitor Tracing. TCC (B1) (2016)
Siyao Guo, Tal Malkin, Igor Carboni Oliveira, Alon Rosen
The Power of Negations in Cryptography. TCC (1) (2015)
Igor Carboni Oliveira, Siyao Guo, Tal Malkin, Alon Rosen
The Power of Negations in Cryptography. Electron. Colloquium Comput. Complex. 22 (2015)
Ben A. Fisch, Binh Vo, Fernando Krell, Abishek Kumarasubramanian, Vladimir Kolesnikov, Tal Malkin, Steven M. Bellovin
Malicious-Client Security in Blind Seer: A Scalable Private DBMS. IEEE Symposium on Security and Privacy (2015)
Siyao Guo, Tal Malkin, Igor Carboni Oliveira, Alon Rosen
The Power of Negations in Cryptography. IACR Cryptol. ePrint Arch. 2014 (2014)
Dana Dachman-Soled, Mohammad Mahmoody, Tal Malkin
Can Optimally-Fair Coin Tossing Be Based on One-Way Functions? TCC (2014)
Lap Chi Lau, Tal Malkin, Ryan O'Donnell, Luca Trevisan
Special Section on the Fifty-First Annual IEEE Symposium on Foundations of Computer Science (FOCS 2010). SIAM J. Comput. 43 (1) (2014)
Ben Fisch, Binh Vo, Fernando Krell, Abishek Kumarasubramanian, Vladimir Kolesnikov, Tal Malkin, Steven M. Bellovin
Malicious-Client Security in Blind Seer: A Scalable Private DBMS. IACR Cryptol. ePrint Arch. 2014 (2014)
Vasilis Pappas, Fernando Krell, Binh Vo, Vladimir Kolesnikov, Tal Malkin, Seung Geol Choi, Wesley George, Angelos D. Keromytis, Steven M. Bellovin
Blind Seer: A Scalable Private DBMS. IEEE Symposium on Security and Privacy (2014)
Isamu Teranishi, Moti Yung, Tal Malkin
Order-Preserving Encryption Secure Beyond One-Wayness. ASIACRYPT (2) (2014)
S. Dov Gordon, Tal Malkin, Mike Rosulek, Hoeteck Wee
Multi-Party Computation of Polynomials and Branching Programs without Simultaneous Interaction. IACR Cryptol. ePrint Arch. 2013 (2013)
Melissa Chase, Alexander Healy, Anna Lysyanskaya, Tal Malkin, Leonid Reyzin
Mercurial Commitments with Applications to Zero-Knowledge Sets. J. Cryptol. 26 (2) (2013)
Tal Malkin
Secure Computation for Big Data. TCC (2013)
Tal Malkin, Isamu Teranishi, Moti Yung
Order-Preserving Encryption Secure Beyond One-Wayness. IACR Cryptol. ePrint Arch. 2013 (2013)
Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Muthuramakrishnan Venkitasubramaniam
Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments. ASIACRYPT (1) (2013)
S. Dov Gordon, Tal Malkin, Mike Rosulek, Hoeteck Wee
Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction. EUROCRYPT (2013)
Dana Dachman-Soled, Rosario Gennaro, Hugo Krawczyk, Tal Malkin
Computational Extractors and Pseudorandomness. TCC (2012)
Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Moti Yung
Efficient robust private set intersection. Int. J. Appl. Cryptogr. 2 (4) (2012)
Mariana Raykova, Ang Cui, Binh Vo, Bin Liu, Tal Malkin, Steven M. Bellovin, Salvatore J. Stolfo
Usable, Secure, Private Search. IEEE Secur. Priv. 10 (5) (2012)
Krzysztof Choromanski, Tal Malkin
The power of the dinur-nissim algorithm: breaking privacy of statistical and graph databases. PODS (2012)
S. Dov Gordon, Jonathan Katz, Vladimir Kolesnikov, Fernando Krell, Tal Malkin, Mariana Raykova, Yevgeniy Vahlis
Secure two-party computation in sublinear (amortized) time. CCS (2012)
Seung Geol Choi, Kyung-Wook Hwang, Jonathan Katz, Tal Malkin, Dan Rubenstein
Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces. CT-RSA (2012)
Tal Malkin, Isamu Teranishi, Moti Yung
Key dependent message security: recent results and applications. CODASPY (2011)
S. Dov Gordon, Jonathan Katz, Vladimir Kolesnikov, Tal Malkin, Mariana Raykova, Yevgeniy Vahlis
Secure Computation with Sublinear Amortized Work. IACR Cryptol. ePrint Arch. 2011 (2011)
Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Muthuramakrishnan Venkitasubramaniam
Adaptive and Concurrent Secure Computation from New Notions of Non-Malleability. IACR Cryptol. ePrint Arch. 2011 (2011)
Dana Dachman-Soled, Rosario Gennaro, Hugo Krawczyk, Tal Malkin
Computational Extractors and Pseudorandomness. IACR Cryptol. ePrint Arch. 2011 (2011)
Seung Geol Choi, Aggelos Kiayias, Tal Malkin
BiTR: Built-in Tamper Resilience. ASIACRYPT (2011)
Vasilis Pappas, Mariana Raykova, Binh Vo, Steven M. Bellovin, Tal Malkin
Private search in the real world. ACSAC (2011)
Tal Malkin, Isamu Teranishi, Moti Yung
Efficient Circuit-Size Independent Public Key Encryption with KDM Security. EUROCRYPT (2011)
Dana Dachman-Soled, Yehuda Lindell, Mohammad Mahmoody, Tal Malkin
On the Black-Box Complexity of Optimally-Fair Coin Tossing. TCC (2011)
Tal Malkin, Isamu Teranishi, Yevgeniy Vahlis, Moti Yung
Signatures Resilient to Continual Leakage on Memory and Computation. TCC (2011)
Seung Geol Choi, Kyung-Wook Hwang, Jonathan Katz, Tal Malkin, Dan Rubenstein
Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces. IACR Cryptol. ePrint Arch. 2011 (2011)
Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Moti Yung
Secure Efficient Multiparty Computing of Multivariate Polynomials and Applications. ACNS (2011)
Seung Geol Choi, Aggelos Kiayias, Tal Malkin
BiTR: Built-in Tamper Resilience. IACR Cryptol. ePrint Arch. 2010 (2010)
Tal Malkin, Isamu Teranishi, Yevgeniy Vahlis, Moti Yung
Signatures Resilient to Continual Leakage on Memory and Computation. IACR Cryptol. ePrint Arch. 2010 (2010)
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb
How Should We Solve Search Problems Privately? J. Cryptol. 23 (2) (2010)

Tal Malkin.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Tal Malkin