Homomorphic signatures for network coding: Difference between revisions

Revision as of 02:53, 7 July 2023

Revision as of 21:45, 23 July 2023

Line 29:

==History==

Krohn, Freedman and Mazieres proposed a theory<ref>{{cite book |last1=Krohn |first1=Maxwell N. |last2=Freedman |first2=Michael J |last3=Mazières |first3=David |title=IEEE Symposium on Security and Privacy, 2004. Proceedings. 2004 |chapter=On-the-fly verification of rateless erasure codes for efficient content distribution |journal=IEEE Symposium on Security and Privacy, 2004. Proceedings. 2004 |date=2004 |pages=226–240 |doi=10.1109/SECPRI.2004.1301326 |chapter-url=https://www.cs.princeton.edu/~mfreed/docs/authcodes-sp04.pdf |access-date=17 November 2022 |___location=Berkeley, California, USA |language=en-us |issn=1081-6011|isbn=0-7695-2136-3|s2cid=6976686 }}</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>;