11th IEEE Symposium on Computers and Communications (ISCC'06) 2006
DOI: 10.1109/iscc.2006.92
|View full text |Cite
|
Sign up to set email alerts
|

Layered Multicast Data Origin Authentication and Non-repudiation over Lossy Networks

Abstract: Security and QoS are two main issues for a successful wide deployment of multicast services. For instance, in a multicast streaming application, a receiver would require a data origin authentication service as well as a quality adaptation technique for the received stream. Signature propagation and layered multicast are efficient solutions satisfying these two requirements. In this paper we investigate the use of signature propagation to ensure data origin authentication service. We, then, propose a set of nov… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2008
2008
2012
2012

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 15 publications
0
2
0
Order By: Relevance
“…It is assumed that the packets in the highest priority class are spaced evenly throughout the block so that two consecutive packets of the highest priority class are located exactly r packets apart. To reduce the communication overhead of amortization schemes, Park et al proposed SAIDA [20] using Erasure Codes to achieve this goal, but its computation overhead is higher than other schemes based on hashing amortization [1,2,3,[5][6][7][8]11,13,14,21]. …”
Section: Non-repudiationmentioning
confidence: 99%
“…It is assumed that the packets in the highest priority class are spaced evenly throughout the block so that two consecutive packets of the highest priority class are located exactly r packets apart. To reduce the communication overhead of amortization schemes, Park et al proposed SAIDA [20] using Erasure Codes to achieve this goal, but its computation overhead is higher than other schemes based on hashing amortization [1,2,3,[5][6][7][8]11,13,14,21]. …”
Section: Non-repudiationmentioning
confidence: 99%
“…In the random chaining, target packets that will carry a hash of the current packet are selected randomly. This approach complies with the random packet loss pattern [2,3,4,5,7]. In order to take advantage of both approaches, …”
Section: Main Idea Of Lmcmmentioning
confidence: 99%