ID-based cryptography using symmetric primitives

Authors:
Chris J. Mitchell;Fred C. Piper;Peter R. Wild
Affiliations:
Information Security Group, Royal Holloway, University of London, Egham, UK TW20 0EX;Information Security Group, Royal Holloway, University of London, Egham, UK TW20 0EX;Information Security Group, Royal Holloway, University of London, Egham, UK TW20 0EX
Venue:
Designs, Codes and Cryptography
Year:
2007

Citing 10
Cited 0

A Non-interactive Public-Key Distribution System

Designs, Codes and Cryptography
Secure communications over insecure channels

Communications of the ACM
The BiBa one-time signature and broadcast authentication protocol

CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Handbook of Applied Cryptography

Handbook of Applied Cryptography
Better than BiBa: Short One-Time Signatures with Fast Signing and Verifying

ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
On the Key Predistribution System: A Practical Solution to the Key Distribution Problem

CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
A Certified Digital Signature

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Provably Unforgeable Signatures

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
On the Efficiency of One-Time Digital Signatures

ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Constructing identity-based cryptosystems for discrete logarithm based cryptosystems

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A general method for deriving an identity-based public key cryptosystem from a one-way function is described. We construct both ID-based signature schemes and ID-based encryption schemes. We use a general technique which is applied to multi-signature versions of the one-time signature scheme of Lamport and to a public key encryption scheme based on a symmetric block cipher which we present. We make use of one-way functions and block designs with properties related to cover-free families to optimise the efficiency of our schemes.