# Research

- Research Areas
- Impact Areas

2 Group Results matching all criteria

9 Project Results matching all criteria

#### Project

## Social Network Extraction from GPS Datasets with Coresets

We extract the underlying hidden relations from the given location-based datasets (e.g. GPS data) and we estimate (approximate) the hidden a social network in the data by using a particular data reduction algorithm (i.e., by using coresets).

#### Project

## Data Garbling: Computing on Encrypted Data

We are investigating the limits of computing on encrypted data, with a focus on the private outsourcing of computation over sensitive data.

#### Project

## Practical Secure Computation

Our goal is to bridge theory and practice to create infrastructure that allow computation and multi-party computation without compromising privacy.

## Danny Feldman

#### Project

## Towards Adversarially Robust Deep Neural Networks

We work towards a principled understanding of the non-robust nature of deep learning classifiers and build approaches to training reliably robust classifiers.

#### Project

## A new way of handling all-to-all broadcast

We design a new all-to-all broadcasts scheme with significantly less communication cost using aggregate signatures.

#### Project

## Return of the Byzantine Generals

This project studies new solutions to the Byzantine General Problem and its applications in distributed systems and cryptography.

#### Project

## Basing Cryptography on Structured Hardness

We aim to base a variety of cryptographic primitives on complexity theoretic assumptions. We focus on the assumption that there exist highly structured problems --- admitting so called "zero-knowledge" protocols --- that are nevertheless hard to compute

#### Project

## Random Graph with Applications in MPC

To explore how randomness in connectivity can improve the performance of secure multi-party computation (MPC) and the properties of communication graph to support MPC.

#### Project

## Privacy-Preserving Decentralized Optimization

To enable privacy preservation in decentralized optimization, differential privacy is the most commonly used approach. However, under such scenario, the trade-off between accuracy (even efficiency) and privacy is inevitable. In this project, distributed numerical optimization scheme incorporated with lightweight cryptographic information sharing are explored. The affect on the convergence rate from network topology is considered.

6 News Results matching all criteria

## Making it easier to program and protect the web

Professor Adam Chlipala builds tools to help programmers more quickly generate optimized, secure code.

## CSAIL hosts first-ever TEDxMIT

Speakers — all women — discuss everything from gravitational waves to robot nurses

## Automated cryptocode generator is helping secure the web

System automatically writes optimized algorithms to encrypt data in Google Chrome browsers and web applications.

## Holding law-enforcement accountable for electronic surveillance

CSAIL system encourages government transparency using cryptography on a public log of wiretap requests.

## Goldwasser, Micali, and Rivest win BBVA Foundation Frontiers of Knowledge Awards

This week it was announced that MIT professors and CSAIL principal investigators Shafi Goldwasser, Silvio Micali, Ronald Rivest, and former MIT professor Adi Shamir won this year’s BBVA Foundation Frontiers of Knowledge Awards in the Information and Communication Technologies category for their work in cryptography.

## Four from MIT named 2017 Association for Computer Machinery Fellows

Today four MIT faculty were named among the Association for Computer Machinery's 2017 Fellows for making “landmark contributions to computing.”

22 Group Results

#### Research Group

## Advanced Network Architecture Group

The challenge that motivates the ANA group is to foster a healthy future for the Internet. The interplay of private sector investment, public sector regulation and public interest advocacy, as well as the global diversity in drivers and aspirations, makes for an uncertain future.

#### Research Group

## Anyscale Learning for All ALFA

Our vision is data-driven machine learning systems that advance the quality of healthcare, the understanding of cyber arms races and the delivery of online education.

#### Research Group

## Applied Computing Group

We design software for high performance computing, develop algorithms for numerical linear algebra, and research random matrix theory and its applications.

#### Research Group

## Complexity Theory Group

Our interests span quantum complexity theory, barriers to solving P versus NP, theoretical computer science with a focus on probabilistically checkable proofs (PCP), pseudo-randomness, coding theory, and algorithms.

#### Research Group

## Computation and Biology

Our lab focuses on designing algorithms to gain biological insights from advances in automated data collection and the subsequent large data sets drawn from them.

#### Research Group

## Computation Structures Group

Our mission is fostering the creation and development of high-performance, reliable and secure computing systems that are easy to interact with.

#### Research Group

## Computational Connectomics Group

Our group’s goal is to create, based on such microscopic connectivity and functional data, new mathematical models explaining how neural tissue computes.

#### Research Group

## Cryptography and Information Security Group

#### Research Group

## Data Systems Group

We conduct research on all areas of database systems and information management.

#### Research Group

## Decentralized Information Group

We are investigating decentralized technologies that affect social change.

#### Research Group

## Geometric Data Processing Group

Our group studies geometric problems in computer graphics, computer vision, machine learning, optimization, and other disciplines.

#### Research Group

## Haystack Group

We are an interdisciplinary group of researchers blending approaches from human-computer interaction, social computing, databases, information management, and databases.

#### Research Center

## Internet Policy Research Initiative

Our mission is to work with policy makers and cybersecurity technologists to increase the trustworthiness and effectiveness of interconnected digital systems.

#### Research Group

## Multicore Algorithmics

We develop techniques for designing, implementing, and reasoning about multiprocessor algorithms, in particular concurrent data structures for multicore machines and the mathematical foundations of the computation models that govern their behavior.

#### Research Group

## Multimodal Understanding Group

Our objective is to build techniques, software, and hardware that enable natural interaction with

computation.

computation.

#### Research Group

## Quantum Information Science Group

Our research interests center around the capabilities and limits of quantum computers, and computational complexity theory more generally.

#### Research Group

## Software Design Group

Our goal is to find better ways to make software, and ways to make software better.

#### Research Group

## Supertech Research Group

We investigate the technologies that support scalable high-performance computing, including hardware, software, and theory.

#### Research Group

## Theory of Computation Group

Theory research at CSAIL covers a broad spectrum of topics, including algorithms, complexity theory, cryptography, distributed systems, parallel computing and quantum computing.

#### Research Group

## Theory of Distributed Systems Group

We work on a wide range of problems in distributed computing theory. We study algorithms and lower bounds for typical problems that arise in distributed systems---like resource allocation, implementing shared memory abstractions, and reliable communication.

74 Project Results

#### Project

## A new way of handling all-to-all broadcast

We design a new all-to-all broadcasts scheme with significantly less communication cost using aggregate signatures.

#### Project

## A Simplified and Extensible Cilk Runtime for Research

CilkS is a new runtime system for the Cilk multithreaded programming environment which makes it easy to experiment with new algorithms, data structures, and programming linguistics.

#### Project

## Active Learning of Models for Planning

We aim to develop a systematic framework for robots to build models of the world and to use these to make effective and safe choices of actions to take in complex scenarios.

#### Project

## Adversarial Cyber Security

Our goal is to understand the nature of cyber security arms races between malicious and bonafide parties. Our vision is autonomous cyber defenses that anticipate and take measures against counter attacks.

#### Project

## Algebraic Techniques for Algorithm Design

We work on improving the algorithms for algebraic problems like matrix multiplication, and using these to design algorithms for fundamental non-algebraic problems.

#### Project

## Algorithmic Aspects of Performance Engineering

The project concerns algorithmic solutions for writing fast codes.

#### Project

## Alloy

Alloy is a language for describing structures and a tool for exploring them. It has been used in a wide range of applications from finding holes in security mechanisms to designing telephone switching networks. Now one of the main challenges is to make the system more usable and understandable for the user.

#### Project

## An Algorithmic Theory of Brain Networks

We are developing an algorithmic theory for brain networks, based on simple synchronized stochastic graph-based neural network models.

#### Project

## Approximating the diameter of a directed graph

There is a family of approximation algorithms for computing the diameter of an undirected graph that give a time/accuracy trade-off and our goal is to extend these results to directed graphs.

#### Project

## Aspect-Augmented Adversarial Networks for Domain Adaptation

We propose a novel aspect-augmented adversarial network for cross-aspect and cross-domain adaptation tasks. The effectiveness of our approach suggests the potential application of adversarial networks to a broader range of NLP tasks for improved representation learning, such as machine translation and language generation.

#### Project

## Automated Attack Tree Generation for Critical Infrastructure

Using AI methods, we are developing an attack tree generator that automatically enumerates cyberattack vectors for industrial control systems in critical infrastructure (electric grids, water networks and transportation systems). The generator can quickly assess cyber risk for a system at scale.

#### Project

## Basing Cryptography on Structured Hardness

We aim to base a variety of cryptographic primitives on complexity theoretic assumptions. We focus on the assumption that there exist highly structured problems --- admitting so called "zero-knowledge" protocols --- that are nevertheless hard to compute

#### Project

## Bayesian Optimization for Global Optimization of Expensive Black-box Functions

We study the fundamentals of Bayesian optimization and develop efficient Bayesian optimization methods for global optimization of expensive black-box functions originated from a range of different applications.

#### Project

## Better Models for Ride-Sharing

Traffic is not just a nuisance for drivers: It’s also a public health hazard and bad news for the economy.

#### Project

## Bridging Theory and Practice in Shared-Memory Parallel Algorithm Design

This project aims to design parallel algorithms for shared-memory machines that are efficient both in theory and also in practice.

#### Project

## Coresets for Machine Learning Algorithms

Our goal is to design novel data compression techniques to accelerate popular machine learning algorithms in Big Data and streaming settings.

#### Project

## Data Civilizer

Data scientists universally report that they spend at least 80% of their time finding data sets of interest, accessing them, cleaning them and assembling them into a unified whole.

#### Project

## Data Garbling: Computing on Encrypted Data

We are investigating the limits of computing on encrypted data, with a focus on the private outsourcing of computation over sensitive data.

#### Project

## Database Design

The conventional wisdom described in all text books for performing database design is never followed in practice.

#### Project

## Deep Inverse Planning

Deep inverse planning for learning from high-dimensional demonstrations

#### Project

## Denial of Service Mitigation through Protocol Design

We aim to better understand the features of network protocols that facilitate denial of service attacks, in order to design more robust protocols and architectures in the future and evaluate existing designs more accurately.

#### Project

## Deterministic Algorithms for Robotic Task and Motion Planning

Our goal is to investigate deterministic algorithms for robotic task and motion planning.

#### Project

## Distributed Algorithms for Dynamic and Noisy Platforms

Distributed systems are now everywhere, for example, in wireless communication networks, distributed data-management systems, coordinated robots, transportation systems, and modern multiprocessors.

#### Project

## Distributed Co-prime Sampling Algorithms

To further parallelize co-prime sampling based sparse sensing, we introduce Diophantine Equation in different algebraic structures to build generalized lattice arrays.

With strong relationship to generalized Chinese Remainder Theorem, the geometry properties in the remainder code space, a special lattice space, are explored.

With strong relationship to generalized Chinese Remainder Theorem, the geometry properties in the remainder code space, a special lattice space, are explored.

48 People Results

## Andrea Lincoln

Graduate Student

## Slobodan Mitrovic

Postdoctoral Fellow

## William Moses

Graduate Student

## Vaikkunth Mugunthan

Graduate Student

## Shibani Santurkar

Graduate Student

## Joshua Tenenbaum

Professor

## Neil Thompson

Research Scientist

## Yu Wang

Graduate Student

## Hanshen Xiao

Graduate Student

## Longfei Zhou

Postdoctoral Fellow

72 News Results

## Daniel Weitzner named National Academy of Public Administration 2019 Fellow

Daniel Weitzner named National Academy of Public Administration 2019 Fellow

## Autonomous system improves environmental sampling at sea

Robotic boats could more rapidly locate the most valuable sampling spots in uncharted waters.

## Pushy robots learn the fundamentals of object manipulation

Systems “learn” from novel dataset that captures how pushed objects move, to improve their physical interactions with new objects.

## Deep learning with point clouds

Research aims to make it easier for self-driving cars, robotics, and other applications to understand the 3D world.

## Recovering “lost dimensions” of images and video

Model could recreate video from motion-blurred images and “corner cameras,” may someday retrieve 3D data from 2D medical images.

## MIT’s fleet of autonomous boats can now shapeshift

New capabilities allow “roboats” to change configurations to form pop-up bridges, stages, and other structures.

## Artificial intelligence could help data centers run far more efficiently

MIT system “learns” how to optimally allocate workloads across thousands of servers to cut costs, save energy.

## Why did my classifier just mistake a turtle for a rifle?

Two longtime friends explore how computer vision systems go awry.

## Making it easier to program and protect the web

Professor Adam Chlipala builds tools to help programmers more quickly generate optimized, secure code.

## Automated system generates robotic parts for novel tasks

When designing actuators involves too many variables for humans to test by hand, this system can step in.

## CSAIL hosts first-ever TEDxMIT

Speakers — all women — discuss everything from gravitational waves to robot nurses

## Drag-and-drop data analytics

System lets nonspecialists use machine-learning models to make predictions for medical research, sales, and more.

## Automated cryptocode generator is helping secure the web

System automatically writes optimized algorithms to encrypt data in Google Chrome browsers and web applications.

## Autonomous boats can target and latch onto each other

Fleet of “roboats” could collect garbage or self-assemble into floating structures in Amsterdam’s many canals.

## From one brain scan, more information for medical artificial intelligence

System helps machine-learning models glean training information for diagnosing and treating brain conditions Home Node From one brain scan, more information for medical artificial intelligence

## Q&A: Phillip Isola on the art and science of generative models

Image-translation pioneer discusses the past, present, and future of generative adversarial networks, or GANs.

## CSAIL's Daskalakis wins ACM Grace Murray Hopper Award

Constantinos (“Costis”) Daskalakis, an MIT professor and CSAIL principal investigator, has won the 2018 ACM Grace Murray Hopper Award.

## A novel data-compression technique for faster computer programs

Researchers free up more bandwidth by compressing “objects” within the memory hierarchy.

## Advance boosts efficiency of flash storage in data centers

New architecture promises to cut in half the energy and physical space required to store and manage user data.

## Model learns how individual amino acids determine protein function

Technique could improve machine-learning tasks in protein design, drug testing, and other applications.

## “Particle robot” works as a cluster of simple units

Loosely connected disc-shaped “particles” can push and pull one another, moving en masse to transport objects.

## Achieving greater efficiency for fast data center operations

System better allocates time-sensitive data processing across cores to maintain quick user-response times.

## Platform ensures that web services adhere to users' privacy preferences

New MIT/Harvard platform acts as gatekeeper to ensure web services adhere to data restrictions