II - Computer Science (Theory)

SHARE:
  • MIT professors Shafi Goldwasser and Silvio Micali have won the Association for Computing Machinery’s (ACM) A.M. Turing Award for their pioneering work in the fields of cryptography and complexity theory. Essentially laying the foundation for modern cryptography by formalizing the concept that cryptographic security had to be computational rather than absolute, the two have turned cryptography from an art into science -- and, in the process provided the basis for securing today's communications protocols, Internet transactions and cloud computing. They also made fundamental advances in the theory of computational complexity, an area that focuses on classifying computational problems according to their inherent difficulty.
  • In a paper titled "Ampli fication of Chosen-Ciphertext Security," two CSAIL postdoctoral associates Huijia (Rachel) Lin and Stefano Tessaro, who work with EECS Professor Shafi Goldwasser, have proposed a new technique aimed at protecting against the worst possible scenario in current enryption scheme vulnerabilities. This work will be presented in May this spring at the International Conference on the Theory and Applications of Cryptographic Techniques.
  • Trying to build a new circuit that would use an emerging technology called compressed sensing has taken on a renewed focus under the work of members of the Electrical Engineering and Computer Science Department at MIT including EECS graduate student Omid Abari. With researchers in the Research Laboratory of Electronics at MIT (RLE) and in the Computer Science and Artificial Intelligence Lab (CSAIL) Obari is seeking to balance theory with chip building realities using new evaluation algorithms to allow creation of the ideal circuit.
  • In March 2011, Scott Aaronson, MIT associate professor in the Electrical Engineering and Computer Science Department (EECS) and principal investigator in the Computer Science and Artificial Intelligence Laboratory (CSAIL) working with EECS graduate student Alex Arkhipov proposed the creation of a first step towards quantum computing -- an optical experiment that would demonstrate the feasibility of quantum computing. Four distinct research groups, which undertook Aaronson and Arkhipov's proposed experiment in December 2012, are now reporting the results.
  • EECS faculty member Erik Demaine, professor of computer science at MIT, and principal investigator in the Computer Science and Artificial Intelligence Lab (CSAIL) has teamed with members of the MIT Center for Bits and Atoms to develop a new kind of robotic device that mimics nature's folding of proteins to allow for all kinds of possible functionality.
  • In the effort to handle data overload, Daniela Rus, professor of computer science MIT and director of the Computer Science and Artificial Intelligence Lab (CSAIL) has teamed with postdoctoral associate Daniel Feldman to describe a novel way to represent data so that it takes up much less space in memory but can still be processed in conventional ways when needed.
  • Dropbox co-founder Drew Houston, who earned his undergraduate degree in computer science at MIT in 2005 and teamed with then EECS undergraduate student Arash Ferdowsi to found the company, will be the MIT June 7, 2013 Commencement speaker. "I’ve had some of the most formative experiences of my life at MIT,” Houston says. “It’s where Dropbox started and where I met my co-founder, Arash, so it’s an honor to come back and share my story. Technology is at the heart of how we shape our future and confront our challenges, and more than ever the world needs MIT graduates to lead us forward.”
  • The MIT Electrical Engineering and Computer Science Department held a reception, October 18, to celebrate the official launch of the new SuperUROP undergraduate research program. Members of the inaugural class of the SuperUROP program, sponsors (and donors), MIT administrators who contributed to its implementation, and EECS faculty mentors and guests, joined EECS Department Head Anantha Chandrakasan in the Stata Center R&D Dining area to celebrate. Read more and view photos of the event and the 6.UAR class held just before the reception.
  • Cited for his work developing the RSA algorithm, a method for public-key cryptography, Ronald Rivest is named to the National Cyber Security Hall of Fame, Oct. 17, 2012.

Pages

Subscribe to II - Computer Science (Theory)