On-the-fly verification of rateless erasure codes for efficient content distribution
By Maxwell N. Krohn, Michael J. Freedman, David Mazières. IEEE Symposium on Security and Privacy : Proceedings, 2004
417 citations recorded by the source corpus.
Subfields: Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/7ac81a89cac3b01c761fa23d3194ba59bcf37b2e
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Dan Boneh
- Shweta Agrawal
- Christos Gkantsidis
- Pablo Rodríguez Rodríguez
- David Mandell Freeman
- Michael J. Freedman
- Eric Andrew Freudenthal
- Brent Waters
Citations in the corpus
- Signing a Linear Subspace: Signature Schemes for Network Coding (2009, methodology): “Krohn et al. [22] (see also [11] [12]) suggest homomorphic hashing for preventing pollution attacks.”
- Survey of research towards robust peer-to-peer networks: Search methods (2006, neutral): “[134] M.”
- Resilient Network Coding in the Presence of Byzantine Adversaries (2008, neutral): “Earlier work [22], [9] assumes a centralized trusted authority that provides hashes of the original packets to each node in the network.”
- Provable data possession at untrusted stores (2007, background): “[28] provide the best example and give a good review of other applications of homomorphic hashing.”
- Cooperative Security for Network Coding File Distribution (2006, methodology): “When blocks are encoded only at the server, or at a limited set of servers, then the standard way to prevent an attack by a malicious user injecting bad data into the system is to require that valid senders sign all their encoded packets cryptographically [31].”
- Homomorphic MACs: MAC-Based Integrity for Network Coding (2009, background): “Several authors [4,5,7,8] devised digital signature schemes for signing a linear subspace.”
- Network coding for large scale content distribution (2005, background): “Digitally signing is more difficult when rateless codes are used, but recently [29] demonstrated”
- Homomorphic Signatures for Polynomial Functions (2011, methodology): “Current methods for computing on signed data can handle only linear functions [23, 11, 38, 7, 16, 6].”
- Democratizing Content Publication with Coral (2004, methodology): “For such, we have developed on-the-fly verification mechanisms to limit malicious proxies’ abilities to waste a node’s downstream bandwidth [13].”