KDM-Security via Homomorphic Smooth Projective Hashing

Hoeteck Wee

Paper 2015/721

KDM-Security via Homomorphic Smooth Projective Hashing

Hoeteck Wee

Abstract

We present new frameworks for constructing public-key encryption schemes satisfying key-dependent message (KDM) security and that yield efficient, universally composable oblivious transfer (OT) protocols via the dual-mode cryptosystem framework of Peikert, Waters and Vaikuntanathan (Crypto 2008). – Our first framework yields a conceptually simple and unified treatment of the KDM-secure schemes of Boneh et al. (Crypto 2008), Brakerski and Goldwasser (Crypto 2010) and Brakerski, Goldwasser and Kalai (TCC 2011) in the single-key setting. – Using our second framework, we obtain new dual-mode cryptosystems based on the d-linear, quadratic residuocity and decisional composite residuocity assumptions. Both of these frameworks build on the notion of smooth projective hashing introduced by Cramer and Shoup (Eurocrypt 2002), with the additional requirement that the hash function is homomorphic, as is the case for all known instantiations.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Published by the IACR in PKC 2016
Contact author(s): wee @ di ens fr
History: 2016-01-06: revised; 2015-07-21: received; See all versions
Short URL: https://ia.cr/2015/721
License: CC BY

BibTeX

@misc{cryptoeprint:2015/721,
      author = {Hoeteck Wee},
      title = {{KDM}-Security via Homomorphic Smooth Projective Hashing},
      howpublished = {Cryptology {ePrint} Archive, Paper 2015/721},
      year = {2015},
      url = {https://eprint.iacr.org/2015/721}
}