On-the-fly verification of rateless erasure codes for efficient content distribution

Krohn, Maxwell; Freedman, Michael J.; Mazières, David

doi:10.1109/secpri.2004.1301326

Cited by 280 publications

(324 citation statements)

References 24 publications

Supporting

Mentioning

323

Contrasting

Order By: Relevance

“…Krohn et al [24] (see also [13]) suggest homomorphic hashing for preventing pollution attacks. In their scheme, the sender computes a hash h i = H(v i ) of each block of the file; given x = (h 1 , .…”

Section: Dealing With Adversarial Behaviormentioning

confidence: 99%

“…Our second construction, called NCS 2 , provides an instantiation of the scheme of Krohn et al [24] that is secure according to our definition. The primary advantage of this scheme is that it can be proven secure based on a potentially weaker assumption (namely, the discrete logarithm assumption) without random oracles.…”

Section: Our Contributionsmentioning

confidence: 99%

“…Krohn et al [24] propose authenticating network coding data using a homomorphic hash function. As in Definition 2, their system produces a signature σ i on each basis vector of the subspace to be authenticated.…”

Section: A Secure Network Coding Signature Scheme Without Random Oraclesmentioning

confidence: 99%

“…By standard arguments [6,3], an algorithm A that produces such a collision with probability ε can be used to compute discrete logarithms in G with probability at least ε/2. For further details, see [24,§VI].…”

Section: ])mentioning

confidence: 99%

“…Because of these advantages, network coding has been proposed for applications in wireless and/or ad-hoc networks, where communication is at a premium and centralized control may be unavailable; it has also been suggested as an efficient means for content distribution in peer-topeer networks [24], and for improving the performance of large-scale data dissemination over the Internet [12].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Signing a Linear Subspace: Signature Schemes for Network Coding

Boneh

Freeman

Katz

et al. 2009

Lecture Notes in Computer Science

270

287

View full text Add to dashboard Cite

Abstract. Network coding offers increased throughput and improved robustness to random faults in completely decentralized networks. In contrast to traditional routing schemes, however, network coding requires intermediate nodes to modify data packets en route; for this reason, standard signature schemes are inapplicable and it is a challenge to provide resilience to tampering by malicious nodes.Here, we propose two signature schemes that can be used in conjunction with network coding to prevent malicious modification of data. In particular, our schemes can be viewed as signing linear subspaces in the sense that a signature σ on V authenticates exactly those vectors in V . Our first scheme is homomorphic and has better performance, with both public key size and per-packet overhead being constant. Our second scheme does not rely on random oracles and uses weaker assumptions.We also prove a lower bound on the length of signatures for linear subspaces showing that both of our schemes are essentially optimal in this regard.

show abstract

Section: Dealing With Adversarial Behaviormentioning

confidence: 99%

Section: Our Contributionsmentioning

confidence: 99%

Section: A Secure Network Coding Signature Scheme Without Random Oraclesmentioning

confidence: 99%

Section: ])mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Signing a Linear Subspace: Signature Schemes for Network Coding

Boneh

Freeman

Katz

et al. 2009

Lecture Notes in Computer Science

270

287

View full text Add to dashboard Cite

show abstract

Energy efficient authentication strategies for network coding

Apavatjrut

Znaïdi

Fraboulet

et al. 2011

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARY Recent advances in information theory and networking, e.g. aggregation, network coding or rateless codes, have significantly modified data dissemination in wireless networks. These new paradigms create new threats for security such as pollution attacks and denial of services (DoS). These attacks exploit the difficulty to authenticate data in such contexts. The particular case of xor network coding is considered herein. We investigate different strategies based on message authentication codes algorithms (MACs) to thwart these attacks. Yet, classical MAC designs are not compatible with the linear combination of network coding. Fortunately, MACs based on universal hash functions (UHFs) match nicely the needs of network coding: some of these functions are linear h(x1⊕x2) = h(x1)⊕h(x2). To demonstrate their efficiency, we consider the case of wireless sensor networks (WSNs). Although these functions can drastically reduce the energy consumption of authentication (up to 68% gain over the classical designs is observed), they increase the threat of DoS. Indeed, an adversary can disrupt all communications by polluting few messages. To overcome this problem, a group testing algorithm is introduced for authentication resulting in a complexity linear in the number of attacks. The energy consumption is analyzed for cross‐point and butterfly network topologies with respect to the possible attack scenarios. The results highlight the trade‐offs between energy efficiency, authentication and the effective throughput for the different MAC modes. Copyright © 2011 John Wiley & Sons, Ltd.

show abstract

Tsunami: massively parallel homomorphic hashing on many‐core GPUs

Chu

Zhao

2011

Concurrency and Computation

View full text Add to dashboard Cite

Homomorphic hash functions (HHF) play a key role in securing distributed systems that use coding techniques such as erasure coding and network coding. The computational complexity of HHFs remains to be a main challenge. In this paper, we present a massively parallel solution, named Tsunami, by exploiting the widely available many-core Graphic Processing Units (GPUs). Tsunami includes the following optimization techniques to achieve the highest ever hashing throughput: (1) using Montgomery multiplication and pre-computation to speed up modular exponentiations; (2) using a clean implementation of Montgomery multiplication in order to decrease the demand of registers and shared memory and increase the utilization ratio of GPU processing cores; (3) using our own assembly code to implement the 32-bit integer multiplication, which outperforms the assembly codes generated by the native compiler by 20%; (4) exploiting memory alignment and constant memory on GPUs to improve the efficiency of memory access. Integrating the above techniques, our Tsunami achieves a significant improvement over existing results. Specifically, the hashing throughput achieved by Tsunami on a GTX295 GPU is about 33 times of the existing solution on a Quad-core CPU. We also show that the hashing throughput grows almost linearly with the number of GPU cores.

show abstract

On-the-fly verification of rateless erasure codes for efficient content distribution

Cited by 280 publications

References 24 publications

Signing a Linear Subspace: Signature Schemes for Network Coding

Signing a Linear Subspace: Signature Schemes for Network Coding

Energy efficient authentication strategies for network coding

Tsunami: massively parallel homomorphic hashing on many‐core GPUs

Contact Info

Product

Resources

About