Efficient Multicast Stream Authentication for the Fully Adversarial Network Model

Tartary, Christophe; Wang, Huaxiong

doi:10.1007/11604938_9

Cited by 10 publications

(16 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Indeed, in [62], Very Smooth Hash [12] was used to reduce the time needed to exhaust the list of size U (n) output by MPR.…”

Section: Resultsmentioning

confidence: 99%

“…Finally, we will recall an algorithm by Guruswami and Sudan achieving polynomial reconstruction. As in [35,63], it will be used to deal with packet injections.…”

Section: Preliminariesmentioning

confidence: 99%

“…As in [27,35,63], we need a collision resistant hash function h [52] and an unforgeable digital signature scheme (Sign SK ,Verify PK ) [61] the key pair of which (SK,PK) is generated by an algorithm KeyGen. LT code-based construction.…”

Section: Overview Of Our Approachmentioning

confidence: 99%

“…A necessary condition for all these schemes to authenticate a packet P (at the receiver) is to get an elementP containing P along with some hashes [20,40,51,67] or code symbols [35,45,63]. IfP is dropped then P is definitely lost since such aP is unique for each scheme.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A coding approach to the multicast stream authentication problem

Tartary

Wang

Pieprzyk

2007

Int. J. Inf. Secur.

Self Cite

View full text Add to dashboard Cite

We study the multicast stream authentication problem when an opponent can drop, reorder and introduce data packets into the communication channel. In such a model, packet overhead and computing efficiency are two parameters to be taken into account when designing a multicast stream protocol. In this paper, we propose to use two families of erasure codes to deal with this problem, namely, rateless codes and maximum distance separable codes. Our constructions will have the following advantages. First, our packet overhead will be small. Second, the number of signature verifications to be performed at the receiver is O(1). Third, every receiver will be able to recover all the original data packets emitted by the sender despite losses and injection occurred during the transmission of information.

show abstract

“…Indeed, in [62], Very Smooth Hash [12] was used to reduce the time needed to exhaust the list of size U (n) output by MPR.…”

Section: Resultsmentioning

confidence: 99%

“…Finally, we will recall an algorithm by Guruswami and Sudan achieving polynomial reconstruction. As in [35,63], it will be used to deal with packet injections.…”

Section: Preliminariesmentioning

confidence: 99%

Section: Overview Of Our Approachmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A coding approach to the multicast stream authentication problem

Tartary

Wang

Pieprzyk

2007

Int. J. Inf. Secur.

Self Cite

View full text Add to dashboard Cite

show abstract

“…In an earlier version of this work (Tartary and Wang, 2005), we proposed to decrease the time spent for signature generation and verification by creating a single signature per family of λ blocks where each of them consists of n packets. Now we suggest to use a Trapdoor Hash Function (THF) instead of a digital signature to ensure non-repudiation of data.…”

Section: Introductionmentioning

confidence: 99%

Efficient multicast stream authentication for the fully adversarial network model

Tartary

Wang

2007

IJSN

Self Cite

View full text Add to dashboard Cite

We consider the stream authentication problem when an adversary has the ability to drop, reorder or inject data in the network. We propose a coding approach for multicast stream authentication using the list-decoding property of Reed-Solomon codes. We divide the data to be authenticated into a stream of packets and associate a single trapdoor hash collision for every λn packets where λ and n are predesignated parameters. Our scheme, which is also joinable at the boundary of any n-packet block, can be viewed as an extension of Lysyanskaya, Tamassia and Triandopoulos's technique in which λ = 1. We show that by choosing λ and n appropriately, our scheme outperforms theirs in time spent for processing data at the sender and receiver. Our approach relies on the dispersion process as SAIDA and eSAIDA. Assuming that we use RSA for signing and SHA-256 for hashing, we give an approximation of the proportion of extra packets per block which could be processed via our technique with respect to the previous scheme. As example when we process λ = 1000 blocks of 2650 64-byte-packets, the gain of our scheme with respect to Lysyanskaya et al.'s is about 30%.

show abstract

A survey of cyber crimes

Zhang

Xiao

Ghaboosi

et al. 2011

Security Comm Networks

View full text Add to dashboard Cite

With the advancement of computer and information technology, cyber crime is now becoming one of the most significant challenges facing law enforcement organizations. Cyber crimes are generally referred as criminal activities that use computers or networks. An understanding of the characteristics and nature of cyber crimes is important in helping research communities find ways to effectively prevent them. Most existing research focuses more on attacks and attack models, including either actual attacks or imaginary/possible attacks over all layers of networks or computers, but there has been less work carried out on a comprehensive survey of cyber crimes. This paper provides a survey of cyber crimes that have actually occurred. First, cyber crimes in the digital world are compared with crimes in the physical world. Then, cyber crimes are categorized according to the roles of computers or networks. Furthermore, we also notice that some cyber crimes are actually traditionally non‐cyber crimes that are facilitated by computers or networks. It is surprising that there are so many recurrent cyber crimes. More efforts are needed to protect people from cyber crimes. Copyright © 2011 John Wiley & Sons, Ltd.

show abstract

Efficient Multicast Stream Authentication for the Fully Adversarial Network Model

Cited by 10 publications

References 17 publications

A coding approach to the multicast stream authentication problem

A coding approach to the multicast stream authentication problem

Efficient multicast stream authentication for the fully adversarial network model

A survey of cyber crimes

Contact Info

Product

Resources

About