a ciphertext policy attribute-based encryption scheme without pairings

ISCAS OpenIR

	a ciphertext policy attribute-based encryption scheme without pairings
	Zhang Jiang; Zhang Z.
	2012
会议名称	7th China International Conference on Information Security and Cryptography, Inscrypt 2011
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码	324-340
会议日期	November 30, 2011 - December 3, 2011
会议地点	Beijing, China
收录类别	EI
ISSN	0302-9743
ISBN	9783642347030
部门归属	(1) State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences Beijing 100190 China
摘要	Sahai and Waters [34] proposed Attribute-Based Encryption (ABE) as a new paradigm of encryption algorithms that allow the sender to set a policy to describe who can read the secret data. In recent years, lots of attribute-based schemes appeared in literatures, but almost all the schemes, to the best of our knowledge, are constructed from pairings. In this work, we present a ciphertext policy attribute-based encryption (CP-ABE) scheme, which supports and-gates without pairings. Our scheme is defined on q-ary lattices, and has a very strong security proof based on worst-case hardness. More precisely, under the learning with errors (LWE) assumption, our CP-ABE scheme is secure against chosen plaintext attack in the selective access structure model. Though our scheme only encrypts one bit at a time, we point out that it can support multi-bit encryption by using a well-known technique. Besides, our result can be easily extended to ideal lattices for a better efficiency. © 2012 Springer-Verlag Berlin Heidelberg.; Sahai and Waters [34] proposed Attribute-Based Encryption (ABE) as a new paradigm of encryption algorithms that allow the sender to set a policy to describe who can read the secret data. In recent years, lots of attribute-based schemes appeared in literatures, but almost all the schemes, to the best of our knowledge, are constructed from pairings. In this work, we present a ciphertext policy attribute-based encryption (CP-ABE) scheme, which supports and-gates without pairings. Our scheme is defined on q-ary lattices, and has a very strong security proof based on worst-case hardness. More precisely, under the learning with errors (LWE) assumption, our CP-ABE scheme is secure against chosen plaintext attack in the selective access structure model. Though our scheme only encrypts one bit at a time, we point out that it can support multi-bit encryption by using a well-known technique. Besides, our result can be easily extended to ideal lattices for a better efficiency. © 2012 Springer-Verlag Berlin Heidelberg.
关键词	Security Of Data
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/15894
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Zhang Jiang,Zhang Z.. a ciphertext policy attribute-based encryption scheme without pairings[C],2012:324-340.