Efficient identity-based key encapsulation to multiple parties
We introduce the concept of identity based key encapsulation to multiple parties (mID-KEM), and define a security model for it. This concept is the identity based analogue of public key KEM to multiple parties. We also analyse possible mID-KEM constructions, and propose an efficient scheme based on...
Saved in:
| Published in | Cryptography and Coding pp. 428 - 441 |
|---|---|
| Main Authors | , |
| Format | Conference Proceeding Book Chapter |
| Language | English |
| Published |
Berlin, Heidelberg
Springer
2005
Springer Berlin Heidelberg |
| Series | Lecture Notes in Computer Science |
| Subjects | |
| Online Access | Get full text |
| ISBN | 354030276X 9783540302766 |
| ISSN | 0302-9743 1611-3349 |
| DOI | 10.1007/11586821_28 |
Cover
| Summary: | We introduce the concept of identity based key encapsulation to multiple parties (mID-KEM), and define a security model for it. This concept is the identity based analogue of public key KEM to multiple parties. We also analyse possible mID-KEM constructions, and propose an efficient scheme based on bilinear pairings. We prove our scheme secure in the random oracle model under the Gap Bilinear Diffie-Hellman assumption. |
|---|---|
| ISBN: | 354030276X 9783540302766 |
| ISSN: | 0302-9743 1611-3349 |
| DOI: | 10.1007/11586821_28 |