Improving Security and Efficiency in Attribute-Based Data Sharing

S Aishwarya

Abstract


With the recent adoption and diffusion of the data sharing paradigm in distributed systems such as online social networks or cloud computing, there have been increasing demands and concerns for distributed data security. One of the most challenging issues in data sharing systems is the enforcement of access policies and the support of policies updates. Ciphertext policy attribute-based encryption (CP-ABE) is becoming a promising cryptographic solution to this issue. It enables data owners to define their own access policies over user attributes and enforce the policies on the data to be distributed. However, the advantage comes with a major drawback which is known as a key escrow problem. The key generation center could decrypt any messages addressed to specific users by generating their private keys. This is not suitable for data sharing scenarios where the data owner would like to make their private data only accessible to designated users. In addition, applying CP-ABE in the data sharing system introduces another challenge with regard to the user revocation since the access policies are defined only over the attribute universe. Therefore, in this study, we propose a novel CP-ABE scheme for a data sharing system by exploiting the characteristic of the system architecture. The proposed scheme features the following achievements: (1) the key escrow problem could be solved by escrow-free key issuing protocol, which is constructed using the secure two-party computation between the key generation center and the data storing center, (2) fine-grained user revocation per each attribute could be done by proxy encryption which takes advantage of the selective attribute group key distribution on top of the ABE. The performance and security analyses indicate that the proposed scheme is efficient to securely manage the data distributed in the data sharing system.

Keywords


Data sharing, attribute-based encryption, revocation, access control, removing escrow.

References


J. Anderson, ”Computer Security Planning Study,” Technical report 73-51, Air Force Electronic System Division, 1972.

L. Ibraimi, M. Petkovic, S. Nikova, P. Hartel, W. Jonker, ”Mediated Ciphertext-Policy Attribute-Based Encryption and Its Application,” Proc. WISA 2009, LNCS 5932, pp. 309–323, 2009.

A. Sahai, B. Waters, ”Fuzzy Identity-Based Encryption,” Proc. Eurocrypt 2005, pp. 457–473, 2005.

V. Goyal, O. Pandey, A. Sahai, B. Waters, ”Attribute-Based Encryption for Fine-Grained Access Control of Encrypted Data,”Proc. ACM Conference on Computer and CommunicationsSecurity 2006, pp. 89–98, 2006.

J. Bethencourt, A. Sahai, B. Waters, ”Ciphertext-Policy Attribute-Based Encryption,” Proc. IEEE Symposium on Security and Privacy 2007, pp. 321–334, 2007.

R. Ostrovsky, A. Sahai, B. Waters, ”Attribute-Based Encryption with Non-Monotonic Access Structures,” Proc. ACM Conference on Computer and Communications Security 2007, pp. 195–203, 2007.

A. Lewko, A. Sahai, B. Waters, ”Revocation Systems with Very Small Private Keys,” Proc. IEEE Symposium on Security and Privacy 2010, pp. 273–285, 2010.

A. Boldyreva, V. Goyal, V. Kumar, ”Identity-Based Encryption with Efficient Revocation,” Proc. ACM Conference on Computer and Communications Security 2008, pp. 417–426, 2008.

N. Attrapadung, H. Imai, ”Conjunctive Broadcast and Attribute-Based Encryption,” Proc. Pairing 2009, LNCS 5671, pp. 248–265, 2009.

M. Pirretti, P. Traynor, P. McDaniel, B. Waters, ”Secure Attribute-Based Systems,” Proc. ACM Conference on Computer and Communications Security 2006, 2006.

S. Rafaeli, D. Hutchison, ”A Survey of Key Management for Secure Group Communicationc,” ACM Computing Surveys, vol. 35, no 3, pp. 309–329, 2003.

P. Golle, J. Staddon, M. Gagne, P. Rasmussen, ”A Content- Driven Access Control System,” Proc. Symposium on Identity and Trust on the Internet, pp. 26–35, 2008.

S. Yu, C. Wang, K. Ren, W. Lou, ”Attribute Based Data Sharing with Attribute Revocation,” Proc. ASIACCS ’10, 2010.

S. D. C. Vimercati, S. Foresti, S. Jajodia, S. Paraboschi, P.Samarati, ”Over-encryption: Management of Access Control Evolution on Outsourced Data,” Proc. VLDB’07, 2007.

D. Boneh, M. K. Franklin, ”Identity-based Encryption from the Weil Pairing,” Proc. CRYPTO 2001, LNCS vol. 2139, pp. 213– 229, 2001.

A. Kate, G. Zaverucha, and I. Goldberg, ”Pairing-based onion routing,” Proc. Privacy Enhancing Technologies Symposium 2007, LNCS vol. 4776, pp. 95–112, 2007.

L. Cheung, C. Newport, ”Provably Secure Ciphertext Policy ABE,” ACM Conference on Computer and Communications Security, pp. 456–465, 2007.

V. Goyal, A. Jain, O. Pandey, A. Sahai, ”Bounded Ciphertext Policy Attribute-Based Encryption,” Proc. ICALP, pp. 579–591, 2008.


Full Text: PDF

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

.......................................................................................................................................................................................................................

ISSN  2279 – 0381 |  IST HOMEJOURNAL HOME | Copyright IST 2012-13

.......................................................................................................................................................................................................................