TY - JOUR
T1 - How to Hide the Real Receiver under the Cover Receiver
T2 - CP-ABE with Policy Deniability
AU - Chi, Po Wen
AU - Wang, Ming Hung
AU - Shiu, Hung Jr
N1 - Publisher Copyright:
© 2013 IEEE.
PY - 2020
Y1 - 2020
N2 - Attribute-based encryption (ABE) is a useful tool for sharing an encrypted data to a target group. In a ciphertext-policy ABE (CP-ABE) scheme, a ciphertext includes a policy to indicate its receivers and only those receivers can correctly decrypt the ciphertext. Since this design leaks the receiver identity, it may raise a new security issue about user privacy. Some hidden-policy ABE schemes, where the policy is secretly protected, are proposed to keep user privacy. However, these hidden-policy ABE schemes rely on the user trying all possibilities to decide if it belongs to the wanted receiver group. The decryption costs too much and every potential receiver will run the decryption process in vain since it does not know the policy. In this work, we apply the deniability concept to solve this problem. The encryption scheme allows the sender to claim the ciphertext is for some receiver group while actually it is for another receiver group. Both receiver groups can correctly decrypt the ciphertext except that the real group can get the real message and the cover group will get the cover message. While coercion, the sender can definitely claim the ciphertext is for the cover group and the real group is kept confidential.
AB - Attribute-based encryption (ABE) is a useful tool for sharing an encrypted data to a target group. In a ciphertext-policy ABE (CP-ABE) scheme, a ciphertext includes a policy to indicate its receivers and only those receivers can correctly decrypt the ciphertext. Since this design leaks the receiver identity, it may raise a new security issue about user privacy. Some hidden-policy ABE schemes, where the policy is secretly protected, are proposed to keep user privacy. However, these hidden-policy ABE schemes rely on the user trying all possibilities to decide if it belongs to the wanted receiver group. The decryption costs too much and every potential receiver will run the decryption process in vain since it does not know the policy. In this work, we apply the deniability concept to solve this problem. The encryption scheme allows the sender to claim the ciphertext is for some receiver group while actually it is for another receiver group. Both receiver groups can correctly decrypt the ciphertext except that the real group can get the real message and the cover group will get the cover message. While coercion, the sender can definitely claim the ciphertext is for the cover group and the real group is kept confidential.
KW - Attribute-based encryption
KW - deniable encryption
KW - identity-based encryption
UR - http://www.scopus.com/inward/record.url?scp=85085580467&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85085580467&partnerID=8YFLogxK
U2 - 10.1109/ACCESS.2020.2993688
DO - 10.1109/ACCESS.2020.2993688
M3 - Article
AN - SCOPUS:85085580467
SN - 2169-3536
VL - 8
SP - 89866
EP - 89881
JO - IEEE Access
JF - IEEE Access
M1 - 9090883
ER -