We contribute to this area in several ways. We present the first homomorphic signature scheme based solely on the RSA assumption (in the random oracle model), and present a homomorphic hashing scheme based on composite moduli that is computationally more efficient than existing schemes (and which leads to secure network coding signatures based solely on the hardness of factoring in the standard model). Both schemes use shorter public keys than previous schemes. In addition, we show variants of existing schemes that reduce the communication overhead significantly for moderate-size networks, and which improve computational efficiency in some cases quite dramatically (e.g., we achieve a 20-fold speedup in the computation of intermediate nodes). At the core of our techniques is a modified approach to network coding where instead of working in a vector space over a field, we work directly over the integers (with small coefficients).
Category / Keywords: public-key cryptography / Network coding, homomorphic hashing, homomorphic signatures Date: received 23 Nov 2009 Contact author: hugo at ee technion ac il Available formats: PDF | BibTeX Citation Version: 20091125:023444 (All versions of this report) Discussion forum: Show discussion | Start new discussion