Skip directly to content

Minimize RSR Award Detail

Research Spending & Results

Award Detail

Awardee:REGENTS OF THE UNIVERSITY OF CALIFORNIA, THE
Doing Business As Name:University of California-Berkeley
PD/PI:
  • Sanjam Garg
  • (510) 642-8109
  • sanjamg@berkeley.edu
Award Date:04/13/2015
Estimated Total Award Amount: $ 175,000
Funds Obligated to Date: $ 175,000
  • FY 2015=$175,000
Start Date:04/01/2015
End Date:03/31/2017
Transaction Type:Grant
Agency:NSF
Awarding Agency Code:4900
Funding Agency Code:4900
CFDA Number:47.070
Primary Program Source:040100 NSF RESEARCH & RELATED ACTIVIT
Award Title or Description:CRII: SaTC: Expanding the Frontiers of Cryptographic Technologies
Federal Award ID Number:1464397
DUNS ID:124726725
Parent DUNS ID:071549000
Program:Secure &Trustworthy Cyberspace

Awardee Location

Street:Sponsored Projects Office
City:BERKELEY
State:CA
ZIP:94710-1749
County:Berkeley
Country:US
Awardee Cong. District:13

Primary Place of Performance

Organization Name:University of California-Berkeley
Street:685 Soda Hall
City:Berkeley
State:CA
ZIP:94720-1776
County:Berkeley
Country:US
Cong. District:13

Abstract at Time of Award

As all our data moves to the cloud many new security and privacy concerns arise and traditional cryptographic primitives prove insufficient in such scenarios. A key focus of this research is to advance the state of the art on cryptographic techniques that address these new challenges. Recent results on obfuscation, have drastically changed what cryptographers thought as feasible. Applications of obfuscation include very exotic and extremely powerful cryptographic primitives such as, functional encryption for general circuits, secure multiparty computation with optimal communication, deniable encryption and so on. Unfortunately, known realizations of obfuscation, and therefore its applications, rely either on an exponential number of assumptions (basically, one per every pair of circuits), or a polynomial set of assumptions but with an exponential loss in security reduction. The PI plans to develop techniques for circumventing the use of obfuscation in some of its most important applications. For further information see the project web site at: www.cs.berkeley.edu/~sanjamg

Publications Produced as a Result of this Research

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

Garg, Sanjam and Lu, Steve and Ostrovsky, Rafail "Black-Box Garbled RAM" Annual Symposium on Foundations of Computer Science, v., 2015, p.. Citation details  

Garg, Sanjam and Ishai, Yuval and Kushilevitz, Eyal and Ostrovsky, Rafail and Sahai, Amit "Cryptography with One-Way Communication" Lecture notes in computer science, v.9216, 2015, p.. Citation details  


Project Outcomes Report

Disclaimer

This Project Outcomes Report for the General Public is displayed verbatim as submitted by the Principal Investigator (PI) for this award. Any opinions, findings, and conclusions or recommendations expressed in this Report are those of the PI and do not necessarily reflect the views of the National Science Foundation; NSF has not approved or endorsed its content.

As data moves to the cloud, many new security and privacy concerns arise and traditional cryptographic primitives prove insufficient in such scenarios. Recent results on program obfuscation have drastically changed what cryptographers saw as feasible on this front. This concept of program obfuscation aims to make computer programs unintelligible while preserving their functionality. Here, the unintelligibility requirement means that the obfuscated program should hide the secrets embedded inside the original program, and the preservation of functionality requirement means that the obfuscated program should be fully executable and have the same input-output behavior as the original program.

Obfuscation has many new applications in cryptography. However, unfortunately, known realizations of obfuscation, and therefore its applications, rely on strong computational intractability assumptions. This project achieved success on three fronts: (1) understanding and improving upon the assumptions needed for realizing program obfuscation methods, (2) realizing several of the important applications of obfuscation directly based on weaker assumption, and (3) improving the efficiency of the known obfuscation methods and several of their applications. Taken together, these efforts take us closer to realizing these technologies in the real world.  

In addition to the direct societal benefits that this research will provide, the project also supported the education of graduate and undergraduate students at the University of California, Berkeley.


Last Modified: 06/30/2017
Modified by: Sanjam Garg

For specific questions or comments about this information including the NSF Project Outcomes Report, contact us.