| C. S. Laih and S. M. Yen, "On the design of conference key distribution systems for the broadcasting networks," Proceedings of IEEE INFOCOM '93, vol. 3, pp. 1406-1413, March 30 - April i 1993. |
....a polynomial of degree (t 1) can be uniquely determined by t points, the secret can be computed from t shares. Threshold schemes have proved useful in many applications of cryptography including electronic cash, group signatures, key recovery and voting. In particular, some authors [17] 18] [19] discuss the application of threshold schemes to key distribution in broadcast networks. Their basic idea is to construct a (t, n) threshold scheme, and to assign a distinct share to each receiver in the network. If (t 1) shares are broadcast, the secret can be constructed by any receiver using ....
C. S. Laih and S. M. Yen, "On the design of conference key distribution systems for the broadcasting networks," Proceedings of IEEE INFOCOM '93, vol. 3, pp. 1406-1413, March 30 - April i 1993.
No context found.
C. S. Laih and S. M. Yen, "On the design of conference key distribution systems for the broadcasting networks," Proceedings of IEEE INFOCOM '93, Vol. 3, pp. 1406-1413, San Francisco, CA, March 30-April 1, 1993.
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