Tal Malkin
#97,023
Most Influential Person Now
Israeli-American cryptographer
Tal Malkin's AcademicInfluence.com Rankings
Tal Malkincomputer-science Degrees
Computer Science
#5543
World Rank
#5853
Historical Rank
Database
#3101
World Rank
#3232
Historical Rank
Download Badge
Computer Science
Tal Malkin's Degrees
- Masters Computer Science Weizmann Institute of Science
Similar Degrees You Can Earn
Why Is Tal Malkin Influential?
(Suggest an Edit or Addition)According to Wikipedia, Tal Geula Malkin is an Israeli-American cryptographer who works as a professor of computer science at Columbia University, where she heads the Cryptography Lab and the Data Science Institute Cybersecurity Center.
Tal Malkin's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks (extended version) (2009) (898)
- BiTR: Built-in Tamper Resilience (2011) (586)
- Protecting data privacy in private information retrieval schemes (1998) (548)
- Public Key Cryptography - PKC 2006 (2006) (257)
- Blind Seer: A Scalable Private DBMS (2014) (247)
- Efficient Communication-Storage Tradeoffs for Multicast Encryption (1999) (237)
- Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware Tampering (2004) (218)
- Efficient robust private set intersection (2009) (204)
- On the Capacity of Secure Network Coding (2004) (204)
- Secure multiparty computation of approximations (2001) (199)
- The relationship between public key encryption and oblivious transfer (2000) (195)
- Efficient Generic Forward-Secure Signatures with an Unbounded Number Of Time Periods (2002) (185)
- Secure two-party computation in sublinear (amortized) time (2012) (169)
- Single Database Private Information Retrieval Implies Oblivious Transfer (2000) (167)
- Topics in Cryptology - CT-RSA 2008, The Cryptographers' Track at the RSA Conference 2008, San Francisco, CA, USA, April 8-11, 2008. Proceedings (2008) (147)
- A Comparative Cost/Security Analysis of Fault Attack Countermeasures (2006) (128)
- Reducing the Servers’ Computation in Private Information Retrieval: PIR with Preprocessing (2004) (121)
- Reputation Systems for Anonymous Networks (2008) (120)
- LP Decoding Corrects a Constant Fraction of Errors (2004) (118)
- Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces (2012) (113)
- On the impossibility of basing trapdoor functions on trapdoor predicates (2001) (105)
- Signatures Resilient to Continual Leakage on Memory and Computation (2011) (101)
- Secure anonymous database search (2009) (89)
- A Random Server Model for Private Information Retrieval or How to Achieve Information Theoretic PIR Avoiding Database Replication (1998) (88)
- A block cipher based pseudo random number generator secure against side-channel key recovery (2008) (87)
- The Hierarchy of Key Evolving Signatures and a Characterization of Proxy Signatures (2004) (81)
- Malicious-Client Security in Blind Seer: A Scalable Private DBMS (2015) (80)
- Towards a Separation of Semantic and CCA Security for Public Key Encryption (2007) (70)
- Improved Non-committing Encryption with Applications to Adaptively Secure Protocols (2009) (69)
- The All-or-Nothing Nature of Two-Party Secure Computation (1999) (68)
- Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing (2000) (66)
- Cryptographic strength of ssl/tls servers: current and recent practices (2007) (66)
- One-way functions are essential for single-server private information retrieval (1999) (63)
- Simple, Black-Box Constructions of Adaptively Secure Protocols (2009) (62)
- Efficient Circuit-Size Independent Public Key Encryption with KDM Security (2011) (60)
- Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One (2008) (54)
- Mercurial Commitments with Applications to Zero-Knowledge Sets (2005) (54)
- Collaborative Distributed Intrusion Detection (2004) (54)
- Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits (2016) (50)
- Garbling Gadgets for Boolean and Arithmetic Circuits (2016) (49)
- On the Black-Box Complexity of Optimally-Fair Coin Tossing (2011) (49)
- Order-Preserving Encryption Secure Beyond One-Wayness (2014) (42)
- On the performance, feasibility, and use of forward-secure signatures (2003) (41)
- On Adaptive vs. Non-adaptive Security of Multiparty Protocols (2001) (36)
- Generalized Environmental Security from Number Theoretic Assumptions (2006) (35)
- A Formal Practice-Oriented Model for the Analysis of Side-Channel Attacks (2006) (34)
- Adaptive versus Non-Adaptive Security of Multi-Party Protocols (2004) (32)
- Garbled Neural Networks are Practical (2019) (31)
- Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments (2013) (30)
- Private search in the real world (2011) (29)
- Computational Extractors and Pseudorandomness (2012) (28)
- A Quantitative Approach to Reductions in Secure Computation (2004) (28)
- Non-Malleable Codes for Small-Depth Circuits (2018) (27)
- Non-Malleable Codes from Average-Case Hardness: AC0, Decision Trees, and Streaming Space-Bounded Tampering (2017) (27)
- Can Optimally-Fair Coin Tossing Be Based on One-Way Functions? (2014) (26)
- The Power of Negations in Cryptography (2015) (26)
- Secure Efficient Multiparty Computing of Multivariate Polynomials and Applications (2011) (24)
- Usable, Secure, Private Search (2012) (23)
- A Simple Obfuscation Scheme for Pattern-Matching with Wildcards (2018) (23)
- Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (2017) (22)
- Two-Party Computing with Encrypted Data (2007) (22)
- A Random Server Model for Private Information Retrieval (or Information Theoretic PIR Avoiding Database Replication (1997) (21)
- Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction (2013) (20)
- A Block Cipher based PRNG Secure Against Side-Channel Key Recovery (2007) (20)
- Anonymity in Wireless Broadcast Networks (2009) (19)
- WAR: Wireless Anonymous Routing (2003) (18)
- Non-malleable Codes from Average-Case Hardness: $${\mathsf {A}}{\mathsf {C}}^0$$ , Decision Trees, and Streaming Space-Bounded Tampering (2018) (17)
- Non-Malleable Codes Against Bounded Polynomial Time Tampering (2019) (15)
- Optimal Cryptographic Hardness of Learning Monotone Functions (2008) (15)
- Secure Multi-party Computation Minimizing Online Rounds (2009) (13)
- A study of secure database access and general two-party computation (2000) (13)
- A Black-Box Construction of Non-malleable Encryption from Semantically Secure Encryption (2017) (12)
- Lower Bounds for Oblivious Near-Neighbor Search (2019) (12)
- Hardness of Non-Interactive Differential Privacy from One-Way Functions (2018) (11)
- Oblivious Transfer (1997) (11)
- Two Party Distribution Testing: Communication and Security (2018) (9)
- Learning, cryptography, and the average case (2010) (9)
- How Should We Solve Search Problems Privately? (2007) (9)
- Strong Hardness of Privacy from Weak Traitor Tracing (2016) (9)
- The power of the dinur-nissim algorithm: breaking privacy of statistical and graph databases (2012) (9)
- Public Key Cryptography - PKC 2006: 9th International Conference on Theory and Practice in Public-Key Cryptography, New York, NY, USA, April 24-26, 2006. ... (Lecture Notes in Computer Science) (2006) (9)
- Exploring the Boundaries of Topology-Hiding Computation (2018) (8)
- Secure Computation with Sublinear Amortized Work (2011) (8)
- Protocols for anonymity in wireless networks (2003) (7)
- On the Complexity of Decomposable Randomized Encodings, Or: How Friendly Can a Garbling-Friendly PRF Be? (2020) (7)
- Public key cryptography - PKC 2006 : 9th International Conference on Theory and Practice in Public Key Cryptography, New York, NY, USA, April 24-26, 2006 : proceedings (2006) (7)
- Private multiparty sampling and approximation of vector combinations (2007) (7)
- Composition and Efficiency Tradeoffs for Forward-Secure Digital Signatures (2001) (6)
- Gage MPC: Bypassing Residual Function Leakage for Non-Interactive MPC (2021) (6)
- Randomness Extraction from Somewhat Dependent Sources (2019) (6)
- Public-Key Function-Private Hidden Vector Encryption (and More) (2019) (5)
- Oblivious Image Matching (2009) (5)
- Key dependent message security: recent results and applications (2011) (5)
- 2014 IEEE Symposium on Security and Privacy, SP 2014, Berkeley, CA, USA, May 18-21, 2014 (2014) (5)
- Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology (2008) (4)
- Improved, black-box, non-malleable encryption from semantic security (2018) (4)
- Privacy Preserving Pattern Classification (2008) (4)
- Mitigating the One-Use Restriction in Attribute-Based Encryption (2018) (4)
- Theory of cryptography : 13th international conference, TCC 2016-A Tel Aviv, Israel, January 10-13, 2016 : proceedings (2016) (3)
- In Pursuit of Clarity In Obfuscation (2019) (3)
- Does Physical Security of Cryptographic Devices Need a Formal Study? (Invited Talk) (2008) (3)
- To BLISS-B or not to be : attacking strong Swan ' s implementation of post-quantum signatures (2018) (3)
- The Whole is Greater than the Sum of its Parts: Linear Garbling and Applications (2015) (3)
- Efficient distributed 1 out of n oblivious transfer (1997) (3)
- Prote ting Data Priva y in Private Information RetrievalS hemes (2007) (2)
- Improved, black-box, non-malleable encryption from semantic security (2017) (2)
- Secure Computation for Big Data (2013) (2)
- Non-Malleability against Polynomial Tampering (2020) (2)
- Adaptive and Concurrent Secure Computation from New Notions of Non-Malleability (2011) (2)
- Topology-Hiding Communication from Minimal Assumptions (2020) (2)
- Is Information-Theoretic Topology-Hiding Computation Possible? (2019) (2)
- Secure Multiparty Computation of Approximations (Extended Abstract) (2001) (2)
- Limits to Non-Malleability (2019) (2)
- A Black-Box Construction of Non-malleable Encryption from Semantically Secure Encryption (2017) (1)
- Ideal Lattices and Ntru (2013) (1)
- Money for Nothing and Privacy for Free (2011) (1)
- Mercurial Commitments with Applications to Zero-Knowledge Sets (2012) (1)
- Theory of Cryptography (2016) (1)
- Eecient Communication-storage Tradeoos for Multicast Encryption (2007) (0)
- Session details: Session 2B (2006) (0)
- Sis-based Signatures (2013) (0)
- WAR: Wireless Anonymous Routing. Commentary. Authors' reply (2005) (0)
- Applied cryptography and network security : 13th International conference, ACNS 2015 New York, NY, USA, June 2-5, 2015 : revised selected papers (2015) (0)
- Learning with Errors (lwe) (2013) (0)
- Obfuscation from Polynomial Hardness: Beyond Decomposable Obfuscation (2018) (0)
- Trade-offs in Private Search (2010) (0)
- Minimalist Cryptography : Excerpt from an NSF Proposal (2016) (0)
- ProSiBIR: Proactive Signer-Base Intrusion Resilient Signatures (2007) (0)
- Special Section on the Fifty-First Annual IEEE Symposium on Foundations of Computer Science (FOCS 2010) (2014) (0)
- D S ] 9 A pr 2 01 9 Lower Bounds for Oblivious Near-Neighbor Search (2019) (0)
- Session details: Session 4B (2006) (0)
- Lwe-based Homomorphic Encryption (2013) (0)
- Unclonable Polymers and Their Cryptographic Applications (2022) (0)
- Amortized Sublinear Secure Multi Party Computation (2011) (0)
- Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography (2006) (0)
- Lattices and Homomorphic Encryption, Spring 2013 2 Proof Sketch of Lemma 1 (2013) (0)
- Poly Onions: Achieving Anonymity in the Presence of Churn (2022) (0)
- Session details: Session 7B (2006) (0)
- New Lower Bounds for Di ff erential Privacy : How Low Can You Go ? ( Terrible Working Title ) (2017) (0)
- Summary of Lecture on Secret Sharing (2019) (0)
- Applied Cryptography and Network Security (2015) (0)
- Communication complexity with defective randomness (2021) (0)
- Linear Threshold Secret-Sharing with Binary Reconstruction (2021) (0)
- Lecture Notes on Secret Sharing (2016) (0)
- XSPIR: Efficient Symmetrically Private Information Retrieval from Ring-LWE (2022) (0)
- On adaptive security and round efficiency in secure multi-party computation (2010) (0)
This paper list is powered by the following services:
Other Resources About Tal Malkin
What Schools Are Affiliated With Tal Malkin?
Tal Malkin is affiliated with the following schools:
