Published in

Association for Computing Machinery (ACM), Operating Systems Review, 4(32), p. 33-39, 1998

DOI: 10.1145/302350.302359

Links

Tools

Export citation

Search in Google Scholar

ID-based Secret-Key Cryptography

Journal article published in 1998 by Marc Joye, Sung-Ming Yen
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

. This paper introduces ID-based secret-key cryptography, in which secret keys are privately and uniquely binded to an identity. This enables to extend publickey cryptography features at the high throughput rate of secret-key cryptography. As applications, efficient login protocols, an enhanced version of Kerberos, and an ID-based MAC algorithm are presented. ID-based systems were initially developed in the context of public-key cryptography by removing the need of explicit public keys. The idea was to derive, in a publicly known way, a public key from an identity. Similarly, in secret-key cryptography, ID-based systems allow authorized entities to derive a secret key from an identity. So, large databases maintaining the correspondence between an identity and the corresponding secret key are no longer required, resulting in better performances and higher security. Indexing terms: ID-based systems, Secret-key cryptography, Authentication protocols, One-time passwords, Kerberos, MACs 1 ...