deterministic public key encryption and identity-based encryption from lattices in the auxiliary-input setting

ISCAS OpenIR

	deterministic public key encryption and identity-based encryption from lattices in the auxiliary-input setting
	Xie Xiang; Xue Rui; Zhang Rui
	2012
会议名称	8th International Conference on Security and Cryptography for Networks, SCN 2012
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码	1-18
会议日期	September 5, 2012 - September 7, 2012
会议地点	Amalfi, Italy
收录类别	EI
ISSN	0302-9743
ISBN	9783642329272
部门归属	(1) Institute of Software Chinese Academy of Sciences China; (2) State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences China
摘要	Deterministic public key encryption (D-PKE) provides an alternative to randomized public key encryption in various scenarios (e.g. search on encrypted data) where the latter exhibits inherent drawbacks. In CRYPTO'11, Brakerski and Segev formalized a framework for studying the security of deterministic public key encryption schemes with respect to auxiliary inputs. A trivial requirement is that the plaintext should not be efficiently recoverable from the auxiliary inputs. In this paper, we present an efficient deterministic public key encryption scheme in the auxiliary-input setting from lattices. The public key size, ciphertext size and ciphertext expansion factor are improved compared with the scheme proposed by Brakerski and Segev. Our scheme is also secure even in the multi-user setting where related messages may be encrypted under multiple public keys. In addition, the security of our scheme is based on the hardness of the learning with errors (LWE) problem which remains hard even for quantum algorithms. Furthermore, we consider deterministic identity-based public key encryption (D-IBE) in the auxiliary-input setting. The only known D-IBE scheme (without considering auxiliary inputs) in the standard model was proposed by Bellare et al. in EUROCRYPT'12. However, this scheme is only secure in the selective security setting, and Bellare et al. identified it as an open problem to construct adaptively secure D-IBE schemes. The second contribution of this work is to propose a D-IBE scheme from lattices that is adaptively secure. © 2012 Springer-Verlag.; Deterministic public key encryption (D-PKE) provides an alternative to randomized public key encryption in various scenarios (e.g. search on encrypted data) where the latter exhibits inherent drawbacks. In CRYPTO'11, Brakerski and Segev formalized a framework for studying the security of deterministic public key encryption schemes with respect to auxiliary inputs. A trivial requirement is that the plaintext should not be efficiently recoverable from the auxiliary inputs. In this paper, we present an efficient deterministic public key encryption scheme in the auxiliary-input setting from lattices. The public key size, ciphertext size and ciphertext expansion factor are improved compared with the scheme proposed by Brakerski and Segev. Our scheme is also secure even in the multi-user setting where related messages may be encrypted under multiple public keys. In addition, the security of our scheme is based on the hardness of the learning with errors (LWE) problem which remains hard even for quantum algorithms. Furthermore, we consider deterministic identity-based public key encryption (D-IBE) in the auxiliary-input setting. The only known D-IBE scheme (without considering auxiliary inputs) in the standard model was proposed by Bellare et al. in EUROCRYPT'12. However, this scheme is only secure in the selective security setting, and Bellare et al. identified it as an open problem to construct adaptively secure D-IBE schemes. The second contribution of this work is to propose a D-IBE scheme from lattices that is adaptively secure. © 2012 Springer-Verlag.
关键词	Crystal Lattices Quantum Theory Security Of Data
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/15793
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Xie Xiang,Xue Rui,Zhang Rui. deterministic public key encryption and identity-based encryption from lattices in the auxiliary-input setting[C],2012:1-18.