Open Access Open Access  Restricted Access Subscription or Fee Access

Improving Security and Efficiency in Attribute-Based Data Sharing

J. Venkata Subramanian, A. Pandian, Manish Kumar

Abstract


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 key. so overcome this problem we propose escrow problem which means a written agreement delivered to a third party and Attribute-based encryption (ABE) is a promising Cryptographic approach fine-grained data access control which is provides a way of defining access policies based on different attributes of the requester, environment, or the data object. The KGC can decrypt every cipher text addressed to specific users by generating their attribute keys. This could be a potential threat to the data confidentiality or privacy in the data sharing systems.

Keywords


Improving Security,Efficiency in Attribute-Based Data Sharing,Attribute-based encryption (ABE)

Full Text:

PDF

References


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.

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.

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

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

T. Abraham, IDDM: Intrusion Detection Using Data Mining Techniques,

R. Agrawal, T. Imielinski, and A. Swami, ―Mining Association Rules between Sets of Items in Large Databases,‖ Proc. ACM SIGMOD, vol. 22, no. 2, pp. 207-216, 1993.

N.B. Amor, S. Benferhat, and Z. Elouedi, ―Naive Bayes vs. Decision Trees in Intrusion Detection Systems,‖ Proc. ACM Symp. Applied Computing (SAC ’04), pp. 420-424, 2004.

R. Bace and P. Mell, Intrusion Detection Systems, Computer Security Division, Information Technology Laboratory, Nat’l Inst. of Standards and Technology, 2001.

D. Boughaci, H. Drias, A. Bendib, Y. Bouznit, and B. Benhamou, ―Distributed Intrusion Detection Framework Based on Mobile Agents,‖ Proc. Int’l Conf. Dependability of Computer Systems (DepCoS-RELCOMEX ’06), pp. 248-255, 2006.

Y.Bouzida and S. Gombault, ―Eigenconnections to Intrusion Detection,‖ Security and Protection in Information Processing Systems, pp. 241-258, 2004.

KDD Cup 1999 Intrusion Detection Data, http://kdd.ics.uci.edu/ databases/kddcup99/kddcup99.html, 2010.

Overview of Attack Trends, http://www.cert.org/archive/pdf/ attack_trends.pdf, 2002.

Probabilistic Agent Based Intrusion Detection, http://www.cse.sc. edu/research/isl/agentIDS.shtml, 2010.

SANS Institute—Intrusion Detection FAQ, http://www.sans.org/ resources/idfaq/, 2010.


Refbacks

  • There are currently no refbacks.


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