TY - GEN
T1 - Gradual identity exposure using attribute-based encryption
AU - Huang, Dijiang
AU - Zhou, Zhibin
AU - Yan, Zhu
PY - 2010
Y1 - 2010
N2 - Many Attribute-Based Encryption (ABE) schemes do not protect receivers' privacy, such that all the attributes to describe the eligible receivers are transmitted in plaintexts. Hidden policy-based ABE schemes have been proposed to protect receivers' privacy by using a construction that requires every user in the system to decrypt the ciphertext using all the attributes they possess, which incurs great computation and communication overhead. To address this issue, in this paper, we propose a new concept - Gradual Identity Exposure (GIE) - to protect data receivers' identity. Our approach is to reveal the receivers' information gradually by allowing ciphertext recipients for decrypting the message using their possessed attributes one-by-one (but not all). If the receiver does not possess one attribute in this procedure, the rest of attributes are still hidden. Compared to hidden-policy based solutions, GIE provides significant performance improvement in terms of reducing both computation and communication overhead. We also present a theoretical framework to model the GIE with several new proposed concepts.
AB - Many Attribute-Based Encryption (ABE) schemes do not protect receivers' privacy, such that all the attributes to describe the eligible receivers are transmitted in plaintexts. Hidden policy-based ABE schemes have been proposed to protect receivers' privacy by using a construction that requires every user in the system to decrypt the ciphertext using all the attributes they possess, which incurs great computation and communication overhead. To address this issue, in this paper, we propose a new concept - Gradual Identity Exposure (GIE) - to protect data receivers' identity. Our approach is to reveal the receivers' information gradually by allowing ciphertext recipients for decrypting the message using their possessed attributes one-by-one (but not all). If the receiver does not possess one attribute in this procedure, the rest of attributes are still hidden. Compared to hidden-policy based solutions, GIE provides significant performance improvement in terms of reducing both computation and communication overhead. We also present a theoretical framework to model the GIE with several new proposed concepts.
KW - Identity
KW - Privacy
UR - http://www.scopus.com/inward/record.url?scp=78649232755&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78649232755&partnerID=8YFLogxK
U2 - 10.1109/SocialCom.2010.131
DO - 10.1109/SocialCom.2010.131
M3 - Conference contribution
AN - SCOPUS:78649232755
SN - 9780769542119
T3 - Proceedings - SocialCom 2010: 2nd IEEE International Conference on Social Computing, PASSAT 2010: 2nd IEEE International Conference on Privacy, Security, Risk and Trust
SP - 881
EP - 888
BT - Proceedings - SocialCom 2010
T2 - 2nd IEEE International Conference on Social Computing, SocialCom 2010, 2nd IEEE International Conference on Privacy, Security, Risk and Trust, PASSAT 2010
Y2 - 20 August 2010 through 22 August 2010
ER -