Abstract | ||
---|---|---|
A scheme for general group oriented ID-based cryptosys- tems is proposed. This scheme allows an authorized sub- set in the general access structure to cooperatively de- crypt the ciphertext of a message. It is constructed using bi-linear pairings. Its security is based on the intractabil- ity of the computational bilinear Diffie-Hellman problem. The scheme possesses chosen-plaintext security in the ran- dom oracle model. |
Year | Venue | Keywords |
---|---|---|
2008 | I. J. Network Security | id-based cryptog- raphy,general access structure,chosen plaintext security,group oriented cryptosystems,id based cryptography,it security,diffie hellman |
Field | DocType | Volume |
Ciphertext indistinguishability,Computer security,Computer science,Random oracle,Computer network,Encryption,Cryptosystem,Ciphertext,ID-based cryptography,Access structure,Plaintext | Journal | 6 |
Issue | ISSN | Citations |
1 | 18163548 | 3 |
PageRank | References | Authors |
0.42 | 10 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Chunxiang Xu | 1 | 185 | 27.83 |
Junhui Zhou | 2 | 3 | 1.44 |
GuoZhen Xiao | 3 | 239 | 28.18 |