Cryptography from Compression Functions: The UCE Bridge to the ROM
This paper suggests and explores the use of UCE security for the task of turning VIL-ROM schemes into FIL-ROM ones. The benefits we offer over indifferentiability, the current leading method for this task, are the ability to handle multi-stage games and greater efficiency. The paradigm consists of (1) Showing that a VIL UCE function can instantiate the VIL RO in the scheme, and (2) Constructing the VIL UCE function given a FIL random oracle. The main technical contributions of the paper are domain extension transforms that implement the second step. Leveraging known results for the first step we automatically obtain FIL-ROM constructions for several primitives whose security notions are underlain by multi-stage games.Our first domain extender exploits indifferentiability, showing that although the latter does not work directly for multi-stage games it can be used indirectly, through UCE, as a tool for this end. Our second domain extender targets performance. It is parallelizable and shown through implementation to provide significant performance gains over indifferentiable domain extenders.
KeywordsHash Function Random Oracle Compression Function Random Oracle Model Domain Extender
- 1.Fast SHA-256 Implementations on Intel Architecture Processors, goo.gl/Hh81eB.
- 2.Intel AESNI Library, goo.gl/l2czm1.
- 3.Intel Carry-Less Multiplication Instruction and its Usage for Computing the GCM Mode, http://goo.gl/qJLrF1
- 6.Bellare, M., Hoang, V.T., Keelveedhi, S.: Instantiating random oracles via UCEs. Cryptology ePrint Archive, Report 2013/424 (2013); Preliminary version appeared in Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 398–415. Springer, Heidelberg (2013)Google Scholar
- 7.Bellare, M., Hoang, V.T., Keelveedhi, S.: Cryptography from compression functions: The UCE bridge to the ROM. Cryptology ePrint Archive (2014)Google Scholar
- 9.Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: ACM CCS 1993. ACM (1993)Google Scholar
- 12.Brzuska, C., Farshim, P., Mittelbach, A.: Indistinguishability obfuscation and UCEs: The case of computationally unpredictable sources. Cryptology ePrint Archive, Report 2014/099. To appear in Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 188–205. Springer, Heidelberg (2014)Google Scholar
- 22.PKCS #1: RSA cryptography standard. RSA Data Security, Inc, Version 2.0. (September 1998)Google Scholar