S. Berkovits, How to Broadccast a Secret, Advances in Cryptology - Eurocryp'91, Lecture Notes in Computer Science 547, Springer, 1991, pp. 536--541. 11  Home/Search   Document Not in Database   Summary   Related Articles

....while the number of messages transmitted by the center is O(k log k log(1=p) Corollary 2) Other points along the tradeoff between memory and transmission length are given in Theorem 4. 1. 3 Related Work Several papers considered the problem of a center who wants to broadcast to a group (cf. [2, 6, 14]) However, all these schemes are one time , and the keys must be updated after every use. Suppose that a user subscribes to a Pay TV service, receives a decryption box and then opens it and duplicates it. There is nothing to stop him or her from doing so (except for tamper proof hardware, which ....

S. Berkovits, How to Broadccast a Secret, Advances in Cryptology - Eurocryp'91, Lecture Notes in Computer Science 547, Springer, 1991, pp. 536--541. 11

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC