A. Fi&t d A. Shr, How to Pe Yosrsd/: pmctil olsfio go ide,titio ad zig1l problems. Pc. of Cpt86, Spnger-Ved LNCS 263, (98) pp. 186-194.  Home/Search   Document Not in Database   Summary   Related Articles

....this combination. These cryptographic operations axe done usually, and in our protocol, using conventional cryptosystem such as DES, with a key known to both parties. Alternately, the cryptographic operations may use public key cryptosystems [19] Digital signatures or Zero Knowledge based methods [10, 11] but these alternatives require much more processing. Since the key changes quite rarely, the challenge should ideally be different in every authentication instance (and from security standpoint it better be random ) There are three alternative techniques to guntastee that the challenge ....

....issues of anthentic tion. These works avoid our assumption that the two parties share a secret key. They use an entity, trusted by aJl network processors, caJled usually a ke disfriutior cenge (KDC) The KDC initiaJly shares a secret key with each o( the two parties. Tlese protocols are called t ee pay prof0co , and have been studied extensively, e.g. in [23, 2, 9, 24, 28, 17, 3, 18] Also, most of these pro tocols, e.g. I7, 23, 28] use long messages which makes them unsuitable for low network layers (where the field size devoted to security overhesd should be small) Some require synchronized ....

[Article contains additional citation context not shown here]

A. Fi&t d A. Shr, How to Pe Yosrsd/: pmctil olsfio go ide,titio ad zig1l problems. Pc. of Cpt86, Spnger-Ved LNCS 263, (98) pp. 186-194.

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