Homomorphic signatures for network coding: Difference between revisions

Revision as of 14:12, 16 January 2020

Revision as of 22:23, 22 April 2020

Line 25:

==History==

Krohn, Freedman and Mazieres proposed a theory<ref>{{Cite web |url=http://www.cs.princeton.edu/~mfreed/docs/authcodes-ieee04.pdf |title=Archived copy |access-date=2011-05-06 |archive-url=https://web.archive.org/web/20120316143135/http://www.cs.princeton.edu/~mfreed/docs/authcodes-ieee04sp04.pdf |archive-date=2012-03-16 |url-status=dead }}</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) = H(y)</math>;