Award Abstract # 1526801
TWC: Small: Subversion-Resistant Cryptography

NSF Org: CNS
Division Of Computer and Network Systems
Recipient: UNIVERSITY OF CALIFORNIA, SAN DIEGO
Initial Amendment Date: July 27, 2015
Latest Amendment Date: July 27, 2015
Award Number: 1526801
Award Instrument: Standard Grant
Program Manager: James Joshi
CNS
 Division Of Computer and Network Systems
CSE
 Directorate for Computer and Information Science and Engineering
Start Date: September 1, 2015
End Date: August 31, 2019 (Estimated)
Total Intended Award Amount: $500,000.00
Total Awarded Amount to Date: $500,000.00
Funds Obligated to Date: FY 2015 = $500,000.00
History of Investigator:
  • Mihir Bellare (Principal Investigator)
    mihir@cs.ucsd.edu
Recipient Sponsored Research Office: University of California-San Diego
9500 GILMAN DR
LA JOLLA
CA  US  92093-0021
(858)534-4896
Sponsor Congressional District: 50
Primary Place of Performance: University of California-San Diego
CA  US  92093-0404
Primary Place of Performance
Congressional District:
50
Unique Entity Identifier (UEI): UYTTZT6G9DT1
Parent UEI:
NSF Program(s): Secure &Trustworthy Cyberspace
Primary Program Source: 01001516DB NSF RESEARCH & RELATED ACTIVIT
Program Reference Code(s): 7434, 7923
Program Element Code(s): 806000
Award Agency Code: 4900
Fund Agency Code: 4900
Assistance Listing Number(s): 47.070

ABSTRACT

This work aims to effectively address security concerns while maintaining the privacy of individuals and corporations. The project analyzes subversive attacks, develops defenses and deterrents, creates privacy tools and software, and increases awareness and expertise through teaching, mentoring and involvement of students in research.

This research rethinks the basics of cryptographic security to provide new models, frameworks, tools and solutions. This project considers the subversion of random number generators and offers forms of encryption that are robust in its presence. The project explores: (1) the subversion of certificate authorities and offer certificate-signing mechanisms that deter it, (2) the exfiltration of cryptographic keys by malware installed on systems and development of big-key cryptography as a deterrent, and (3) the subversion of key distribution protocols through infiltration of their endpoints and development of new protocols to resist it.

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 26)
Auerbach, Benedikt and Bellare, Mihir and Kiltz, Eike "Public-Key Encryption Resistant to Parameter Subversion and Its Realization from Efficiently-Embeddable Groups" Public-Key Cryptography ? PKC 2018. PKC 2018. Lecture Notes in Computer Science, vol 10769. Springer, Cham , 2018 Citation Details
Bellare, Mihir and Dai, Wei "Defending Against Key Exfiltration: Efficiency Improvements for Big-Key Cryptography via Large-Alphabet Subkey Prediction" CCS '17 Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security , 2017 10.1145/3133956.3133965 Citation Details
Bellare, Mihir and Hoang, Viet Tung "Identity-Based Format-Preserving Encryption" CCS '17 Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security , 2017 10.1145/3133956.3133995 Citation Details
Bellare, Mihir and Jaeger, Joseph and Len, Julia "Better Than Advertised: Improved Collision-Resistance Guarantees for MD-Based Hash Functions" CCS '17 Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security , 2017 10.1145/3133956.3134087 Citation Details
Benedikt Auerbach, Mihir Bellare, Eike Kiltz "Public-Key Encryption Resistant to Parameter Subversion and Its Realization from Efficiently-Embeddable Groups" Public-Key Cryptography - PKC 2018 - 21st IACR International Conference on Practice and Theory of Public-Key Cryptography , 2018 , p.348
Joseph Jaeger, Igors Stepanovs. "Optimal Channel Security Against Fine-Grained State Compromise: The Safety of Messaging" Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Lecture Notes in Computer Science 10991, Springer , 2018 , p.33 978-3-319-96883-4
Matilda Backendal, Mihir Bellare, Jessica Sorrell, Jiahao Sun. "The Fiat-Shamir Zoo: Relating the Security of Different Signature Variants." Secure IT Systems - 23rd Nordic Conference, NordSec 2018. Lecture Notes in Computer Science 11252, Springer 2018. , 2018 , p.154 978-3-030-03637-9
Mihir Bellare "New Proofs for NMAC and HMAC: Security without Collision Resistance" J. Cryptology , v.28 , 2015 , p.844 10.1007/s00145-014-9185-x
Mihir Bellare, Adam O'Neill, Igors Stepanovs "Forward-Security under Continual Leakage" Cryptology and Network Security - 16th International Conference, CANS 2017, Lecture Notes in Computer Science 11261, Springer , 2018 978-3-030-02640-0
Mihir Bellare, Asha Camper Singh, Joseph Jaeger, Maya Nyayapati, Igors Stepanovs "Ratcheted Encryption and Key Exchange: The Security of Messaging" Advances in Cryptology ? CRYPTO 201737th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20?24, 2017, Proceedings, LNCS 10401/ 10402/10403, Springer , 2017 978-3-319-63688-7
Mihir Bellare, Bertram Poettering, Douglas Stebila "Deterring Certificate Subversion: Efficient Double-Authentication-Preventing Signatures" Public-Key Cryptography - PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Amsterdam, The Netherlands, March 28-31, 2017, Proceedings, Part II. Lecture Notes in Computer Science 10175, Springer , 2017 , p.121 10.1007/978-3-662-54388-7
(Showing: 1 - 10 of 26)

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.

Nation state adversaries subvert cryptographic security by methods that include insertion of vulnerabilities into encryption software, insertion of backdoors into standardized random-number generators and coercion of Internet corporations to perform subversive tasks. This project studied SUBVERSION-RESISTANT CRYPTOGRAPHY, identifying possible attacks and counter-measure in this setting.

Cryptographic algorithms make crucial use of randomness, making random number generators a target for subversion. To protect against this, we develop encryption that provides the best possible security in the face of low-quality randomness. 

We are seeing increasing use of non-interactive zero-knowledge (NIZK) systems. These assume parameters provided by a trusted party. These parameters may be subverted. We develop NIZKs that resist this, retaining as much security as possible even under subverted parameters. 

Public-key encryption systems in use assume trusted elliptic curves, which become another point of possible subversion. We develop public-key encryption systems that are more robust than standard ones in the face of compromise of the elliptic curves.

TLS/SSL sessions can be compromised by coercing a Certificate Authority (CA) into creating a rogue certificate in the name of a popular server. As a deterrent, we suggest that CA's sign certificates with DAPS (double-authentication-preventing signatures), which in such a situation will allow anyone to recover the CA's signing key. We design and implement practical DAPS schemes.

Subversion can involve penetrating a user system to install malware on a target computer that can then exfiltrate a key. We develop big-key cryptography, which protects against this by using 100 GByte keys in an efficient way. We design big-key authenticated-encryption schemes and big-key block ciphers.

We give attacks that show how encryption can be undetectably compromised by malware that subverts the user’s encryption code.

 


Last Modified: 12/24/2019
Modified by: Mihir Bellare

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

Print this page

Back to Top of page