Sciweavers

Share
PKC
2011
Springer

Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures

8 years 1 months ago
Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homomorphic signature scheme that authenticates vector subspaces of a given ambient space. Our system has several novel properties not found in previous proposals: • It is the first such scheme that authenticates vectors defined over binary fields; previous proposals could only authenticate vectors with large or growing coefficients. • It is the first such scheme based on the problem of finding short vectors in integer lattices, and thus enjoys the worst-case security guarantees common to lattice-based cryptosystems. Our scheme can be used to authenticate linear transformations of signed data, such as those arising when computing mean and Fourier transform or in networks that use network coding. Our construction gives an example of a cryptographic primitive — homomorphic signatures over F2 — that can...
Dan Boneh, David Mandell Freeman
Added 17 Sep 2011
Updated 17 Sep 2011
Type Journal
Year 2011
Where PKC
Authors Dan Boneh, David Mandell Freeman
Comments (0)
books