Secure multicast protocol with copyright protection

Author(s):  
Hao-hua Chu ◽  
Lintian Qiao ◽  
Klara Nahrstedt
2002 ◽  
Vol 32 (2) ◽  
pp. 42-60 ◽  
Author(s):  
Hao-hua Chu ◽  
Lintian Qiao ◽  
Klara Nahrstedt ◽  
Hua Wang ◽  
Ritesh Jain

2012 ◽  
Vol 04 (04) ◽  
pp. 1250053 ◽  
Author(s):  
YOSHIHIRO INDO ◽  
TAKAAKI MIZUKI ◽  
TAKAO NISHIZEKI

Assume that there are players and an eavesdropper Eve of unlimited computational power and that several pairs of players have shared secret keys beforehand. In a key sharing graph, each vertex corresponds to a player, and each edge corresponds to a secret key shared by the two players corresponding to the ends of the edge. Given a key sharing graph, a player wishes to send a message to another player so that the eavesdropper Eve and any other player can get no information on the message. In this paper, we first give a necessary and sufficient condition on a key sharing graph for the existence of such a unicast protocol. We then extend the condition to the case where a multiple number of players other than the sender and receiver passively collude. We finally give a sufficient condition for the existence of a secure multicast protocol.


2001 ◽  
Vol 11 (2) ◽  
pp. 129-136 ◽  
Author(s):  
Wen-Her Yang ◽  
Kai-Wei Fan ◽  
Shiuh-Pyng Shieh

2019 ◽  
Vol 19 (4) ◽  
pp. 133-142
Author(s):  
Chan Woong Hwang ◽  
◽  
Ji Hee Ha ◽  
Tea-jin Lee
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document