The Experts below are selected from a list of 108 Experts worldwide ranked by ideXlab platform
Huaxiong Wang - One of the best experts on this subject based on the ideXlab platform.
-
a coding approach to the Multicast Stream authentication problem
International Journal of Information Security, 2008Co-Authors: Christophe Tartary, Huaxiong Wang, Josef PieprzykAbstract: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.
-
an hybrid approach for efficient Multicast Stream authentication over unsecured channels
Provable Security, 2007Co-Authors: Christophe Tartary, Huaxiong Wang, Josef PieprzykAbstract:We study the Multicast Stream authentication problem when an opponent can drop, reorder and inject data packets into the communication channel. In this context, bandwidth limitation and fast authentication are the core concerns. Therefore any authentication scheme is to reduce as much as possible the packet overhead and the time spent at the receiver to check the authenticity of collected elements. Recently, Tartary and Wang developed a provably secure protocol with small packet overhead and a reduced number of signature verifications to be performed at the receiver. In this paper, we propose an hybrid scheme based on Tartary and Wang's approach and Merkle hash trees. Our construction will exhibit a smaller overhead and a much faster processing at the receiver making it even more suitable for Multicast than the earlier approach. As Tartary and Wang's protocol, our construction is provably secure and allows the total recovery of the data Stream despite erasures and injections occurred during transmission.
-
combining prediction hashing and mds codes for efficient Multicast Stream authentication
Australasian Conference on Information Security and Privacy, 2007Co-Authors: Christophe Tartary, Huaxiong WangAbstract:We study the Multicast Stream authentication problem when the communication channel is under control of an opponent who can drop, reorder and inject data packets. In this work, we consider that the Stream to be authenticated is divided into block of n packets and we assume that the sender can memorize λ such blocks. Two important parameters for Stream authentication protocols are packet overhead and computing efficiency. Our construction will exhibit the following advantages. First, our packet overhead will be a few hashes long. Second, the number of signature verifications per family of λ blocks will be O(1) as a function of both λ and n. Third, hash chains will enable the receiver to check the validity of received elements upon reception. As a consequence he will only buffer those consistent with the original data packets. Fourth, the receiver will be able to recover all the data packets emitted by the sender despite erasures and injections by running the decoding algorithm of the maximal distance separable code onto the elements which have passed the previous filtering process.
-
efficient Multicast Stream authentication for the fully adversarial network model
International Journal of Security and Networks, 2007Co-Authors: Christophe Tartary, Huaxiong WangAbstract: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%.
-
rateless codes for the Multicast Stream authentication problem
International Workshop on Security, 2006Co-Authors: Christophe Tartary, Huaxiong WangAbstract:We study the Multicast authentication problem when an opponent can drop, reorder and introduce data packets into the communication channel. We first study the packet authentication probability of a scheme proposed by Lysyanskaya, Tamassia and Triandopoulos in 2003 since our opponent model is based on theirs. Using a family of rateless codes called Luby Transform codes (LT codes) we design a protocol which allows any packet to be authenticated at the receiver with probability arbitrary close to 1. We also compare LT codes to other families of rateless codes which could be used in that context in order to minimize the packet overhead as well as the time complexity of encoding and decoding data.
Christophe Tartary - One of the best experts on this subject based on the ideXlab platform.
-
a coding approach to the Multicast Stream authentication problem
International Journal of Information Security, 2008Co-Authors: Christophe Tartary, Huaxiong Wang, Josef PieprzykAbstract: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.
-
an hybrid approach for efficient Multicast Stream authentication over unsecured channels
Provable Security, 2007Co-Authors: Christophe Tartary, Huaxiong Wang, Josef PieprzykAbstract:We study the Multicast Stream authentication problem when an opponent can drop, reorder and inject data packets into the communication channel. In this context, bandwidth limitation and fast authentication are the core concerns. Therefore any authentication scheme is to reduce as much as possible the packet overhead and the time spent at the receiver to check the authenticity of collected elements. Recently, Tartary and Wang developed a provably secure protocol with small packet overhead and a reduced number of signature verifications to be performed at the receiver. In this paper, we propose an hybrid scheme based on Tartary and Wang's approach and Merkle hash trees. Our construction will exhibit a smaller overhead and a much faster processing at the receiver making it even more suitable for Multicast than the earlier approach. As Tartary and Wang's protocol, our construction is provably secure and allows the total recovery of the data Stream despite erasures and injections occurred during transmission.
-
combining prediction hashing and mds codes for efficient Multicast Stream authentication
Australasian Conference on Information Security and Privacy, 2007Co-Authors: Christophe Tartary, Huaxiong WangAbstract:We study the Multicast Stream authentication problem when the communication channel is under control of an opponent who can drop, reorder and inject data packets. In this work, we consider that the Stream to be authenticated is divided into block of n packets and we assume that the sender can memorize λ such blocks. Two important parameters for Stream authentication protocols are packet overhead and computing efficiency. Our construction will exhibit the following advantages. First, our packet overhead will be a few hashes long. Second, the number of signature verifications per family of λ blocks will be O(1) as a function of both λ and n. Third, hash chains will enable the receiver to check the validity of received elements upon reception. As a consequence he will only buffer those consistent with the original data packets. Fourth, the receiver will be able to recover all the data packets emitted by the sender despite erasures and injections by running the decoding algorithm of the maximal distance separable code onto the elements which have passed the previous filtering process.
-
efficient Multicast Stream authentication for the fully adversarial network model
International Journal of Security and Networks, 2007Co-Authors: Christophe Tartary, Huaxiong WangAbstract: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%.
-
rateless codes for the Multicast Stream authentication problem
International Workshop on Security, 2006Co-Authors: Christophe Tartary, Huaxiong WangAbstract:We study the Multicast authentication problem when an opponent can drop, reorder and introduce data packets into the communication channel. We first study the packet authentication probability of a scheme proposed by Lysyanskaya, Tamassia and Triandopoulos in 2003 since our opponent model is based on theirs. Using a family of rateless codes called Luby Transform codes (LT codes) we design a protocol which allows any packet to be authenticated at the receiver with probability arbitrary close to 1. We also compare LT codes to other families of rateless codes which could be used in that context in order to minimize the packet overhead as well as the time complexity of encoding and decoding data.
Chun-kit Chan - One of the best experts on this subject based on the ideXlab platform.
-
Optical Overlay of Multicast Stream on a Survivable WDM Passive Optical Network
IEEE Photonics Technology Letters, 2013Co-Authors: Chun-kit ChanAbstract:We propose a novel scheme to perform an optical Multicast overlay on a survivable wavelength division multiplexed passive optical network. By flexibly controlling a sinusoidal clock signal and an optical switch at the optical line terminal, optical sub-carriers, which enable not only protection for distribution and feeder fibers, but also Multicast data delivery, are generated. 10-Gb/s transmissions under both normal working and protection modes are experimentally demonstrated.
Dafu Deng - One of the best experts on this subject based on the ideXlab platform.
-
hhmsm a hierarchical hybrid Multicast Stream merging scheme for large scale video on demand systems
International Conference on Multimedia and Expo, 2003Co-Authors: Dafu DengAbstract:The key performance bottleneck for large-scale video-on-demand (VoD) systems is the server bandwidth, which controls the number of clients a video server can support. Two existing Stream scheduling schemes can save server bandwidth significantly by using Multicast method to transmit video data: the batching scheme and the patching scheme. However, the batching scheme results in long start-up latency and high reneging probability. The patching scheme does not work well at high client request rates due to mass retransmission for same video data. In this paper, we propose a hierarchical hybrid Multicast Stream merging scheme, called HHMSM, which can save server bandwidth significantly over a wide range of client request rates. Furthermore, the start-up latency raised by the HHMSM scheme is far less than that of the batching scheme.
-
a dynamically grouped multi Multicast Stream scheduling strategy for video on demand systems
International Conference on Computational Science, 2003Co-Authors: Dafu DengAbstract:Network bandwidth is the key performance bottleneck for a videoon-demand (VoD) server. It controls the number of clients the server can support simultaneously. Previous works have shown some strategies, such as the batching strategy and the Stream merging strategy, that use one Multicast Stream to serve different clients requesting the same video object at the same time. They improve the performance of server bandwidth effectively. But the batching strategy results in long start-up latency and the traditional Stream merging strategy also wastes lots of server bandwidth. In this paper, we propose a dynamically grouped multi-Multicast Stream scheduling strategy, called DGMM, and analyze its performance in two factors: the start-up latency and the average bandwidth consumption.
Vasilis Sourlas - One of the best experts on this subject based on the ideXlab platform.
-
exploiting caching and Multicast for 5g wireless networks
IEEE Transactions on Wireless Communications, 2016Co-Authors: Konstantinos Poularakis, George Iosifidis, Vasilis SourlasAbstract:The landscape toward 5G wireless communication is currently unclear, and, despite the efforts of academia and industry in evolving traditional cellular networks, the enabling technology for 5G is still obscure. This paper puts forward a network paradigm toward next-generation cellular networks, targeting to satisfy the explosive demand for mobile data while minimizing energy expenditures. The paradigm builds on two principles; namely caching and Multicast . On one hand, caching policies disperse popular content files at the wireless edge, e.g., pico-cells and femto-cells, hence shortening the distance between content and requester. On other hand, due to the broadcast nature of wireless medium, requests for identical files occurring at nearby times are aggregated and served through a common Multicast Stream. To better exploit the available cache space, caching policies are optimized based on Multicast transmissions. We show that the Multicast-aware caching problem is NP-hard and develop solutions with performance guarantees using randomized-rounding techniques. Trace-driven numerical results show that in the presence of massive demand for delay tolerant content, combining caching and Multicast can indeed reduce energy costs. The gains over existing caching schemes are 19% when users tolerate delay of three minutes, increasing further with the steepness of content access pattern.