Resisting Randomness Subversion:  Fast Deterministic and Hedged Public-key Encryption in the Standard Model

Mihir Bellare; Viet Tung Hoang

Paper 2014/876

Resisting Randomness Subversion: Fast Deterministic and Hedged Public-key Encryption in the Standard Model

Mihir Bellare and Viet Tung Hoang

Abstract

This paper provides the first efficient, standard-model, fully-secure schemes for some related and challenging forms of public-key encryption (PKE), namely deterministic and hedged PKE. These forms of PKE defend against subversion of random number generators, an end given new urgency by recent revelations on the nature and extent of such subversion. We resolve the (recognized) technical challenges in reaching these goals via a new paradigm that combines UCEs (universal computational extractors) with LTDFs (lossy trapdoor functions). Crucially, we rely only on a weak form of UCE, namely security for statistically (rather than computationally) unpredictable sources. We then define and achieve unique-ciphertext PKE as a way to defend against implementation subversion via algorithm-substitution attacks.

Metadata

Available format(s): PDF
Publication info: A minor revision of an IACR publication in EUROCRYPT 2015
Keywords: Deterministic encryption Hedged encryption randomness subversion
Contact author(s): tvhoang @ umd edu
History: 2015-11-13: last of 2 revisions; 2014-10-28: received; See all versions
Short URL: https://ia.cr/2014/876
License: CC BY

BibTeX

@misc{cryptoeprint:2014/876,
      author = {Mihir Bellare and Viet Tung Hoang},
      title = {Resisting Randomness Subversion:  Fast Deterministic and Hedged Public-key Encryption in the Standard Model},
      howpublished = {Cryptology {ePrint} Archive, Paper 2014/876},
      year = {2014},
      url = {https://eprint.iacr.org/2014/876}
}