Award Abstract # 1218461
AF: Small: New Directions in Cryptography: Non-Black-Box Techniques against Non-Black-Box Attacks

NSF Org: CCF
Division of Computing and Communication Foundations
Recipient: TRUSTEES OF BOSTON UNIVERSITY
Initial Amendment Date: July 30, 2012
Latest Amendment Date: July 30, 2012
Award Number: 1218461
Award Instrument: Standard Grant
Program Manager: Jack S. Snoeyink
CCF
 Division of Computing and Communication Foundations
CSE
 Directorate for Computer and Information Science and Engineering
Start Date: September 1, 2012
End Date: August 31, 2016 (Estimated)
Total Intended Award Amount: $480,182.00
Total Awarded Amount to Date: $480,182.00
Funds Obligated to Date: FY 2012 = $480,182.00
History of Investigator:
  • Ran Canetti (Principal Investigator)
    canetti@bu.edu
Recipient Sponsored Research Office: Trustees of Boston University
1 SILBER WAY
BOSTON
MA  US  02215-1703
(617)353-4365
Sponsor Congressional District: 07
Primary Place of Performance: Trustees of Boston University
881 Commonwealth Avenue
Boston
MA  US  02215-1300
Primary Place of Performance
Congressional District:
07
Unique Entity Identifier (UEI): THL6A6JLE1S7
Parent UEI:
NSF Program(s): Algorithmic Foundations
Primary Program Source: 01001213DB NSF RESEARCH & RELATED ACTIVIT
Program Reference Code(s): 7923, 7927
Program Element Code(s): 779600
Award Agency Code: 4900
Fund Agency Code: 4900
Assistance Listing Number(s): 47.070

ABSTRACT

Traditionally, cryptographic algorithms and protocols are geared towards protecting against attacks that interact with the designed algorithms via well specified interfaces (such as I/O and communication). However, the increasingly sophisticated ways in which computing devices are currently used completely shatter the traditional boundaries between the attacker and the "private internals" of the cryptographic algorithm under attack. Algorithms are run over small and exposed machines that leak information on their internal state; they are transported to other, potentially adversarial machines which may inspect all the internal state and also misreport the result; their code is exposed and subject to adversarial tinkering.

This project is aimed at developing new algorithmic and analytical techniques for dealing with this new reality. This includes cryptographic algorithms and protocols that are resilient to leakage from and tampering with the internal states of the host machines, program obfuscation techniques, and techniques for verifying computation done on untrusted machines. A basic premise of this project is that new analytical techniques, that no longer treat the adversary as black-box, are essential. Consequently, special effort is dedicated to developing such techniques.

The project tackles a set of problems that are central to the security of modern computer systems and consequently also to the well-being and stability of modern society. But even disregarding practical applicability, the tackled problems lie at the heart of our understanding of the notion of computation, the interplay between code and data, and the ability to algorithmically "understand" arbitrary code.

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.

(Showing: 1 - 10 of 11)
Nir Bitansky and Omer Paneth "On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation" {SIAM} J. Comput. , v.44 , 2015 , p.1325--138
Nir Bitansky and Omer Paneth and Daniel Wichs "Perfect Structure on the Edge of Chaos" {IACR} Cryptology ePrint Archive , v.2015 , 2015 , p.126
Nir Bitansky and Ran Canetti and Omer Paneth and Alon Rosen "On the Existence of Extractable One-Way Functions" {SIAM} J. Comput. , v.45 , 2016 , p.1910--195
Nir Bitansky and Ran Canetti and Omer Paneth and Alon Rosen "On the Existence of Extractable One-Way Functions" {SIAM} J. Comput. , v.45 , 2016 , p.1910--195
Nir Bitansky and Shafi Goldwasser and Abhishek Jain and Omer Paneth and Vinod Vaikuntanathan and Brent Waters "Time-Lock Puzzles from Randomized Encodings" {IACR} Cryptology ePrint Archive , v.2015 , 2015 , p.514
Omer Paneth and Amit Sahai "On the Equivalence of Obfuscation and Multilinear Maps" {IACR} Cryptology ePrint Archive , v.2015 , 2015 , p.791
Ran Canetti and Huijia Lin and Rafael Pass "Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions" {SIAM} J. Comput. , v.45 , 2016 , p.1793--183
Ran Canetti and Justin Holmgren "Fully Succinct Garbled {RAM}" {IACR} Cryptology ePrint Archive , v.2015 , 2015 , p.388
Ran Canetti and Yilei Chen and Leonid Reyzin "On the Correlation Intractability of Obfuscated Pseudorandom Functions" {IACR} Cryptology ePrint Archive , v.2015 , 2015 , p.334
Ran Canetti, Ben Riva, Guy N. Rothblum: "Refereed delegation of computation." Inf. Comput. , v.226: , 2013 , p.13 elsevier
Yael Tauman Kalai and Omer Paneth "Delegating {RAM} Computations" {IACR} Cryptology ePrint Archive , v.2015 , 2015 , p.957
(Showing: 1 - 10 of 11)

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.

The goal of the project was to develop new cryptographic algorithms, analytical tools, and concepts  that will help address the new immense challenges that face our society in terms of  protecting the security of our information and society, while preserving the freedoms and privacy of individuals. Indeed, our current use of information and computing systems completely obliterate the traditional physical boundaries between the “local and trusted” and the “external and untrusted”. Instead, the separation is more “logical” and has to be enforced by “software agents” and their interaction with other “software agents”.

The project made advances in the following four directions:

  • Significant advances were made in constructing mechanisms for cryptographically masking (or,  obfuscating) computer  programs. Such mechanisms can greatly help secure software agents in a hostile computing environments. The projects  provides new measures of security for program obfuscation, new constructions, and numerous new uses and applications of program obfuscation. Some of these implications go beyond cryptography and computer science, and have implications on game theory, mechanism design, finance and economics.
  • New mechanisms  were  invented  that allow a low-end client to verify the integrity and veracity of massive data sets and complex computations done in remote and untrusted data centers. Some of  these mechanisms also provide protection of the privacy of the data, the computations, and the results.
  • New mechanism were proposed for designing software that is able to preserve secrecy and integrity of data and computations even when the software is run on hardware that is ``leaky’’ – namely it allows an external attacker to mount “side channel attacks”  that measure some physical side-effects of the computation, such as power consumption, delay, electromagnetic radiation etc. Indeed, such attacks are a devastating and inevitable part of the modern computing world where computation is done on small and vulnerable devices.
  • New proof techniques were invented that allow for asserting security of algorithms and protocols that were previously out of reach. In particular the notion of extractability in cryptographic primitives was formalized and constructions (as well as impossibility results) were proven.

 

 


Last Modified: 12/01/2016
Modified by: Ran Canetti

Please report errors in award information by writing to: awardsearch@nsf.gov.

Print this page

Back to Top of page