Content deleted Content added
typo correction in Signature verification |
Citation bot (talk | contribs) m Alter: template type. Add: arxiv, bibcode, pages, year, title, citeseerx, author pars. 1-3. Removed URL that duplicated unique identifier. Converted bare reference to cite template. | You can use this bot yourself. Report bugs here.| Activated by User:Quuux |
||
Line 1:
[[Network coding]] has been shown to optimally use [[Bandwidth (computing)|bandwidth]] in a network, maximizing information flow but the scheme is very inherently vulnerable to pollution attacks by malicious nodes in the network. A node injecting garbage can quickly affect many receivers. The pollution of [[network packet]]s spreads quickly since the output of (even an) honest node is corrupted if at least one of the incoming packets is corrupted. An attacker can easily corrupt a packet even if it is encrypted by either forging the signature or by producing a collision under the [[hash function]]. This will give an attacker access to the packets and the ability to corrupt them. Denis Charles, Kamal Jain and Kristin Lauter designed a new [[homomorphic encryption]] signature scheme for use with network coding to prevent pollution attacks.<ref>
==Network coding==
Line 77:
#(Alternating) <math>e_m(P, P) = 1</math>.
Also, <math>e_m</math> can be computed efficiently.<ref>
===Homomorphic signatures===
| |||