Adopting Redundancy Techniques for Multicast Stream Authentication

Various schemes have been proposed to achieve strong authentication of streamed data in a lossy network by means of "light" digital signatures. Such techniques perform a strong authentication on only one packet, to which others are linked by means of hash functions, so that the authentication property propagates to them too. Most of these schemes make the basic assumption that the signature packet is not lost, even if no practical and precise solutions are proposed that guarantee such a property. In this paper we show how adoption of some redundancy techniques can be used in the context of multicast stream authentication in order to increase probability that the signature packets are received and correctly verified against their digital signature. Finally some experimental results are presented comparing computational overheads due to the authentication schemes both at the sender and at the receiver

To Achieve Perfect Resilience To Packet Loss In Lossy Channels Through Mabs

Authentication is one of the decisive subjects in protecting multicast in a situation attractive to malicious attacks.  Multicast is a competent method to transport multimedia content from a sender to a group of receivers and is gaining popular applications such as real time stock quotes, interactive games, video conference, live video broadcast or video on demand. The batch signature methods can be used to perk up the presentation of broadcast authentication. In this paper we recommend all-inclusive revise on this approach and suggest a novel multicast authentication protocol called MABS (Multicast Authentication based on Batch Signature). The essential scheme called MABS-B hereafter operates an well-organized asymmetric cryptographic primitive called batch signature which supports the authentication of any number of packets concurrently with one signature verification to address the competence and packet loss problems in universal surrounding

Time valid one-time signature for time-critical multicast data authentication

Abstract-It is challenging to provide authentication to timecritical multicast data, where low end-to-end delay is of crucial importance. Consequently, it requires not only efficient authentication algorithms to minimize computational cost, but also avoidance of buffering packets so that the data can be immediately processed once being presented. Desirable properties for a multicast authentication scheme also include small communication overhead, tolerance to packet loss, and resistance against malicious attacks. In this paper, we propose a novel signature model -Time Valid One-Time Signature (TV-OTS) -to boost the efficiency of regular one-time signature schemes. Based on the TV-OTS model, we design an efficient multicast authentication scheme "TV-HORS" to meet the above needs. TV-HORS combines one-way hash chains with TV-OTS to avoid frequent public key distribution. It provides fast signing/verification and buffering-free data processing, which make it one of the fastest multicast authentication schemes to date in terms of end-to-end computational latency (on the order of microseconds). In addition, TV-HORS has perfect tolerance to packet loss and strong robustness against malicious attacks. The communication overhead of TV-HORS is much smaller than regular OTS schemes, and even smaller than RSA signature. The only drawback of TV-HORS is a relatively large public key of size 8KB to 10KB, depending on parameters

A study of content authentication in proxy-enabled multimedia delivery systems: Model, techniques, and applications

Singapore Management Universit