Fig. 5. Linkages from different sites to the Server
ABE Implementation Code
The code below illustrates the detailed working of ABE using Rivest Shamir and Adleman (RSA) algorithm as the base public key cryptosystem.
i m p o r t Crypto from Crypto Public Key i m p o r t RSA from Crypto i m p o r t Random i m p o r t a s t i m p o r t time d e f r s a e n c (t e x t) : r a n d o m g e n e r a t o r = Random . new ( ) . r e a d key = RSA . g e n e r a t e ( 1 0 2 4 , r a n d o m g e n e r a t o r ) p u b l i c k e y = key . p u b l i c k e y ( ) p r i n t (”####################”) p r i n t ( ” p r o c e s s b e g i n s ” ) p r i n t (”####################”) t i me . s l e e p ( 2 ) p r i n t (”####################”) p r i n t ( ” Marks a r e e n t e r e d and s e n t t o KGC” ) p r i n t (”####################”) t i me . s l e e p ( 2 ) p r i n t (”####################”) p r i n t ( ” E n c r y p t i o n b e g i n s ” ) p r i n t (”####################”) e n c r y p t e d = p u b l i c k e y . e n c r y p t ( t e x t . encode ( ’ u t f 8 ’) , 32 ) t i me . s l e e p ( 2 ) p r i n t ( ” ENCRYPTED TEXT” , e n c r y p t e d ) f = open ( ’ e n c r y p t i o n . t x t ’ , ’w’ ) f . w r i t e ( s t r ( e n c r y p t e d ) ) f . c l o s e ( ) t i me . s l e e p ( 2 ) p r i n t (”####################”) p r i n t ( ” s t u d e n t p a n e l ” ) p r i n t (”####################”) p r i n t ( ” i f you a r e s t u d e n t t h e n e n t e r you d e p a r t m e n t ” ) d e p t = i n p u t ( ) p r i n t ( ” p l e a s e e n t e r you g r a d u a t i o n l e v e l ” ) g r a d l e v e l = i n p u t ( ) i f ( d e p t == ”MA” and g r a d l e v e l == ”MSC” or g r a d l e v e l == ”PHD” ) : f = open ( ’ e n c r y p t i o n . t x t ’ , ’ r ’ ) message = f . r e a d ( ) d e c r y p t e d = key . d e c r y p t ( a s t . l i t e r a l e v a l ( s t r ( e n c r y p t e d ) ) ) p r i n t ( ’ d e c r y p t e d ’ , d e c r y p t e d ) f = open ( ’ d e c r y p t i o n . t x t ’ , ’w’ ) f . w r i t e ( s t r ( message ) ) f . w r i t e ( s t r ( d e c r y p t e d ) ) f . c l o s e ( ) e l s e : p r i n t ( ” S o r r y you c a n t view someone e l s e marks ” ) p r i n t ( ” e n t e r your marks ” ) marks= i n p u t ( ) r s a e n c ( marks )
The ABE algorithm is implemented using RSA algorithm for the encryption of data. The process illustrated for the code development is based on a scenario of a college professor sending the marks to a group of students belonging to the department of mathematics and the student should be either enrolled for the course MSC or PhD under the department of mathematics. The implementation begins with asking the professor to enter the marks. The Professor enters the mark and the process begins, the Key Generation Center will generate the Secret Key based on the Public attributes of the receiving group and a random number.
Then the encryption starts, the encryption is done based on the public key crypto system. The public key cryptosystem can be any, in this implementation of attribute-based encryption, RSA Cryptosystem is chosen. Based on public attributes already shared and the random number generated by the random generator, the encryption will be performed based on attribute-based encryption. RSA algorithm makes use of modulus operation to perform encryption and decryption. The encryption is done using the public key of the receiver and the decryption is performed based on the matching private key of the receiver, whose key was used for encryption. encrypted = publickey.encrypt(text.encode(’utf-8’),32), indicates the conversion of the plain text into a cipher text. The encoding scheme helps to make the cipher text in the human non-readable form. Encryption is done and the cipher text generated which is human non-readable and in the encoded format. From the student panel, the legitimate authenticated group of students who has the rights to view the marks that was send by the Professor. It asks the student to enter
the group details. The group details are the department they below to and the course they are enrolled for. The sample group considered in the implementation is the student should belong to Mathematics Department, i.e. MA department and the student should be either an MSC or PHD Student. If and only if the student belongs to these categories the decryption can be performed, and the student can view the data which is the marks. The student is asked to enter the department, the student belongs to and as a next level of security, the student is again asked to enter the graduation level of studies. Hence after the student enters the details, based on mathematical operations such as AND and OR, the decryption will be done using the secret key generated by the Key Generation Center. Hence the decryption is done, and the marks is visible to the student. If the student enters the wrong combination of decryption factors the marks will not be decrypted and will not be visible.
CONCLUSION
As a part of research work done with respect to ensuring privacy in big data, Snort and AWStats automated web log analyzing tool is studied and explained in detail. This tool helps to identify the different kinds of attacks that happened to a particular application or web server. Hence upon understanding the pattern of different attacks, necessary precautions have to be made to prevent the same attack from happening again. these tools not only help us notify about certain security issues and loopholes of a system but also helps to achieve some other objectives as well. Both the tools can help provide real time monitoring of the system to help improve security and privacy and at the same time keeps track of the network from any unwanted intrusions which might cause trouble to the system. They help to provide the admin of the system with valuable information like bad IP addresses and helps them block or blacklist those IP addresses while also informing the admin about what is coming through certain IP addresses and who are sending those. These applications help secure the system from bots and crawlers, while also provides certain information like bandwidth control and hits which can help the admin to improve their system and figure out scope of improvement which sometimes can be of much more value for research and development. In order to protect data and provide data confidentiality while broadcasting the information from the cloud to a group of users, ABE cryptosystem is discussed. Different public key cryptosystem is mentioned with reference to the drawbacks. To rectify the security issues with public key cryptosystem, identity-based encryption scheme is introduced where user identity is used for encryption and the secret key is generated by the key generation center based on public attributes and user identity. Recognizing the shortcoming of Identity based encryption scheme, which is one to one secure communication scheme, attribute-based encryption scheme is identified. This enables a secure broadcast communication. The encryption is done using group identity and the decryption is done using the secret key generated based on the group identity.
As future scope, HE technique can combined with the attribute-based encryption, which enables the transfer of Identity from the user to the key generation center in the cipher text.
ACKNOWLEDGEMENT
We would like to express our sincere appreciation to our beloved professor Dr. Jinan Fiaidhi from Lakehead University for her constant support and guidance without which this would not had been possible at all. We are truly grateful for her unwavering support throughout this whole period of time and for giving us this opportunity to work with her under her guidance and achieve what we have done today. With her help, we have come to learn of new technologies and research methods which we were not aware of before and this has helped us with our own research where we came to know many new ideas and concepts. We would also like to thank Lakehead University for providing us a platform of such manner where we could work at our fullest and get all these opportunities given to us through the course of our studies.
REFERENCES
  1. Yujiao Song, 1 HaoWang, 1, 2 XiaochaoWei, 1 and LeiWu 1, 3, “Efficient Attribute-Based Encryption with Privacy-Preserving Key Generation and Its Application in Industrial Cloud,” Hindawi Security and Communica- tion Networks.
  2. V. Goyal, O. Pandey, A. Sahai, and B. Waters, “Attribute-based encryption for fine-grained access control of encrypted data,” in Proceedings of the 13th ACM Conference on Computer and Communications Security, (CCS ’06), pp. 89–98, Alexandria, VA, USA, November 2006.
  3. Khushboo Wadhwani, “Big Data Challenges and Solutions”, Technical Report Bradley University.
  4. Min Zhoa E, Yang Geng, “Homomorphic Encryption Technology for Cloud Computing”, 8th International Congress of Information and Com- munication Technology, ICICT 2019.
  5. Aderemi A. Atayero*, Oluwaseyi Feyisetan, “Security Issues in Cloud Computing: The Potentials of Homomorphic Encryption”, VOL. 2, NO. 10, October 2011, Journal of Emerging Trends in Computing and Information Sciences
  6. https://www.nltechno.com/awstats/awstats.pl? month=01year=2018output=mainconfig=destailleur. frframename=index