PYI:  Mathematical Foundations of Cryptography
{'Code': '05010100', 'Directorate': {'Abbreviation': 'CSE', 'LongName': 'Direct For Computer & Info Scie & Enginr'}, 'Division': {'Abbreviation': 'CCF', 'LongName': 'Division of Computing and Communication Foundations'}}
{'SignBlockName': 'Dana S. Richards', 'PO_EMAI': None, 'PO_PHON': None}
PYI:  New Foundations for Cryptography                                                                                                                          Research is in progress in the general area of computational                    complexity.  The focus of this research is on cryptography and                  computational number theory.                                                                                                                                    During the decade of the eighties cryptography was developed into a             formal discipline in which notions such as "one-way function" and               "proving that a protocol is correct" have a precise yet natural                 meaning. Rigor was accomplished by concrete proposals which were shown          to comply with the new complexity standards under a few complexity              assumptions.  Unfortunately, the complexity assumptions made, for               example the existence of one-way functions, are likely to remain                unproven for quite a while longer.  This situation provides motivation          for establishing a new foundation for cryptography.  Instead of making          intractability assumptions about functions, physical assumptions about          the model in which cryptography is being done (for example the kind of          channel or layout used for communication by the network participants)           are being made.    Unconditionally secure communication protocols for           the new model are sought. Results already achieved that involve proof-          systems with a "distributed" prover may have applications to fault              tolerant distributed computing.  Such applications are being explored.                                                                                                                                                                          Work is continuing on interactive proof systems.  Using tools developed         in this area an attempt is being made to clarify the complexity of              previously unclassified optimization problems.  Work in computational           number theory is also continuing.  Simpler and faster algorithms for            primality testing and other algebraic computations are sought.                                                                                                  The P.I. has been judged to be an outstanding computer scientist by the         Presidential Young Investigator Panel.
{'FirstName': 'Shafrira', 'LastName': 'Goldwasser', 'PI_MID_INIT': None, 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Shafrira Goldwasser', 'EmailAddress': 'shafi.goldwasser@berkeley.edu', 'NSF_ID': '000218683', 'StartDate': '08/15/1987', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'Massachusetts Institute of Technology', 'CityName': 'CAMBRIDGE', 'ZipCode': '021394301', 'PhoneNumber': '6172531000', 'StreetAddress': '77 MASSACHUSETTS AVE', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'Massachusetts', 'StateCode': 'MA', 'CONGRESSDISTRICT': '07', 'CONGRESS_DISTRICT_ORG': 'MA07', 'ORG_UEI_NUM': 'E2NYLCDML6V1', 'ORG_LGL_BUS_NAME': 'MASSACHUSETTS INSTITUTE OF TECHNOLOGY', 'ORG_PRNT_UEI_NUM': 'E2NYLCDML6V1'}
{'Name': None, 'CityName': None, 'StateCode': None, 'ZipCode': None, 'StreetAddress': None, 'CountryCode': None, 'CountryName': None, 'StateName': None, 'CountryFlag': None, 'CONGRESSDISTRICT': None, 'CONGRESS_DISTRICT_PERF': '""'}
{'Code': '286000', 'Text': 'THEORY OF COMPUTING'}
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1986&All=true', 'xml': '8657527.xml'}