File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/CIS.2012.110
- Scopus: eid_2-s2.0-84873563147
- WOS: WOS:000318241200102
Supplementary
- Citations:
- Appears in Collections:
Conference Paper: A secure public key encryption from computational linear Diffe-Hellman problem
Title | A secure public key encryption from computational linear Diffe-Hellman problem |
---|---|
Authors | |
Keywords | CCA secure DLDH assumption Public key encryption |
Issue Date | 2012 |
Citation | Proceedings of the 2012 8th International Conference on Computational Intelligence and Security, CIS 2012, 2012, p. 464-468 How to Cite? |
Abstract | This paper proposes a practical public key encryption scheme which is provable chosen cipher text(CCA) secure based on the gap computational linear Diffie-Hellman assumption in the standard model. This is the first CCA secure scheme based on the gap computational linear Diffie-Hellman assumption. This scheme is efficient and the proof of the security is tight. We also reduce the size of the public key from n to 2√n based on the twin gap computational linear Diffie-Hellman assumption. And the time for encryption and decryption is significantly reduced. And we point out that a generalization of the scheme can be constructed similarly based on the gap k-computational linear assumption. © 2012 IEEE. |
Persistent Identifier | http://hdl.handle.net/10722/311936 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Tian, Fengqing | - |
dc.contributor.author | Xue, Haili | - |
dc.contributor.author | Xue, Haiyang | - |
dc.date.accessioned | 2022-04-06T04:31:48Z | - |
dc.date.available | 2022-04-06T04:31:48Z | - |
dc.date.issued | 2012 | - |
dc.identifier.citation | Proceedings of the 2012 8th International Conference on Computational Intelligence and Security, CIS 2012, 2012, p. 464-468 | - |
dc.identifier.uri | http://hdl.handle.net/10722/311936 | - |
dc.description.abstract | This paper proposes a practical public key encryption scheme which is provable chosen cipher text(CCA) secure based on the gap computational linear Diffie-Hellman assumption in the standard model. This is the first CCA secure scheme based on the gap computational linear Diffie-Hellman assumption. This scheme is efficient and the proof of the security is tight. We also reduce the size of the public key from n to 2√n based on the twin gap computational linear Diffie-Hellman assumption. And the time for encryption and decryption is significantly reduced. And we point out that a generalization of the scheme can be constructed similarly based on the gap k-computational linear assumption. © 2012 IEEE. | - |
dc.language | eng | - |
dc.relation.ispartof | Proceedings of the 2012 8th International Conference on Computational Intelligence and Security, CIS 2012 | - |
dc.subject | CCA secure | - |
dc.subject | DLDH assumption | - |
dc.subject | Public key encryption | - |
dc.title | A secure public key encryption from computational linear Diffe-Hellman problem | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/CIS.2012.110 | - |
dc.identifier.scopus | eid_2-s2.0-84873563147 | - |
dc.identifier.spage | 464 | - |
dc.identifier.epage | 468 | - |
dc.identifier.isi | WOS:000318241200102 | - |