Instantiating Random Oracles via UCEs

  • Mihir Bellare
  • Viet Tung Hoang
  • Sriram Keelveedhi
Conference paper

DOI: 10.1007/978-3-642-40084-1_23

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8043)
Cite this paper as:
Bellare M., Hoang V.T., Keelveedhi S. (2013) Instantiating Random Oracles via UCEs. In: Canetti R., Garay J.A. (eds) Advances in Cryptology – CRYPTO 2013. Lecture Notes in Computer Science, vol 8043. Springer, Berlin, Heidelberg

Abstract

This paper provides a (standard-model) notion of security for (keyed) hash functions, called UCE, that we show enables instantiation of random oracles (ROs) in a fairly broad and systematic way. Goals and schemes we consider include deterministic PKE; message-locked encryption; hardcore functions; point-function obfuscation; OAEP; encryption secure for key-dependent messages; encryption secure under related-key attack; proofs of storage; and adaptively-secure garbled circuits with short tokens. We can take existing, natural and efficient ROM schemes and show that the instantiated scheme resulting from replacing the RO with a UCE function is secure in the standard model. In several cases this results in the first standard-model schemes for these goals. The definition of UCE-security itself is quite simple, asking that outputs of the function look random given some “leakage,” even if the adversary knows the key, as long as the leakage does not permit the adversary to compute the inputs.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© International Association for Cryptologic Research 2013

Authors and Affiliations

  • Mihir Bellare
    • 1
  • Viet Tung Hoang
    • 2
  • Sriram Keelveedhi
    • 1
  1. 1.Dept. of Computer Science & EngineeringUniversity of CaliforniaSan DiegoUSA
  2. 2.Dept. of Computer ScienceUniversity of CaliforniaDavisUSA

Personalised recommendations