Boaz Barak
Computer Science researcher
Boaz Barak's AcademicInfluence.com Rankings
Download Badge
Computer Science
Boaz Barak's Degrees
- PhD Computer Science Weizmann Institute of Science
Similar Degrees You Can Earn
Why Is Boaz Barak Influential?
(Suggest an Edit or Addition)According to Wikipedia, Boaz Barak is an Israeli-American professor of computer science at Harvard University. Early life and education He graduated in 1999 with a B.Sc. in mathematics and computer science from Tel Aviv University. In 2004, he received his Ph.D. from the Weizmann Institute of Science with thesis Non-Black-Box Techniques in Cryptography under the supervision of Oded Goldreich. Barak was at the Institute for Advanced Study for two years from 2003 to 2005. He was an assistant professor in the computer science department of Princeton University from 2005 to 2010 and an associate professor from 2010 to 2011. From 2010 to 2016, he was a researcher at Microsoft's New England research laboratory. Since 2016, he is the Gordon McKay Professor of Computer Science in the Harvard John A. Paulson School of Engineering and Applied Sciences. He is a citizen of both Israel and the United States.
Boaz Barak's Published Works
Published Works
- Computational Complexity: A Modern Approach (2009) (2746)
- On the (im)possibility of obfuscating programs (2001) (1429)
- Deep double descent: where bigger models and more data hurt (2019) (548)
- Privacy, accuracy, and consistency too: a holistic solution to contingency table release (2007) (503)
- How to go beyond the black-box simulation barrier (2001) (486)
- Systematic comparison of single-cell and single-nucleus RNA-sequencing methods (2020) (368)
- Subexponential Algorithms for Unique Games and Related Problems (2010) (261)
- How to compress interactive communication (2010) (236)
- Protecting Obfuscation against Algebraic Attacks (2014) (230)
- Mice with Shank3 Mutations Associated with ASD and Schizophrenia Display Both Shared and Distinct Defects (2016) (225)
- Universally composable protocols with relaxed set-up assumptions (2004) (223)
- Universal arguments and their applications (2002) (213)
- Extracting randomness using few independent sources (2004) (198)
- Hypercontractivity, sum-of-squares proofs, and their applications (2012) (190)
- Toll-like receptor 3 inhibits memory retention and constrains adult hippocampal neurogenesis (2010) (189)
- A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem (2016) (180)
- Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method (2014) (176)
- Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors (2005) (169)
- Rounding Semidefinite Programming Hierarchies via Global Correlation (2011) (156)
- Constant-round coin-tossing with a man in the middle or realizing the shared random string model (2002) (154)
- Computational complexity and information asymmetry in financial products (2011) (150)
- Public-key cryptography from different assumptions (2010) (143)
- SGD on Neural Networks Learns Functions of Increasing Complexity (2019) (137)
- Fully Homomorphic Encryption and Post Quantum Cryptography (2010) (133)
- True Random Number Generators Secure in a Changing Environment (2003) (132)
- Sum-of-squares proofs and the quest toward optimal algorithms (2014) (129)
- Strict polynomial-time in simulation and extraction (2002) (125)
- Noisy tensor completion via the sum-of-squares hierarchy (2015) (122)
- Path-quality monitoring in the presence of adversaries (2008) (120)
- Secure Computation Without Authentication (2005) (119)
- Bounded Key-Dependent Message Security (2010) (117)
- Rounding sum-of-squares relaxations (2013) (116)
- Lower bounds for non-black-box zero knowledge (2003) (116)
- Computational Analogues of Entropy (2003) (115)
- Computational Complexity: ADVANCED TOPICS (2009) (114)
- 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction (2006) (113)
- Derandomization in Cryptography (2003) (113)
- How to play almost any mental game over the net - concurrent composition via super-polynomial simulation (2005) (113)
- Leftover Hash Lemma, Revisited (2011) (111)
- Resettably-sound zero-knowledge and its applications (2001) (111)
- Neurobiology of social behavior abnormalities in autism and Williams syndrome (2016) (108)
- Evidence for a Developmental Role for TLR4 in Learning and Memory (2012) (107)
- A model and architecture for pseudo-random generation with applications to /dev/random (2005) (105)
- Systematic comparative analysis of single cell RNA-sequencing methods (2019) (93)
- Concurrent Non-Malleable Zero Knowledge (2006) (83)
- Direct modulation of GFAP-expressing glia in the arcuate nucleus bi-directionally regulates feeding (2016) (82)
- ER Stress-Induced eIF2-alpha Phosphorylation Underlies Sensitivity of Striatal Neurons to Pathogenic Huntingtin (2014) (79)
- Computational Models (2011) (79)
- Merkle Puzzles Are Optimal - An O(n2)-Query Attack on Any Key Exchange from a Random Oracle (2009) (77)
- 2-source dispersers for $n^{o(1)}$ entropy, and Ramsey graphs beating the Frankl-Wilson construction (2012) (70)
- Making the Long Code Shorter (2012) (68)
- An Ultra-Sensitive Step-Function Opsin for Minimally Invasive Optogenetic Stimulation in Mice and Macaques (2020) (68)
- Friends and foes in synaptic transmission: the role of tomosyn in vesicle priming (2009) (67)
- A Probabilistic-Time Hierarchy Theorem for "Slightly Non-uniform" Algorithms (2002) (66)
- A zero-knowledge protocol for nuclear warhead verification (2014) (65)
- Neuronal deletion of Gtf2i, associated with Williams syndrome, causes behavioral and myelin alterations rescuable by a remyelinating drug (2019) (64)
- Opposing actions of environmental enrichment and Alzheimer's disease on the expression of hippocampal microRNAs in mouse models (2013) (59)
- Protocols and Lower Bounds for Failure Localization in the Internet (2008) (58)
- Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes (2010) (57)
- On Basing Lower-Bounds for Learning on Worst-Case Assumptions (2008) (56)
- The uniform hardcore lemma via approximate Bregman projections (2009) (56)
- On the (im)possibility of obfuscating programs : (Extended abstract) (2001) (55)
- Obfuscation for Evasive Functions (2014) (54)
- Highly ordered large-scale neuronal networks of individual cells - toward single cell to 3D nanowire intracellular interfaces. (2012) (54)
- Rounding Parallel Repetitions of Unique Games (2008) (54)
- Shank3 mutation in a mouse model of autism leads to changes in the S-nitroso-proteome and affects key proteins involved in vesicle release and synaptic function (2018) (53)
- Microglia roles in synaptic plasticity and myelination in homeostatic conditions and neurodevelopmental disorders (2019) (50)
- Sum of Squares Lower Bounds from Pairwise Independence (2015) (48)
- Non-black-box Techniques in Cryptography (2006) (47)
- Beating the random assignment on constraint satisfaction problems of bounded degree (2015) (47)
- (Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs (2018) (47)
- Neurobiology of social behavior abnormalities in autism and Williams syndrome. (2016) (46)
- Lower Bounds on Signatures From Symmetric Primitives (2007) (45)
- Williams syndrome (2020) (42)
- Toll-like receptors as developmental tools that regulate neurogenesis during development: an update (2014) (41)
- Tensor Prediction, Rademacher Complexity and Random 3-XOR (2015) (41)
- Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture (2018) (39)
- Strong Parallel Repetition Theorem for Free Projection Games (2009) (38)
- Protocol Initialization for the Framework of Universal Composability (2004) (37)
- On the Possibility of One-Message Weak Zero-Knowledge (2004) (35)
- Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation) (2018) (34)
- Revisiting Model Stitching to Compare Neural Representations (2021) (34)
- The proactive security toolkit and applications (1999) (33)
- Hopes, fears, and software obfuscation (2016) (33)
- On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction (2013) (31)
- Fractional Sylvester–Gallai theorems (2012) (29)
- Quantum entanglement, sum of squares, and the log rank conjecture (2017) (29)
- An Ultra-Sensitive Step-Function Opsin for Minimally Invasive Optogenetic Stimulation in Mice and Macaques (2020) (28)
- Limitations of Linear Cross-Entropy as a Measure for Quantum Advantage (2021) (27)
- Subsampling mathematical relaxations and average-case complexity (2009) (26)
- Making the long code shorter, with applications to the Unique Games Conjecture (2011) (25)
- Clock synchronization with faults and recoveries (extended abstract) (2000) (25)
- Tomosyn Expression Pattern in the Mouse Hippocampus Suggests Both Presynaptic and Postsynaptic Functions (2010) (24)
- Valuing instream and riparian aspects of stream restoration – A willingness to tax approach (2015) (21)
- Hidden Progress in Deep Learning: SGD Learns Parities Near the Computational Limit (2022) (20)
- Spoofing Linear Cross-Entropy Benchmarking in Shallow Quantum Circuits (2020) (20)
- Sum-of-Squares Meets Program Obfuscation, Revisited (2019) (19)
- Classical algorithms and quantum limitations for maximum cut on high-girth graphs (2021) (19)
- Computational Complexity and Information Asymmetry in Financial Products (Extended Abstract) (2010) (19)
- Dichotomous parvalbumin interneuron populations in dorsolateral and dorsomedial striatum (2018) (19)
- Sum of Squares Upper Bounds, Lower Bounds, and Open Questions (2014) (19)
- Molecular and Therapeutic Aspects of Hyperbaric Oxygen Therapy in Neurological Conditions (2020) (18)
- Neuron-Specific Expression of Tomosyn1 in the Mouse Hippocampal Dentate Gyrus Impairs Spatial Learning and Memory (2013) (18)
- A study of privacy and fairness in sensitive data analysis (2011) (18)
- Clock Synchronization with Faults and Recoveries ( Extended (2000) (16)
- The Complexity of Public-Key Cryptography (2017) (16)
- Cardiovascular Fitness and Cognitive Spatial Learning in Rodents and in Humans (2014) (15)
- Computational Complexity: Complexity of counting (2009) (15)
- For self-supervised learning, Rationality implies generalization, provably (2020) (13)
- Merkle’s Key Agreement Protocol is Optimal: An $$O(n^2)$$O(n2) Attack on Any Key Agreement from Random Oracles (2017) (12)
- White matter alterations in Williams syndrome related to behavioral and motor impairments (2020) (11)
- An Architecture for Robust Pseudo-Random Generation and Applications to /dev/random (2005) (11)
- Extractors and the Leftover Hash Lemma (2011) (11)
- Playing unique games on certified small-set expanders (2020) (11)
- Measuring Path Quality in the Presence of Adversaries : The Role of Cryptography in Network Accountability (2007) (10)
- MyelTracer: A Semi-Automated Software for Myelin g-Ratio Quantification (2021) (9)
- Differential excitatory vs inhibitory SCN expression at single cell level regulates brain sodium channel function in neurodevelopmental disorders. (2019) (8)
- Deconstructing Distributions: A Pointwise Framework of Learning (2022) (7)
- Structure vs Combinatorics in Computational Complexity (2014) (7)
- Direct Sums in Randomized Communication Complexity (2009) (7)
- Path-Quality Monitoring in the Presence of Adversaries: The Secure Sketch Protocols (2015) (7)
- Truth vs. Proof in Computational Complexity (2012) (7)
- Merkle Puzzles are Optimal (2008) (6)
- Systematic comparison of single-cell and single-nucleus RNA-sequencing methods (2020) (6)
- Named Tensor Notation (2021) (6)
- A Simple Explicit Construction of an $n^{\Tilde{O}(\log n)}$-Ramsey Graph (2006) (6)
- Behavioral aspects and neurobiological properties underlying medical cannabis treatment in Shank3 mouse model of autism spectrum disorder (2021) (6)
- Altered White Matter and microRNA Expression in a Murine Model Related to Williams Syndrome Suggests That miR-34b/c Affects Brain Development via Ptpru and Dcx Modulation (2022) (5)
- New perspectives on the complexity of computational learning, and other problems in theoretical computer science (2009) (5)
- Author Correction: Systematic comparison of single-cell and single-nucleus RNA-sequencing methods (2020) (5)
- Authenticating Nuclear Warheads With High Confidence (2014) (5)
- Provable Copyright Protection for Generative Models (2023) (4)
- miR-128 as a Regulator of Synaptic Properties in 5xFAD Mice Hippocampal Neurons (2021) (4)
- Optimizing testing policies for detecting COVID-19 outbreaks (2020) (4)
- Designing Protocols for Nuclear Warhead Verification (2015) (4)
- The Molecular Mechanisms Underlying Synaptic Transmission (2014) (3)
- A Cryptographic Study of Secure Internet Measurement Technical Report (2007) (3)
- Lecture 15-Zero Knowledge Proofs (2007) (3)
- Consideration for the impact of climate change information on stated preferences (2006) (3)
- Postnatal therapeutic approaches in genetic neurodevelopmental disorders (2020) (3)
- Theory of Cryptography (2014) (3)
- The relationship between public trust and perceived value of Israel's coastal areas with infrastructure: What is next to a beach matters (2019) (2)
- Designing Protocols for Nuclear Weapons Verification (2015) (2)
- Introduction to Homomorphic Encryption (2011) (2)
- Hyperbaric Oxygen Therapy Alleviates Social Behavior Dysfunction and Neuroinflammation in a Mouse Model for Autism Spectrum Disorders (2022) (2)
- Publisher Correction: Neuronal deletion of Gtf2i, associated with Williams syndrome, causes behavioral and myelin alterations rescuable by a remyelinating drug (2019) (2)
- Physical Public Templates for Nuclear Warhead Verification (2020) (2)
- Neuronal deletion of Gtf2i, associated with Williams syndrome, causes behavioral and myelin alterations rescuable by a remyelinating drug (2019) (2)
- Public-Key Cryptography from Different Assumptions (Extended Abstract) (2010) (2)
- Bayesianism , frequentism , and the planted clique , or do algorithms believe in unicorns ? (2016) (2)
- Computational Complexity: About this book (2009) (2)
- Subsampling Semidefinite Programs and Max-Cut on the Sphere (2009) (2)
- Resolving the Information Barrier Dilemma:Next Steps Towards Trusted Zero-Knowledge Nuclear Warhead Verification (2014) (2)
- Computational Complexity: Space complexity (2009) (2)
- Computer science should stay young (2016) (1)
- The Complexity of Public-Key Cryptograph (2017) (1)
- How to Play ANY Mental Game Over the Net Concurrently composable secure computation without setup assumptions (2005) (1)
- Toward a Secure Inspection System for Nuclear Warhead Verification Without Information Barrier (2013) (1)
- Hopes, Fears and Software Obfuscation: A Survey (2016) (1)
- Lecture 4 - Computational Indistinguishability, Pseudorandom Generators (2005) (1)
- Computational Complexity: NP and NP completeness (2009) (1)
- On Higher-Order Cryptography (Long Version) (2020) (1)
- A Cryptographic Study of Secure Fault Detection in the Internet ∗ (2007) (1)
- Technical Perspective: A breakthrough in software obfuscation (2016) (1)
- Fully Homomorphic Encryption-Part II Instructor : (0)
- Answering Many Queries with Dierential Privacy (2011) (0)
- Subexponential Algorithms for U G and Related Problems (2010) (0)
- Merkle’s Key Agreement Protocol is Optimal: An O(n2)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(n^2)$$\end{docum (2016) (0)
- Proof vs. Truth in Computational Complexity (2012) (0)
- Lecture 22: More obfuscation, exotic encryptions (2016) (0)
- Lecture Notes 4: UOWHF from any One-Way Function (2008) (0)
- Computational Complexity: Interactive proofs (2009) (0)
- Lecture 18 - Secret Sharing, Visual Cryptography, Distributed Signatures (2005) (0)
- Editorial Board (2009) (0)
- Lecture 6: Chosen Ciphertext Security (2016) (0)
- Lattices Part II — Dual Lattices , Fourier Transform , Smoothing Parameter , Public Key Encryption (2008) (0)
- Computational Complexity: Circuit lower bounds: Complexity theory's Waterloo (2009) (0)
- Lecture 11: Concrete candidates for public key crypto (2016) (0)
- Contrasting social behavior abnormalities in ASD and WS Autism spectrum disorders (2016) (0)
- Environmental Economic Approach for Resolving the Environmental Crisis in Jerusalem’s Kidron River Basin (2012) (0)
- COS 522 : Complexity Theory : Boaz Barak Handout 10 : Parallel Repetition Lemma Reading : ( 1 ) A Parallel Repetition Theorem (2007) (0)
- Computational Complexity: Derandomization (2009) (0)
- Lecture 13-Digital Signatures (2007) (0)
- S tructure vs C ombinatorics in C omputational C omplexity (2014) (0)
- Lecture 22 — Homomorphic Encryption 4 : Construction of fully homomorphic encryption (2010) (0)
- Lecture 16: Fully homomorphic encryption : Construction (2016) (0)
- Advanced Complexity Theory May 12 th Lecture (2015) (0)
- Lecture 5: Pseudorandom functions from pseudorandom generators (2016) (0)
- Lecture 10: Public key cryptography (2016) (0)
- Replica Method for the Machine Learning Theorist (2021) (0)
- Toll-like receptors as developmental tools that regulate neurogenesis during development : an update Citation (2014) (0)
- Computational Complexity: PCP theorem and hardness of approximation: An introduction (2009) (0)
- Williams Syndrome: A Genetic Disorder That Causes People to Be Too Friendly (2020) (0)
- Computational Complexity: Proof complexity (2009) (0)
- COS 522: Assumed Knowledge (2006) (0)
- Lecture 13 -basic Number Theory (2010) (0)
- Lecture 20: Quantum computing and cryptography II (2016) (0)
- Computational Complexity: Decision trees (2009) (0)
- Lecture 14 - Zero Knowledge (2005) (0)
- Lecture 18: Multiparty secure computation: Construction using Fully Homomorphic Encryption (2016) (0)
- On Higher-Order Cryptography (2020) (0)
- Computational Complexity: Introduction (2009) (0)
- Convexity, Bayesianism, and the Quest Towards Optimal Algorithms (Invited Talk) (2015) (0)
- DRAFT ii (1993) (0)
- Towards securing interdomain routing on the internet (2009) (0)
- Computational Complexity: Randomized computation (2009) (0)
- Witness Indistinguishable Proofs and Constant Round Zero Knowledge (2006) (0)
- Lecture 16 - Digital Signatures (2005) (0)
- Computational Complexity: Bibliography (2009) (0)
- Lecture 14 - CCA Security (2007) (0)
- Unique Games and Small Set Expansion (0)
- Computational Complexity: The computational model – and why it doesn't matter (2009) (0)
- Rounding sum-of-squares relaxations Citation (2013) (0)
- Special Issue “Conference on Computational Complexity 2012” Guest editors’ foreword (2013) (0)
- Computational Complexity: Appendix: Mathematical background (2009) (0)
- Lecture 14: Zero knowledge proofs (2016) (0)
- An integrality gap for the planted clique problem (0)
- Handout 1 : Mathematical Background (2007) (0)
- Fully Homomorphic Encryption - Part II (2011) (0)
- Computational Complexity: Communication complexity (2009) (0)
- In individuals with Williams syndrome, dysregulation of methylation in non-coding regions of neuronal and oligodendrocyte DNA is associated with pathology and cortical development (2022) (0)
- SOS and the unit sphere: Sparse vectors, tensor decomposition, dictionary learning, and quantum separability (0)
- Computational Complexity: Why are circuit lower bounds so difficult? (2009) (0)
- Computational Complexity: Average case complexity: Levin's theory (2009) (0)
- The Unique Games and Sum of Squares: A love hate relation- ship (0)
- Lecture 19: Quantum computing and cryptography I (2016) (0)
- Lecture 15 - Digital Signatures (2010) (0)
- Resettably-Sound Zero-Knowledge and its Applications ( preliminary version ) (2001) (0)
- Computational Complexity: The polynomial hierarchy and alternations (2009) (0)
- Neuron-Specific Expression of Tomosyn1 in the Mouse Hippocampal Dentate Gyrus Impairs Spatial Learning and Memory (2013) (0)
- Lecture 8: Key derivation, protecting passwords, slow hashes, Merkle trees (2016) (0)
- Derandomization in Cryptography The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters (2007) (0)
- Lecture 12-Digital Signatures (2007) (0)
- Lecture 17-Diffie-Hellman key exchange, pairing, Identity-Based Encryption and Forward Security (2007) (0)
- Lecture 12: Lattice based crypto (2016) (0)
- C C ] 1 6 N ov 2 01 4 Hypercontractivity , Sum-of-Squares Proofs , and their Applications (2014) (0)
- Special Issue “Conference on Computational Complexity 2012” Guest editors’ foreword (2013) (0)
- The Complexity of Public-Key Cryptography Boaz Barak April 27 , 2017 (2017) (0)
- STOC 2013: Call for Workshop and Tutorial Proposals Workshop and Tutorial Day: Saturday, June 1, 2013 (2013) (0)
- Mathematisches Forschungsinstitut Oberwolfach Proving Hard-core Predicates Using List Decoding Proving Integrality Gaps without Knowing the Linear Program How to Go beyond the Black-box Simulation Barrier Derandomization in Cryptography Formula Caching Proof Systems Algebras of Minimal Rank over Arb (2003) (0)
- Computational Complexity: Proofs of PCP theorems and the Fourier transform technique (2009) (0)
- Lectures 11–12 - One Way Permutations, Goldreich Levin Theorem, Commitments (2010) (0)
- Lecture 15: Fully homomorphic encryption : Introduction and bootstrapping (2016) (0)
- Computational Complexity: Diagonalization (2009) (0)
- Computational Complexity: Main theorems and definitions (2009) (0)
- Computational Complexity: Pseudorandom constructions: Expanders and extractors (2009) (0)
- Computational Complexity: Hardness amplification and error-correcting codes (2009) (0)
- Lecture 7: Hash functions and random oracles (2016) (0)
- Computational Complexity: Algebraic computation models (2009) (0)
- Studies in the efficiency and (versus) security of cryptographic tasks (2010) (0)
- 2 . 1 The Exponential Mechanism (2011) (0)
- Differential Privacy 2 a Bayesian Forumulation of Differential Privacy (2011) (0)
- SOS Lecture 6 : Dictionary Learning Via Sum of Squares Boaz Barak (2014) (0)
- Computational Complexity: Cryptography (2009) (0)
- Computational Complexity: Boolean circuits (2009) (0)
- Topic 6 : Sparsest Cut and the ARV Algorithm (2014) (0)
- Lecture 13: The handshake-establishing secure connections over insecure channels (2016) (0)
- Computational Complexity: Hints and selected exercises (2009) (0)
- Non-Black-Box Techniques in (2004) (0)
- Computational Complexity: Quantum computation (2009) (0)
- Publisher Correction: Neuronal deletion of Gtf2i, associated with Williams syndrome, causes behavioral and myelin alterations rescuable by a remyelinating drug (2019) (0)
- C C ] 21 M ay 2 01 2 Hypercontractivity , Sum-of-Squares Proofs , and their Applications (2018) (0)
- Author response: Direct modulation of GFAP-expressing glia in the arcuate nucleus bi-directionally regulates feeding (2016) (0)
- Computational Complexity: Notational conventions (2009) (0)
- Work with what you’ve got (2021) (0)
- Lecture 15 - Zero Knowledge (continued) (2005) (0)
This paper list is powered by the following services:
Other Resources About Boaz Barak
What Schools Are Affiliated With Boaz Barak?
Boaz Barak is affiliated with the following schools: