Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
470503 | Computers & Mathematics with Applications | 2013 | 10 Pages |
Abstract
We first construct an efficient IND-sID-CPA secure IBE cryptosystem from ideal lattices, and proceed with its security proof under the standard model in detail. Then with an asymptotically efficient strongly unforgeable one-time signature, we propose a new CCA secure public key encryption (PKE) scheme over ideal lattices by universal paradigm of IBE transformation. Performance of the resulting PKE system is very close to the underlying IBE scheme and its security can be tightly reduced to decisional R-LWE hardness assumption. Compared with known CCA secure PKE schemes from standard lattices, our new scheme is simpler and more efficient.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Xiao-yuan Yang, Li-qiang Wu, Min-qing Zhang, Xiao-Feng Chen,