Homomorphic signatures for network coding: Difference between revisions

Revision as of 17:25, 9 March 2013

Revision as of 17:26, 9 March 2013

Line 27:

Krohn, Freedman and Mazieres proposed a theory<ref>http://www.cs.princeton.edu/~mfreed/docs/authcodes-ieee04.pdf</ref> in 2004 that if we have a hash function

<math>H : V \longrightarrow G</math> such that:

* <math>H</math> is [[Collision resistance|collision resistant]] – it is hard to find <math>x</math> and <math>y</math> such that <math>H(x)</math> = <math>H(y)</math>;

* <math>H</math> is a [[homomorphism]] – <math>H(x</math> + <math>y</math>) = <math>H(x) + H(y)</math>.

Then server can securely distribute <math>H(v_i)</math> to each receiver, and to check if