E. Okamoto and K. Tanaka, Key Distribution System Based on Identification Information, IEEE J. Selected Areas in Communications 7 (1989), 481--485.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....[4] decentralized key distribution system plays the most important role for the key authenticity problem. Some identity based decentralized key distribution systems (they will be called the identity based key distribution systems latter in this paper) for two users have been developed so far [5,6,7,16]. There is a generalized form of key distribution system which is called the conference key distribution system (CKDS) 8] In the conference key distribution system, a set of users can generate a common secret key over the public channel to hold a secure conference. Without the CKDS, any ....

E. Okamoto, "Key distribution systems based on identification information," Advances in Cryptology Crypto'87 , pp.194--202.

....[4] decentralized key distribution system plays the most important role for the key authenticity problem. Some identity based decentralized key distribution systems (they will be called the identity based key distribution systems latter in this paper) for two users have been developed so far [5,6,7,16]. There is a generalized form of key distribution system which is called the conference key distribution system (CKDS) 8] In the conference key distribution system, a set of users can generate a common secret key over the public channel to hold a secure conference. Without the CKDS, any ....

....Based on the design methodology of CKDS described in the previous section, we propose an example of the ID based conference key distribution system for the broadcasting network. The system is developed based upon the structure of ID based common key distribution system proposed by Okamoto et al. [6] with some modifications and the threshold scheme proposed by Sham Jr [2] as follows. In this system, we assume that a trusted center exists. In the preparation phase, the center selects two large primes p and q, and selects two integers e and d such that n = pxq, 2) e x d 1 mod ....

E. Okamoto and K. Tanaka, "Key Distribution System Based on Identification Information," IEEE Journal on Selected Area in Communication., Vol.7, No.4, May 1987, pp.481--485.

.... system) Another related recent work is in [28] Fiat and Naor have suggested recently a key distribution scheme which is not algebraic, and Alon has given a lower bound for their scheme [23] Finally, we note that various suggestions for computational key distribution in different settings (e.g. [20, 25, 30, 29, 11]) and conferencing (e.g. 16, 5, 27] have appeared in the last years. Beimel and Chor [1] proved that in key distribution schemes the interaction can NEW not help in decreasing the size of the pieces of information given to the users. They also proposed a t round interactive protocol for ....

E. Okamoto and K. Tanaka, Key Distribution System Based on Identification Information, IEEE Journal on Selected Areas in Communications, vol. 7, no. 4, May 1989, pp. 481--485.

....signatures later. This simplifies the security problems, since it is not necessary to worry about monitoring a large secure authenticated file of information about users. There are several identity based cryptosystems that serve not only to authorize users, but also to generate session keys [3, 20, 23, 35, 36, 40]. They could be used very effectively in settings like that of the Sun NFS. Unfortunately, their running times are all comparable to those of the RSA and Diffie Hellman systems. It is desirable to find a scheme of this kind that would be as fast as some of the signature schemes that are known, ....

E. Okamoto and K. Tanaka, Key distribution system based on identification information, IEEE J. Selected Areas Commun. SAC-7 (1989), 481-485.

....signatures later. This simplifies the security problems, since it is not necessary to worry about monitoring a large secure authenticated file of information about users. There are several identity based cryptosystems that serve not only to authorize users, but also to generate session keys [3, 20, 23, 35, 36, 40]. They could be used very effectively in settings like that of the Sun NFS. Unfortunately, their running times are all comparable to those of the RSA and Diffie Hellman systems. It is desirable to find a scheme of this kind that would be as fast as some of the signature schemes that are known, ....

E. Okamoto, Key distribution systems based on identification information, Advances in Cryptology: Proceedings of Crypto '87, C. Pomerance, ed., Lecture Notes in Computer Science 293, Springer-Verlag, NY (1988), 194-202.

....Second, it actually applies to a weaker notion of security, thereby providing a stronger result. This stronger result is used in proving our lower bound on communicating schemes which is described in the next paragraph. Other works dealing with non communicating schemes in our setting are [4, 5, 6, 7]. The large lower bound (for big conferences and coalitions) raises the question whether communication could be of help in reducing the size of pieces. Communication has some subtle implications on the security requirement (see section 5 for details) Just like the non communicating schemes, we ....

E. Okamoto and K. Tanaka. Key distribution system based on identification information. IEEE Journal on Selected Areas in Communications, 7(4):481--485, 1989.

No context found.

E. Okamoto and K. Tanaka, Key Distribution System Based on Identification Information, IEEE J. Selected Areas in Communications 7 (1989), 481--485.

No context found.

E. Okamoto and K. Tanaka, "Key distribution system based on identification information", IEEE J. Selected Areas in Comm. 7 No.4 (May 1989), 481-485.

No context found.

E. Okamoto. Key distribution system based on identification information. In Advances in Cryptology - CRYPTO '87, LNCS 293, pp. 194-202, Spring-Verlag, 1987.

No context found.

E. Okamoto and K. Tanaka, Key Distribution System Based on Identification Information, IEEE Journal on Selected Areas in Communications, vol. 7, no. 4, May 1989, pp. 481--485.

No context found.

E. Okamoto. Key distribution systems based on identification information. Advances in Cryptology, CRYPTO 88, Lecture Notes in Computer Science, vol. 403, S. Goldwasser ed., Springer-Verlag, pages 194--202, 1989.

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