This document proposes a new encryption scheme called compact summation key encryption for secure data sharing in hybrid cloud storage. It aims to address limitations of existing approaches like predefined hierarchical schemes, attribute-based encryption, and identity-based encryption which cannot provide security to individual files or have non-constant size keys. The new scheme uses five algorithms: setup, key generation, encryption, extraction and decryption. It generates constant size public and master secret keys. Encryption uses file indexes and bilinear groups to create ciphertexts. Extraction combines decryption keys into a single compact summation key using bilinear pairing operations. This key can then decrypt ciphertexts for multiple file indexes, improving flexibility and efficiency of secure data sharing in cloud storage.
Key-Aggregate Searchable Encryption (KASE) for Group Data Sharing via Cloud S...1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
Cryptography is a process used for sending information in secret way. Goal of this process is to provide protection for information but in different way. In this paper our motive to represent a new method for protection that is generated by combination of RSA and 2 bit rotation mechanism of cryptography. There are many algorithms exist for this process. For cryptography there are algorithms like RSA, IDEA, AES, and DES but here we are using only one algorithm from these that is RSA which is enough to implement combined process using 2 bit rotation. The encrypted image is used as input for network for further implementation.RSA encrypt image with 1 bit rotation. In 1 bit rotation only 1 bit is shifted and at decrypt side shifted bit are reversed. But to make it more secure we are going to perform 2 bit rotation due to which it is more secure as compared to existing algorithm. After applying the 2 bit rotation we perform the permutation of that image that will give us encrypted image. Shivam Kumar | Dr. Ganesh D "Image Cryptography using RSA Algorithm" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-5 | Issue-4 , June 2021, URL: https://www.ijtsrd.compapers/ijtsrd42408.pdf Paper URL: https://www.ijtsrd.comcomputer-science/computer-security/42408/image-cryptography-using-rsa-algorithm/shivam-kumar
Key-Aggregate Searchable Encryption (KASE) for Group Data Sharing via Cloud S...1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
Cryptography is a process used for sending information in secret way. Goal of this process is to provide protection for information but in different way. In this paper our motive to represent a new method for protection that is generated by combination of RSA and 2 bit rotation mechanism of cryptography. There are many algorithms exist for this process. For cryptography there are algorithms like RSA, IDEA, AES, and DES but here we are using only one algorithm from these that is RSA which is enough to implement combined process using 2 bit rotation. The encrypted image is used as input for network for further implementation.RSA encrypt image with 1 bit rotation. In 1 bit rotation only 1 bit is shifted and at decrypt side shifted bit are reversed. But to make it more secure we are going to perform 2 bit rotation due to which it is more secure as compared to existing algorithm. After applying the 2 bit rotation we perform the permutation of that image that will give us encrypted image. Shivam Kumar | Dr. Ganesh D "Image Cryptography using RSA Algorithm" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-5 | Issue-4 , June 2021, URL: https://www.ijtsrd.compapers/ijtsrd42408.pdf Paper URL: https://www.ijtsrd.comcomputer-science/computer-security/42408/image-cryptography-using-rsa-algorithm/shivam-kumar
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
SECURING DIGITAL IMAGES USING WATERMARKING TECHNIQUE AND TRIPLE DES ALGORITHMJournal For Research
Multimedia security is very important issue for the today's internet technology because of duplication, distribution and exchanging if multimedia data. Digital watermarking is the method of shielding digital data in multimedia.Multimedia consist of image, audio, video, text, etc. In watermarking the secret information are implanted into the original data for protecting the ownership rights of the multimedia data. Basically watermarking has three domains.1) Spatial domain 2) Transform domain 3) Wavelet domain. This paper consist Discrete Cosine Transform which is the frequency domain works on the transform coefficient of the image. Three different keys are generated using Triple DES algorithm.
Security analysis of fbdk block cipher for digital imageseSAT Journals
Abstract Network security is one of the major concerns in the modern world. In this regard, a strong security technique is required to protect user data. Cryptography techniques plays an important role in secured transmission through encryption of data and thus ensuring integrity, authenticity, confidentiality of information. Several encryption algorithms have been proposed like AES (Advanced Encryption Standard), DES (Data Encryption Standard) and RSA. These provide very good encryption for text applications. However, these encryption schemes appear not to be ideal for image applications. Some algorithms like GKSBC and RC6 provide very good encryption for digital images. New techniques are emerging that are aimed at providing secured transmission of images over networks. The FBDK (Fixed Block with Dynamic Key Size) block cipher is a new cryptography technique designed using simple operations like XOR, substitutions, circular shifting. The FBDK algorithm is applicable for blocks of any size with key size being dynamic for each block. It does not involve any complex mathematical operations like modular exponentiation. It is a hybrid cryptography technique based on symmetric key and asymmetric key cryptosystems. This paper investigates the security of FBDK block cipher for digital images against brute-force attack, statistical analysis and Differential analysis attacks. In this paper, various security analysis tests has been discussed which are helpful in finding out whether the FBDK encryption algorithm can do secure encryption or not. Experimental results proves the security and efficiency of FBDK cipher for images against all aforementioned types of attacks which justifies its consideration for real time image applications. Keywords: Cryptography, Ciphers, Encryption, Security, and cryptanalysis.
RSA Based Secured Image Steganography Using DWT ApproachIJERA Editor
The need for keeping safe secrecy of secret and sensitive data has been ever increasing with the new
developments in digital system. In this paper, we present an increased way for getting embedding encrypted
secret facts in gray scale images to give high level safety of facts for news over unsecured narrow channels
Cryptography and Steganography are two closely related techniques are used in proposed system. Cryptography
gets into making one of religion the secret note into a non-recognizable chipper. Steganography is then sent in
name for using Double-Stegging to fix this encrypted data into a cover thing by which something is done and
keeps secret its existence.
Multi Owner Data Sharing & Outsourced Revocation Using Identity Based Encrypt...Eswar Publications
Cloud computing is an economical and effective solution for sharing group resource among cloud users. Unfortunately, sharing data in a multi-owner manner while protect data and identity privacy from an un trusted cloud is still a challenging issue, due to the recurrent change of the membership.The major aims of this method a secure multi-owner data sharing scheme.That is any user in the group can securely share data with others by un trusted cloud. Moreover, the real identities of data owners can be exposed by the group manager when disputes occur. User revocation can be achieved by a novel revocation list and no need to update the secret Keys of the
remaining users.The drawback of IBE is computation over head. To overcome the drawback introduces outsourcing computation.
Secured architecture for multi cloud using key aggregation techniqueeSAT Journals
Abstract Data storage and data sharing is the most important aspect in cloud computing, so sharing data and storing it in a secure way is the biggest task when adopting cloud services. In this paper, we will discuss how to share and store data effectively which will prevent the third party to access the secure data in cloud storage. This article provides a survey of using multiple clouds to achieve a security. In this we are introducing a public-key encryption known as Key-aggregate Cryptosystem (KAC). Cryptography is a technique which encodes a data using some key and produces unreadable data so that only a desired party is able to decode that data. KAC produces a constant size ciphertexts (unreadable data) such that decryption right for any set of ciphertexts are possible, means one can aggregate any set of secret keys and make them as compact as single key, but encompassing the power of all the keys being aggregate. This aggregate key is sent to other via secure channel (or via email) for decrypting the ciphertext set and remaining files outside the set are remains secret. Keywords: Cloud, multicloud, key-aggregate encryption, data storage, data sharing and security.
The capability of involving the selection sharing encrypted data with different users via public
cloud storage may greatly ease security concerns over not intended data leaks in the cloud. A key
challenge to designing such encryption schemes to be sustainable in the efficient management of
encryption keys. The desired flexibility of sharing any group of selected documents with any group of
users need for something different encryption keys to be used for different documents. However, this
also implies the urgent need of securely distributing to users a large number of keys for both encryption
and search, and those users will have to protected from danger store the received keys, and submit an
equally large number of keyword trapdoors to the cloud in order to perform search over the shared data
implied need for secure communication, storage, and complexity clearly to give to someone the
approach impractical. In this work a data owner only needs to distribute a single key to a user for
sharing a very large number of documents, and the user only needs to submit a single trapdoor to the
cloud for querying the shared documents. User Revocation is used for Key Updation. Forward Secrecy
and Backward Secrecy is used.
Security Issues related with cloud computingIJERA Editor
The term CLOUD means Common Location Independent Online Utility on Demand. It‟s an emerging technology in IT industries. Cloud technologies are improving day by day and now it become a need for all small and large scale industries. Companies like Google, Amazon, Microsoft etc. is providing virtualized environment for user by which it omits the need for physical storage and others. But as the advantage of cloud computing is increasing day by day the issues are also threatening the IT industries. These issues related with the security of the data. The basic idea of this review paper is to elaborate the security issues related with cloud computing and what methods are implemented to improve these security. Certain algorithms like RSA, DES, and Ceaser Cipher etc. implemented to improve the security issues. In this paper we have implemented Identity based mRSA algorithm in this paper for improving security of data.
Comparison of Secret Splitting, Secret Sharing and Recursive Threshold Visual...TELKOMNIKA JOURNAL
The secret sharing is a method to protect confidentiality and integrity of the secret messages by distributing the message shares into several recipients. The secret message could not be revealed unless the recipients exchange and collect shares to reconstruct the actual message. Even though the attacker obtain shares shadow during the share exchange, it would be impossible for the attacker to understand the correct share. There are few algorithms have been developed for secret sharing, e.g. secret splitting, Asmuth-Bloom secret sharing protocol, visual cryptography, etc. There is an unanswered question in this research about which method provides best level of security and efficiency in securing message. In this paper, we evaluate the performance of three methods, i.e. secret splitting, secret sharing, and recursive threshold visual cryptography for handwritten image security in terms of execution time and mean squared error (MSE) simulation. Simulation results show the secret splitting algorithm produces the shortest time of execution. On the other hand, the MSE simulation result that the three methods can reconstruct the original image very well.
Bayesian Estimation of Above-Average Performance in Tertiary Institutions: A ...IOSR Journals
Bayesian approach for parameter estimation has the capacity to yield more precise estimates than methods based on sampling theory. There are several common Bayesian models; in this study we applied Empirical Bayes (EB) model called Beta-binomial model. The study is motivated by the need to beam searchlight on universities, faculties or fields of study with graduates who may not be eligible for further educational pursuits. This study provides means of assessment or a basis of evaluation of students’ performances among faculties or fields of study and overall performance of a university. This study uses Bayesian methods of inference to estimate the proportion of above-average performance of graduates from the various faculties in University of Lagos. The model adopted generated results which are of smaller variances compared with variances of sample Proportions, showing that the posterior proportions generated are more efficient estimators. This is further evidenced in narrow widths of the computed confidence intervals. The overall result shows that the proportion of above-average performance of graduates of University of Lagos, who are eligible for further educational pursuits (i.e. higher degrees), is approximately 72% of the university graduates
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
SECURING DIGITAL IMAGES USING WATERMARKING TECHNIQUE AND TRIPLE DES ALGORITHMJournal For Research
Multimedia security is very important issue for the today's internet technology because of duplication, distribution and exchanging if multimedia data. Digital watermarking is the method of shielding digital data in multimedia.Multimedia consist of image, audio, video, text, etc. In watermarking the secret information are implanted into the original data for protecting the ownership rights of the multimedia data. Basically watermarking has three domains.1) Spatial domain 2) Transform domain 3) Wavelet domain. This paper consist Discrete Cosine Transform which is the frequency domain works on the transform coefficient of the image. Three different keys are generated using Triple DES algorithm.
Security analysis of fbdk block cipher for digital imageseSAT Journals
Abstract Network security is one of the major concerns in the modern world. In this regard, a strong security technique is required to protect user data. Cryptography techniques plays an important role in secured transmission through encryption of data and thus ensuring integrity, authenticity, confidentiality of information. Several encryption algorithms have been proposed like AES (Advanced Encryption Standard), DES (Data Encryption Standard) and RSA. These provide very good encryption for text applications. However, these encryption schemes appear not to be ideal for image applications. Some algorithms like GKSBC and RC6 provide very good encryption for digital images. New techniques are emerging that are aimed at providing secured transmission of images over networks. The FBDK (Fixed Block with Dynamic Key Size) block cipher is a new cryptography technique designed using simple operations like XOR, substitutions, circular shifting. The FBDK algorithm is applicable for blocks of any size with key size being dynamic for each block. It does not involve any complex mathematical operations like modular exponentiation. It is a hybrid cryptography technique based on symmetric key and asymmetric key cryptosystems. This paper investigates the security of FBDK block cipher for digital images against brute-force attack, statistical analysis and Differential analysis attacks. In this paper, various security analysis tests has been discussed which are helpful in finding out whether the FBDK encryption algorithm can do secure encryption or not. Experimental results proves the security and efficiency of FBDK cipher for images against all aforementioned types of attacks which justifies its consideration for real time image applications. Keywords: Cryptography, Ciphers, Encryption, Security, and cryptanalysis.
RSA Based Secured Image Steganography Using DWT ApproachIJERA Editor
The need for keeping safe secrecy of secret and sensitive data has been ever increasing with the new
developments in digital system. In this paper, we present an increased way for getting embedding encrypted
secret facts in gray scale images to give high level safety of facts for news over unsecured narrow channels
Cryptography and Steganography are two closely related techniques are used in proposed system. Cryptography
gets into making one of religion the secret note into a non-recognizable chipper. Steganography is then sent in
name for using Double-Stegging to fix this encrypted data into a cover thing by which something is done and
keeps secret its existence.
Multi Owner Data Sharing & Outsourced Revocation Using Identity Based Encrypt...Eswar Publications
Cloud computing is an economical and effective solution for sharing group resource among cloud users. Unfortunately, sharing data in a multi-owner manner while protect data and identity privacy from an un trusted cloud is still a challenging issue, due to the recurrent change of the membership.The major aims of this method a secure multi-owner data sharing scheme.That is any user in the group can securely share data with others by un trusted cloud. Moreover, the real identities of data owners can be exposed by the group manager when disputes occur. User revocation can be achieved by a novel revocation list and no need to update the secret Keys of the
remaining users.The drawback of IBE is computation over head. To overcome the drawback introduces outsourcing computation.
Secured architecture for multi cloud using key aggregation techniqueeSAT Journals
Abstract Data storage and data sharing is the most important aspect in cloud computing, so sharing data and storing it in a secure way is the biggest task when adopting cloud services. In this paper, we will discuss how to share and store data effectively which will prevent the third party to access the secure data in cloud storage. This article provides a survey of using multiple clouds to achieve a security. In this we are introducing a public-key encryption known as Key-aggregate Cryptosystem (KAC). Cryptography is a technique which encodes a data using some key and produces unreadable data so that only a desired party is able to decode that data. KAC produces a constant size ciphertexts (unreadable data) such that decryption right for any set of ciphertexts are possible, means one can aggregate any set of secret keys and make them as compact as single key, but encompassing the power of all the keys being aggregate. This aggregate key is sent to other via secure channel (or via email) for decrypting the ciphertext set and remaining files outside the set are remains secret. Keywords: Cloud, multicloud, key-aggregate encryption, data storage, data sharing and security.
The capability of involving the selection sharing encrypted data with different users via public
cloud storage may greatly ease security concerns over not intended data leaks in the cloud. A key
challenge to designing such encryption schemes to be sustainable in the efficient management of
encryption keys. The desired flexibility of sharing any group of selected documents with any group of
users need for something different encryption keys to be used for different documents. However, this
also implies the urgent need of securely distributing to users a large number of keys for both encryption
and search, and those users will have to protected from danger store the received keys, and submit an
equally large number of keyword trapdoors to the cloud in order to perform search over the shared data
implied need for secure communication, storage, and complexity clearly to give to someone the
approach impractical. In this work a data owner only needs to distribute a single key to a user for
sharing a very large number of documents, and the user only needs to submit a single trapdoor to the
cloud for querying the shared documents. User Revocation is used for Key Updation. Forward Secrecy
and Backward Secrecy is used.
Security Issues related with cloud computingIJERA Editor
The term CLOUD means Common Location Independent Online Utility on Demand. It‟s an emerging technology in IT industries. Cloud technologies are improving day by day and now it become a need for all small and large scale industries. Companies like Google, Amazon, Microsoft etc. is providing virtualized environment for user by which it omits the need for physical storage and others. But as the advantage of cloud computing is increasing day by day the issues are also threatening the IT industries. These issues related with the security of the data. The basic idea of this review paper is to elaborate the security issues related with cloud computing and what methods are implemented to improve these security. Certain algorithms like RSA, DES, and Ceaser Cipher etc. implemented to improve the security issues. In this paper we have implemented Identity based mRSA algorithm in this paper for improving security of data.
Comparison of Secret Splitting, Secret Sharing and Recursive Threshold Visual...TELKOMNIKA JOURNAL
The secret sharing is a method to protect confidentiality and integrity of the secret messages by distributing the message shares into several recipients. The secret message could not be revealed unless the recipients exchange and collect shares to reconstruct the actual message. Even though the attacker obtain shares shadow during the share exchange, it would be impossible for the attacker to understand the correct share. There are few algorithms have been developed for secret sharing, e.g. secret splitting, Asmuth-Bloom secret sharing protocol, visual cryptography, etc. There is an unanswered question in this research about which method provides best level of security and efficiency in securing message. In this paper, we evaluate the performance of three methods, i.e. secret splitting, secret sharing, and recursive threshold visual cryptography for handwritten image security in terms of execution time and mean squared error (MSE) simulation. Simulation results show the secret splitting algorithm produces the shortest time of execution. On the other hand, the MSE simulation result that the three methods can reconstruct the original image very well.
Bayesian Estimation of Above-Average Performance in Tertiary Institutions: A ...IOSR Journals
Bayesian approach for parameter estimation has the capacity to yield more precise estimates than methods based on sampling theory. There are several common Bayesian models; in this study we applied Empirical Bayes (EB) model called Beta-binomial model. The study is motivated by the need to beam searchlight on universities, faculties or fields of study with graduates who may not be eligible for further educational pursuits. This study provides means of assessment or a basis of evaluation of students’ performances among faculties or fields of study and overall performance of a university. This study uses Bayesian methods of inference to estimate the proportion of above-average performance of graduates from the various faculties in University of Lagos. The model adopted generated results which are of smaller variances compared with variances of sample Proportions, showing that the posterior proportions generated are more efficient estimators. This is further evidenced in narrow widths of the computed confidence intervals. The overall result shows that the proportion of above-average performance of graduates of University of Lagos, who are eligible for further educational pursuits (i.e. higher degrees), is approximately 72% of the university graduates
Effect of Different Physico-Chemical Parameters on Production ofAmylase by Ba...IOSR Journals
The present study is concerned with the production of amylase by Bacillus species strain. In this
study 12 bacterial strains were isolated and screened for their α-amylase activity. These strains were
maintained on nutrient agar medium. Fermentation for the production of amylase was carried out in the enzyme
production medium (EPM). All the 12 strains were tested for amylase production. On the basis of maximum
amylase activity strain no.1 was selected for further studies. Different starch concentrations, 0.75,1.00,1.25%,
pH labels 6.5,7.0,7.5,8.0, aeration (RPM), 100,120,140, temperatures 250C,280C,370C, and 400C and inoculums
level 0.5%,1.0%, 1.5% and 2.0% were studied
Impact of Family Support Group on Co-Dependent BehaviourIOSR Journals
The present study aimed to investigate the impact of family support group on co-dependent
behaviour of spouse of drug addicts. It was hypothesized there would be significant difference between new and
old members of family support group on co-dependent behaviour. It was also hypothesized that new members
will score higher on denial, self- esteem, control and compliance as compare to old members. A sample (N=60)
female spouse acquired through addiction treatment Centre’s of Lahore city. The data was collected through
purposive sampling technique. Am I Co-dependent Scale was administered to measure co-dependant behaviour.
Independent sample t- test was used to find out the difference of co-dependent behaviour. Results shows that
there is significant difference between new members and old family support members on variables. Findings can
be implemented to enhance the benefits of self-help groups or group therapies supported by drug treatment
centres to family members
IOSR Journal of Humanities and Social Science is an International Journal edited by International Organization of Scientific Research (IOSR).The Journal provides a common forum where all aspects of humanities and social sciences are presented. IOSR-JHSS publishes original papers, review papers, conceptual framework, analytical and simulation models, case studies, empirical research, technical notes etc.
Abstract: An audio mixer amplifier is a device that translates a signal of one frequency band to another. It will accept many inputs at different frequencies and generate an output of the combination or sum of the frequencies. The mixer circuit provides good gain to weak audio signals. It can be used in front of an R.F. oscillator to make an R.F. receiver that is very sensitive to sound. Each input can be independently controlled by a variable resistor. There is also a provision for a balance control to fade out signal while simultaneously fading in the other. Key Words: Audio Mixer, Frequency, Signal, Circuit
Chemical Reaction Effects on Free Convective Flow of a Polar Fluid from a Ver...IOSR Journals
This article deals with a study of two dimensional free convective flow of a polar fluid through a porous medium due to combined effects of thermal and mass diffusion in presence of a chemical reaction of first order. The objective of the present investigation is to analyze the free convective flow in the presence of prescribed wall heat flux and mass flux condition. The governing partial differential equations are non-dimensionalized and transformed into a system of non-similar equations. The resulting coupled nonlinear partial differential equations are solved numerically under appropriate transformed boundary conditions using an implicit finite difference scheme in combination with quasilinearisation technique. Computations are performed for a wide range of values of the various governing flow parameters of the velocity, angular velocity, temperature and species concentration profiles and results are presented graphically. The numerical results for local skin friction coefficient, couple stress coefficient, local Nusselt number and local Sherwood number are also presented. The obtained results are compared with previously published work and were to be in excellent agreement. The study reveals that the flow characteristics are profoundly influenced by the polar effects
IOSR Journal of Mathematics(IOSR-JM) is an open access international journal that provides rapid publication (within a month) of articles in all areas of mathemetics and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in mathematics. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Dosimetric evaluation of the MLCs for irregular shaped radiation fieldsIOSR Journals
The three-dimensional conformal radiotherapy (3D-CRT), intensity-modulated radiotherapy (IMRT), and image-guided radiotherapy (IGRT) are the most advanced techniques in radiotherapy, which use irregular fields–using multileaf collimators in a linear accelerator. The accuracy of these techniques depends on dosimetric characteristics of the multileaf collimators. There is an option for optimizing the jaws to the irregular MLC field to reduce the scattered radiation and intra- and inter-leaf radiation leakage beyond the field. In this study, ,80 leaf MLC system has been taken to compare and differentiate their characteristics with 6-MV, and 10-MV photon beams.
The MLC system in Elekta linear accelerator is used as a separate unit, that is, The dosimetric characteristics include dose rates, percentage depth doses, surface dose, dose in the build-up region, penumbra, and width of 50% dose levels
Evaluation Of Analgesic And Anti Inflammatory Activity Of Siddha Drug Karuvil...IOSR Journals
The present study was carried out to validate the anti-inflammatory and analgesic activities of Karuvilanchi ver chooranam (KVC) (Root powder of Smilax zeylanica) in rodents. Analgesic study was carried out by using Eddy’s Hotplate method and acetic acid-induced writhing test and Anti inflammatory study was evaluated by Cotton pellet granuloma method and by plethysmometer method. The result of the analgesic activity evaluated using hot plate method revealed that the reaction time for mice was significantly increased in a dose dependent manner after one hour of oral administration. It was found that both KVC and Aspirin caused an inhibition on the writhing response induced by acetic acid. Doses of 250 and 500 mg/kg of the KVC and aspirin respectively, could completely block the writhing response exhibited about 61.51 and 72.51% inhibition. In acute inflammation model, the formalin induced paw oedema was significantly reduced by all the doses of KVC used when compared to control (P<0.05). The results of cotton pellet granuloma method indicated that KVC in both doses significantly reduced the weight of the cotton pellet granuloma with a dose dependent effect. From the result it can be concluded that the trial drug Karuvilanchi Ver Chooranam has potent analgesic and anti inflammatory properties which confirmed the traditional use
Secure Data Sharing and Search in Cloud Based Data Using Authoritywise Dynami...IOSRjournaljce
The Data sharing is an important functionality in cloud storage. We describe new public key crypto systems which produce constant-size cipher texts such that efficient delegation of decryption rights for any set of cipher texts are possible. The novelty is that one can aggregate any set of secret keys and make them as compact as a single key, but encompassing the power of all the keys being aggregated. Ensuring the security of cloud computing is second major factor and dealing with because of service availability failure the single cloud providers demonstrated less famous failure and possibility malicious insiders in the single cloud. A movement towards Multi-Clouds, In other words ”Inter-Clouds” or ”Cloud-Of-Clouds” as emerged recently. This works aim to reduce security risk and better flexibility and efficiency to the user. Multi-cloud environment has ability to reduce the security risks as well as it can ensure the security and reliability.
Data Leakage Detection and Security Using Cloud ComputingIJERA Editor
The data owner will store the data in the cloud. Every user must registered in the cloud. Cloud provider must
verify the authorized user. If someone try to access the account, data will get leaked. This leaked data will
present in an unauthorized place (e.g., on the internet or someone’s laptop). In this paper, we propose Division
and Replication of Data in the Cloud for Optimal Performance and Security (DROPS) that collectively
approaches the security and performance issues. In DROPS methodology, we have to select the file and then
store the particular file in the cloud account. In order to provide security we are going to implement DROPS
concepts. Now we divide the file into various fragments based on the threshold value. Each and every fragments
are stored in the node using T-Coloring. After the placement of fragments in node, it is necessary to replicate
each fragments for one time in cloud.
A Review on Key-Aggregate Cryptosystem for Climbable Knowledge Sharing in Clo...Editor IJCATR
The Data sharing is an important functionality in cloud storage. In this article, we show how to securely, efficiently, and
flexibly share data with others in cloud storage. We describe new public-key cryptosystems which produce constant-size ciphertexts
such that efficient delegation of decryption rights for any set of ciphertexts are possible. The novelty is that one can aggregate any set
of secret keys and make them as compact as a single key, but encompassing the power of all the keys being aggregated. In other
words, the secret key holder can release a constant-size aggregate key for flexible choices of ciphertext set in cloud storage, but the
other encrypted files outside the set remain confidential. This compact aggregate key can be conveniently sent to others or be stored in
a smart card with very limited secure storage. We provide formal security analysis of our schemes in the standard model. We also
describe other application of our schemes. In particular, our schemes give the first public-key patient controlled encryption for flexible
hierarchy, which was yet to be known.
A review on key aggregate cryptosystem for scalable data sharing in cloud sto...eSAT Journals
Abstract Cloud computing technology is widely used so that the data can be outsourced on cloud can accessed easily. Different members can share that data through different virtual machines but present on single physical machine. But the thing is user don’t have physical control over the outsourced data. The need is to share data securely among users. The cloud service provider and users authentication is necessary to make sure no loss or leak of users data. Privacy preserving in cloud is important make sure the users identity is not revealed to everyone. On cloud anyone can share data as much they want to i.e. only selected content can be shared. Cryptography helps the data owner to share the data to in safe way. So user encrypts data and uploads on server. Different encryption and decryption keys are generated for different data. The encryption and decryption keys may be different for different set of data. Only those set of decryption keys are shared that the selected data can be decrypted. Here a public-key cryptosystems which generate a ciphertext which is of constant size. So that to transfer the decryption rules for number of ciphertext. The difference is one can collect a set of secret keys and make them as small size as a single key with holding the same ability of all the keys that are formed in a group. This compact aggregate key can be efficiently sent to others or to be stored in a smart card with little secure storage. Keywords: Cloud storage, Attribute base encryption, Identity base encryption, Cloud storage, data sharing, key-aggregate encryption
High security mechanism: Fragmentation and replication in the cloud with auto...CSITiaesprime
Cloud computing makes immense use of internet to store a huge amount of data. Cloud computing provides high quality service with low cost and scalability with less requirement of hardware and software management. Security plays a vital role in cloud as data is handled by third party hence security is the biggest concern to matter. This proposed mechanism focuses on the security issues on the cloud. As the file is stored at a particular location which might get affected due to attack and will lost the data. So, in this proposed work instead of storing a complete file at a particular location, the file is divided into fragments and each fragment is stored at various locations. Fragments are more secured by providing the hash key to each fragment. This mechanism will not reveal all the information regarding a particular file even after successful attack. Here, the replication of fragments is also generated with strong authentication process using key generation. The auto update of a fragment or any file is also done here. The concept of auto update of files is done where a file or a fragment can be updated online. Instead of downloading the whole file, a fragment can be downloaded to update. More time is saved using this methodology.
Fragmentation of Data in Large-Scale System For Ideal Performance and SecurityEditor IJCATR
Cloud computing is becoming prominent trend which offers the number of significant advantages. One of the ground laying
advantage of the cloud computing is the pay-as-per-use, where according to the use of the services, the customer has to pay. At present,
user’s storage availability improves the data generation. There is requiring farming out such large amount of data. There is indefinite
large number of Cloud Service Providers (CSP). The Cloud Service Providers is increasing trend for many number of organizations and
as well as for the customers that decreases the burden of the maintenance and local data storage. In cloud computing transferring data to
the third party administrator control will give rise to security concerns. Within the cloud, compromisation of data may occur due to
attacks by the unauthorized users and nodes. So, in order to protect the data in cloud the higher security measures are required and also
to provide security for the optimization of the data retrieval time. The proposed system will approach the issues of security and
performance. Initially in the DROPS methodology, the division of the files into fragments is done and replication of those fragmented
data over the cloud node is performed. Single fragment of particular file can be stored on each of the nodes which ensure that no
meaningful information is shown to an attacker on a successful attack. The separation of the nodes is done by T-Coloring in order to
prohibit an attacker to guess the fragment’s location. The complete data security is ensured by DROPS methodology
Multi-part Dynamic Key Generation For Secure Data EncryptionCSCJournals
Storage of user or application-generated user-specific private, confidential data on a third party storage provider comes with its own set of challenges. Although such data is usually encrypted while in transit, securely storing such data at rest presents unique security challenges. The first challenge is the generation of encryption keys to implement the desired threat containment. The second challenge is secure storage and management of these keys. This can be accomplished in several ways. A naive approach can be to trust the boundaries of a secure network and store the keys within these bounds in plain text. A more sophisticated method can be devised to calculate or infer the encryption key without explicitly storing it. This paper focuses on the latter approach. Additionally, the paper also describes the implementation of a system that in addition to exposing a set of REST APIs for secure CRUD operations also provides a means for sharing the data among specific users.
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
Neuro-symbolic is not enough, we need neuro-*semantic*Frank van Harmelen
Neuro-symbolic (NeSy) AI is on the rise. However, simply machine learning on just any symbolic structure is not sufficient to really harvest the gains of NeSy. These will only be gained when the symbolic structures have an actual semantics. I give an operational definition of semantics as “predictable inference”.
All of this illustrated with link prediction over knowledge graphs, but the argument is general.
Let's dive deeper into the world of ODC! Ricardo Alves (OutSystems) will join us to tell all about the new Data Fabric. After that, Sezen de Bruijn (OutSystems) will get into the details on how to best design a sturdy architecture within ODC.
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
JMeter webinar - integration with InfluxDB and GrafanaRTTS
Watch this recorded webinar about real-time monitoring of application performance. See how to integrate Apache JMeter, the open-source leader in performance testing, with InfluxDB, the open-source time-series database, and Grafana, the open-source analytics and visualization application.
In this webinar, we will review the benefits of leveraging InfluxDB and Grafana when executing load tests and demonstrate how these tools are used to visualize performance metrics.
Length: 30 minutes
Session Overview
-------------------------------------------
During this webinar, we will cover the following topics while demonstrating the integrations of JMeter, InfluxDB and Grafana:
- What out-of-the-box solutions are available for real-time monitoring JMeter tests?
- What are the benefits of integrating InfluxDB and Grafana into the load testing stack?
- Which features are provided by Grafana?
- Demonstration of InfluxDB and Grafana using a practice web application
To view the webinar recording, go to:
https://www.rttsweb.com/jmeter-integration-webinar
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...UiPathCommunity
💥 Speed, accuracy, and scaling – discover the superpowers of GenAI in action with UiPath Document Understanding and Communications Mining™:
See how to accelerate model training and optimize model performance with active learning
Learn about the latest enhancements to out-of-the-box document processing – with little to no training required
Get an exclusive demo of the new family of UiPath LLMs – GenAI models specialized for processing different types of documents and messages
This is a hands-on session specifically designed for automation developers and AI enthusiasts seeking to enhance their knowledge in leveraging the latest intelligent document processing capabilities offered by UiPath.
Speakers:
👨🏫 Andras Palfi, Senior Product Manager, UiPath
👩🏫 Lenka Dulovicova, Product Program Manager, UiPath
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
To Graph or Not to Graph Knowledge Graph Architectures and LLMs
K017115359
1. IOSR Journal of Computer Engineering (IOSR-JCE)
e-ISSN: 2278-0661,p-ISSN: 2278-8727, Volume 17, Issue 1, Ver. I (Jan – Feb. 2015), PP 53-59
www.iosrjournals.org
DOI: 10.9790/0661-17115359 www.iosrjournals.org 53 | Page
Secure Data Sharing Using Compact Summation key in Hybrid
Cloud Storage
Pratap M Mohite, DipaDharmadhikari,RavindraBankar
(Computer Science &Engineering,Marathwada Institute of Technology, India)
(Computer Science &Engineering,Marathwada Institute of Technology, India)
(Master of Computer Applications,Dr.BAMU, India)
Abstract: Data security is crucial aspect in cloud storage. Providing security to a single file or to set of files is
another important factor. In cloud, security is applied to a set of files i.e. to central location. In file sharing
approach a single key can be used to gain access to storage. Applying security to each file in cloud is not
possible with cloud environment. To solve this type ofproblems, new improved key assignment scheme have to
be used. New improved algorithm that satisfies these conditions is summation key encryption. Summation key is
of power more than two keys. It takes one public key, known to both parties & another key is generated using
keygen algorithm. Data owner retrieves the summation key from the alternatives made to share data. This key
can be dispatch to second user using secure channel for example email or smart cards. Summation key is
compact in size & also decrease the size of files after encryption. Time duration required to generate summation
key is very short as compare to Identity based or Attribute based encryption scheme.Practically how this
algorithm is beneficial to provide security to individual files in cloud repositoryis described here.
Keywords: Cloud Server,Data Sharing, Data Security, Hybrid Cloud, Summation key.
I. Introduction
Cloud system provides data sharing capabilities;this can provide an abundant of benefits to the users.
There is currently a push for information technology industries to increase their data sharing efforts. In
information technology industry there is tremendous increase in data outsourcing. Data can be outsourced or
infrastructure can be shared or software can be used. Cloud services divide into three categories infrastructure as
a service, platform as a service & software as a service. Infrastructure as a service is provision model in which
on organization outsourced the equipment used to support operations including storage, hardware, servers &
networking components. Platform as a service is a way of rent hardware, operating system storage & network
capacity over the internet. Software as a service is a software distribution model in which applications are
hosted by a vendors or service provider & made available to customers over network typically the internet.
Data privacy isa traditional way to shield access control mechanism after conventional authentication.
Any unauthorized person can procure access & reveal all data. Sharing data over cloud encounters some security
related problems. Files shared from different clients can be hosted on different virtual machines for example
virtualization in Linux, but whole data is stored on single machine. Data in target virtual machine could be
stolen by instantiation another virtual machine co-resistance with victim machine. Multiple cryptographic
schemes are used to store & check availability of files on behalf of data owner but can’t leak anything from that.
But data owner can’t depend totally on cloud server due to lack of confidentiality.
For this purpose data owner has to use some security policies to prevent unauthorized person to take
data without permission of data owner. This will lead to manipulate some cryptographic methods while
uploading data on cloud server. Principle term related to cloud is data sharing, but appraise the cloud computing
environment propound without exposing mission critical applications and data to third party vulnerabilities.
Data owner can use website or any application to share his private data with his friends. Consider D as
a set of whole data & 1 2 3, ,d ,..., nd d d are data elements i.e. 1 2 3{ , , ,...,d }nD d d d
Data owner desire to share only some data for ex: 1 2,d d with his friend .This sort of action cannot
possible in cloud computing environment. Reason behind this, data owner has not specified 1 2,d d data
separately; data is bunch of files. Using only one key data owner can gain access to data & he has to share that
key also. His friend can see the whole dataset D.
From Fig 1, Assume that Peter puts his personal data on cloud storage & he does not desire that his
distinctive data will not be available to everyone. Due to much security violation possibilities he cannot totally
relied on cloud storage. To prevent this, whole data D is stored on to cloud. But after some days his friend Anna
Want some photos from dataset D. At this situation Peter has to give his secret key to decrypt D set. By using
only one single key Anna can gain access to whole set of data D& she would be take another files from set.
To prevent such situation Peter has to possible ways,
2. Secure Data Sharing Using Compact Summation key in Hybrid Cloud Storage
DOI: 10.9790/0661-17115359 www.iosrjournals.org 54 | Page
1) Either apply a single key to whole dataset D , k(D) Or
2) Apply keys to each elements in dataset for ex, 1 2 3, ,d ,..., nd d d i.e. 1 1 2 2 3 3( ), ( ), (d )... ( )n nk d k d k k d
Figure 1 Data Sharing inTraditional Cloud System
First method is adverse because by using one single key Anna can obtain all data stored in cloud
storage. In second method, applying each file a key can unbearable because of number of keys are as many as
the number of files, say thousands. Transferring such keys requires a reliable storage the values & complication
involved generally grow with the number of decryption keys to be shared. Encryption keys also come with two
flavors symmetric key encryption& asymmetric key encryption.In symmetric key encryption scheme, Anna
&Peter share a single common key to perform encryption & decryption operations. In asymmetric key scheme,
Anna & Peter have different encryption and decryption keys. Flexibility is main application of public key
encryption. For example in organization, every member can upload encrypted data on the cloud server without
the knowledge of master secret key.
Therefore the best solution for above problem is that Peter encrypts all files with unique public keys,
but only sends Anna a single decryption key which is constant in size that is called as summation key Fig 2.
This key can be sent via a secure channel called email or a smart card or wireless sensor network. Basic aim of
current system is to minimize hardware and communication cost as well as time duration of key generation.
There are various cryptographic schemes; those can be used to apply security mechanism over cloud
storage but some lack in size & some are in integrity. Those are demonstrated in next section.
Figure 2 Data sharing in Cloud Storage Using Summation Key.
II. Related work
1. Types of Cryptography
1.1 Predefined Hierarchical Scheme
Predefined Hierarchical Schemes [1] aim to minimize the cost in storing and managing secret keys for
general cryptographic use. Employing a tree structure a secrete key for a given arm can be used to procured the
secret keys of its child nodes.Sandhu [2] proposed a technique to initiate a tree hierarchy of symmetric keys by
3. Secure Data Sharing Using Compact Summation key in Hybrid Cloud Storage
DOI: 10.9790/0661-17115359 www.iosrjournals.org 55 | Page
using reiterated evaluations of pseudo random functions block cipher on stable secret. This notion can be
verbalized from a tree to a graph.Another more advanced cryptographic key assignment schemes bears access
policy that can be modelled by an acyclic graph [3].Most of these schemes construct keys for symmetric key
cryptosystems, even though the key derivation may require modular arithmetic as used in public key
cryptosystems, which are more expensive than” symmetric key operation” such as pseudorandom function[4].
Taking tree structure as an example, Peter can first classify the ciphertext classes according to their subjects like
Fig 3.
(a)
(b)
Figure 3 a) One Key for Hierarchy, b) Four Keys for Hierarchy
Each node in the tree represents a secret key, while the leaf nodes represent the keys for individual
ciphertext classes. Filled rectangles represent the keys for the classes to be delegated and circles circumvented
by dotted lines represent the keys to be granted. Note that every key of the non-leaf node canderive the keys of
its descendant nodes. In Fig 3(a), if Peter wants to share all the files in the “personal” category, he only needs to
grant the keyfor the node “personal”, which automatically grants thedelegate the keys of all the descendant
nodes (“photo”,“music”). This is the ideal case, where most classes tobe shared belong to the same branch and
thus a parent key of them is sufficient. However, it is still difficult for general cases. As shown in Fig 3(b), if
Peter shares his demomusic at work (“work”→“casual”→“demo” and“work”→“confidential”→“demo”) with a
colleaguewho also has the rights to see some of her personaldata, what she can do is to give more keys, which
leadsto an increase in the total key size. One can see thatthis approach is not flexible when the
classificationshare more complex and she wants to share different setsof files to different people [5].
For this delegate in ourexample, the number of granted secret keys becomesthe same as the number of
classes.In general, hierarchical approaches can solve the problem partially if one intends to share all files under
a certain branch in the hierarchy. On average, the number ofkeys increases with the number of branches. It is
unlikelyto come up with a hierarchy that can save the numberof total keys to be granted for all individuals
(which canaccess a different set of leaf-nodes) simultaneously [6].
1.2 Attribute-based encryption
Attribute is analogues with cipher text. Data owner with master secret key can obtain a secrete key for
the policy of attributes so that a ciphertext can be decrypted by this key if its associated attributes conforms to
policy. Each attribute is associated with data this leads to increase in size of keys. For example with the secret
key for the policy (2V3V6V8), one can decrypt ciphertext tagged with class 2, 3, 6 or 8 [7].The measure
perturbed in attribute based encryption is collusion-resistance but not the compactness of secret keys. Actually,
the size of the key often increases linearly with the number of attributes it encompasses, or the ciphertext-size is
not immutable. To delegate the decryption power of some ciphertexts without sending the secret key to the
delegate, a useful primitive is proxy re-encryption (PRE) [8]
4. Secure Data Sharing Using Compact Summation key in Hybrid Cloud Storage
DOI: 10.9790/0661-17115359 www.iosrjournals.org 56 | Page
A PRE permits peter to delegate tothe server (proxy) the ability to transform the ciphertexts encrypted
under her public-key into ones for. PRE is well known to have innumerable applications including
cryptographic file system. Nevertheless, Anna has to trustworthy the proxy that it only turns ciphertexts
according to her instruction, which is what user wants to avoid at the first place [9]. Even worse, if the proxy
colludes with, some form of Anna’s secret key can be recovered which can decrypt Anna’s (convertible)
ciphertexts without Peter’s further help. That also means that the transformation key of proxy should be well
protected Using PRE just moves the secure key storage requirement from the delegate to the proxy. It is thus
undesirable to let the proxy reside in the storage server. That will also be inconvenient since every decryption
requires separate interaction with the proxy.
1.3 Identity Based Encryption
Identity-based encryption (IBE) is a type of public-key encryption in which the public-key of a user
can be assign as an identity-string of the user (e.g. an email address). There is a trusted party called private key
generator (PKG) in IBE which holds a master-secret key and issues a confidential key to each user concerning
to the user identity. The encrypt or can take the public parameter and a user singularity to encrypt a message.
The recipient can decrypt this ciphertext by his secret key [10].
Guoetet al, tried to build IBE with key aggregation. One of their schemes assumes random oracles but
another does not. In their schemes, key aggregation is constrained in the sense that all keys to be summarize
must come from different “identity divisions” [11]. While there are an exponential number of identities and thus
secret keys, only a polynomial number of them can be summarize.
Most importantly, their key-aggregation [12], comes at the expense of ( )O n sizes for both ciphertexts
and the public parameter, where nis the number of secret keys which can be summation into a constant size one.
This substantiallygrows the costs of storing and transmitting ciphertexts, which is inappropriate in many cases
such as shared cloud storage. As mentioned, in this scheme, feature constant ciphertext size, and their security
holds in the standard model. In fuzzy IBE [13], one single compact secret key can decrypt ciphertexts encrypted
under many identities which are close in a certain metric space, but not for an arbitrary set of identities and
therefore it does not match with our idea of key aggregation.
Table 1: key Assignment Schemes
Scheme Name Decryption Key Encryption Key
Predefined key hierarchy Not Constant Constant
Compact Key Constant Constant
Attribute Based Encryption Non Constant Constant
Identity Based Encryption Constant Non constant
Compact Summation Key Encryption Constant Constant
In Table 1, shows comparisons between all the available schemes with proposed compact summation
key encryption. Predefined key hierarchy has different encryption & decryption keys. Compact key have both
encryption & decryption keys constant but those are single key no combination. Attribute based encryption have
both different keys. Identity based encryption have one key constant and another non constant key. In compact
summation key encryption both keys are constant less size.
III. Compact Summation Key Encryption
As there are various methods available for cloud security but they are lagging in storing keys &
managing files. These schemes cannot provide a much security as required by market. In this paper a new
approach called compact summation key (CSK) Encryption for storing and managing files is used. These
schemes overcome all the drawbacks of IBE, ABE, HKM, and CK.
In traditional cryptography, messages were kept secret, but that approach can’t be applied to modern
cryptographic systems. Main aim of this paper is to keep data more secure and enhance power of encryption &
decryption keys without increasing size of them.The design of basic scheme is inspired from the
collusion-resistant broadcast encryption scheme proposed by Bonehet al. [14]. Although their scheme
supports constant-size secret keys, every key only has the power for decrypting ciphertexts associated to a
particular index. From above requirements there is need to devise a new extract algorithm and the corresponding
encrypt algorithm.
This algorithm is divided into five polynomial time algorithms. Those are combined together to
enhance security capabilities & to provide high level of security. Those steps are as follows,
5. Secure Data Sharing Using Compact Summation key in Hybrid Cloud Storage
DOI: 10.9790/0661-17115359 www.iosrjournals.org 57 | Page
1) Step 1:
(1 ,n)SETUP : InSETUP , itrandomly pics a bilinear group G of prime order p where p lies between
1
2 2p
. A generator g G and pZ .Where pZ is another bilinear group to compute ig g G
for 1,2,3.., , 2,2i n n n .Output of the parameter as 1 2 2{ , ,..., , ,..,g }n n nparam g g g g where param is group of
small bilinear classes. Note that each ciphertext class is represented by an index in integer set{1, 2,..., }n ,where
n the maximum number of ciphertext classes &1
is security level parameter and the number of ciphertext
classes n (i.e.class index should be an integer bounded by1& i .
2) Step 2
( , )KeyGen pk msk : Picks R pZ output the public and master secret key pair( ,msk )r
pk v g where
pk public key is and msk is the master secret key& is generated secret keyv is vertices of tree generated.
3) Step 3
( , , )Encrypt pk i m : For a message Tm G and index {1,2,3...n}i , randomly picks R pt Z and compute the
ciphertext as 2h
where T is index for G bilinear group of prime numbers & 2h
is generated Keys height as in
hierarchical key assignment scheme where h can be incremented as 16, 18, and 20.
4) Step 4
( , )Extract msk s : For the set S of indices 'j s the summation key is computed as
1 2,s n
j s
k g j c
SinceS does not include 0 , can always be retrieved from param where sK is extracted key which is
summation key generated from cipher index classes & from group of bilinear group G .
5) Step 5
1 2 3( , , , { , , })sDecrypt k s i C c c c : Ifi s . {1,2,3...n}i Otherwise, return the message:
3 1 1 1 2
,
( , ) / ( , )s n j i s n j i
j S j i j S
m c e k g c e k g c
Forthe data owner, with the knowledge of ,term 1(g ,g )t
ne
can be easily recovered by
1 1,(c ,g ) (g ,g ) (g g )t t
n n ne e e
, where m is message which is converted to original form sK i.e. summation key
can be removed from message.
IV. Experimental Results
CASE I: File Compression Ratios
When files encrypted,file size can be changed dramatically, to check this BSdiff, Xdelta tools are used.
These are the file compression tools that can be used to compress files. These results of file size can be
compared with CSK scheme. As one of the feature of CSK scheme is file compression.Xdelta is a command line
program for delta encoding, which generates two file differences. This is similar to diff and patch, but it is
targeted for binary files and does not generate human readable output. The differences are recorded in discrete
files called "deltas" or "diffs". In situations where differences are small for ex, the change of a few words in a
large document or the change of a few records in a large table delta encoding greatly reduces data redundancy.
Collections of unique deltas are substantially more space-efficient than their non-encoded equivalents.
In table 2 comparison of compression ratios of files are described with CSK scheme. In which
summation key algorithm compress file size at large amount as compared with XDelta & BSDiff file
compression tools. These tools specifically used for storing data on server. So CSK takes small space so data
owner can put more files on cloud storage. This is shown graphically in Fig 4 CSK is at very high level in
compression.
Table 2: File Comparison Ratios
File Name File Size in KB(original) XDelta BSDiff CSK
File 1 1197 616 464 57
File 2 399 240 214 46
File 3 362 211 197 42
6. Secure Data Sharing Using Compact Summation key in Hybrid Cloud Storage
DOI: 10.9790/0661-17115359 www.iosrjournals.org 58 | Page
File 4 296 176 173 39
File 5 293 174 171 38
File 6 260 164 160 36
File 7 91 76 71 17
File 8 15 10 9 8
Figure 4File Comparison Ratios
CASE II: Comparative Execution Time
Table 3 shows comparative execution time of various popular schemes with CSK scheme in electronic
code book mode. In this table compact summation key required very less execution time to performing its
encryption task.
Fig5shows how CSK encrypt data in a very short duration as compared with hierarchical, attribute
based and compact key. As data size increases, execution time also increases.
Table 3: Execution Time in Different Schemes
Size in
Bytes
Cryptographic Methods
Hierarchical Attribute Based Identity Based Summation Key
20527 2 7 4 2
36002 4 13 6 3
45911 5 17 8 4
59852 7 23 11 6
69545 9 26 13 7
137325 17 51 26 13
158959 20 60 30 16
166364 21 62 31 17
191383 24 72 36 19
232398 30 87 44 24
Figure 5Execution Time in Different Cryptographic Methods
0
100
200
300
400
500
600
700
File 1 File 2 File 3 File 4 File 5 File 6 File 7 File 8
Size in bytes
File
Size
7. Secure Data Sharing Using Compact Summation key in Hybrid Cloud Storage
DOI: 10.9790/0661-17115359 www.iosrjournals.org 59 | Page
V. Conclusion
Protectuser’s data is a prime question in cloud storage. Cryptographic schemes are used frequently and
involve multiple keys for a single application this will lead to increase the size of keys. With compact
summation key encryption algorithmdata can be kept secure with compact sized summation key on cloud server.
This paper describes “summarization” of secret keys in public-key cryptosystems. This supports delegation of
secret keys for different ciphertext classes in cloud storage. No matter which one among the power set of
classes, the delegate can always get a summation key of constant size which is 16 bit in size. This scheme is
more flexible than hierarchical key assignment, IBE& ABE. CSK scheme not only saves spaces but also time,
required to generate keys. This is possible if & only if all key holders share a similar set of privileges.
Limitation in this work is the predefined bound of the number of maximum ciphertext classes. In cloud
storage, the number of cipher texts usually grows rapidly.So data owner has to reserve enough ciphertext classes
for the future extension. Otherwise, itneeds to expand the public-key as described in previous section. Although
the parameter can be downloaded with ciphertexts, it would be better if its size is independent of the maximum
number of ciphertext classes. On the other hand, when one carries the delegated keys in a mobile device without
using special trusted hardware, the key is prompt to leakage, designing a leakageresilient cryptosystem, yet
allows efficient andflexible key delegation is also an interesting direction.
References
[1]. S. G. Akl and P. D. Taylor, “Cryptographic Solution to a Problem of Access Control in a Hierarchy,” ACM Transactions on
ComputerSystems (TOCS), vol. 1, no. 3, pp. 239–248, 1983.
[2]. G. C. Chick and S. E. Tavares, “Flexible Access Control with Master Keys,” in Proceedings of Advances in Cryptology –
CRYPTO’89, ser. LNCS, vol. 435. Springer, 1989, pp. 316–322.
[3]. W.-G. Tzeng, “A Time-Bound Cryptographic Key Assignment Scheme for Access Control in a Hierarchy,” IEEE Transactions on
Knowledge and Data Engineering (TKDE), vol. 14, no. 1, pp. 182–188, 2002.
[4]. G. Ateniese, A. D. Santis, A. L. Ferrara, and B. Masucci, “Provably-Secure Time-Bound Hierarchical Key Assignment Schemes,”
J. Cryptology, vol. 25, no. 2, pp. 243–270, 2012.
[5]. R. S. Sandhu, “Cryptographic Implementation of a Tree Hierarchy for Access Control,” Information Processing Letters, vol. 27, no.
2, pp. 95–98, 1988
[6]. C.-K. Chu and W.-G.Tzeng, “Identity-Based Proxy Re-encryption Without Random Oracles,” in Information Security Conference
(ISC ’07), ser. LNCS, vol. 4779. Springer, 2007, pp. 189–202.
[7]. C.-K. Chu, J. Weng, S. S. M. Chow, J. Zhou, and R. H. Deng, “Conditional Proxy Broadcast Re-Encryption,” in
AustralasianConference on Information Security and Privacy (ACISP ’09), ser.LNCS, vol. 5594. Springer, 2009, pp. 327–342.
[8]. S. S. M. Chow, J. Weng, Y. Yang, and R. H. Deng, “Efficient Unidirectional Proxy Re-Encryption,” in Progress in Cryptology -
AFRICACRYPT 2010, ser. LNCS, vol. 6055.Springer, 2010, pp.316–332.
[9]. G. Ateniese, K. Fu, M. Green, and S. Hohenberger, “Improved Proxy Re-Encryption Schemes with Applications to Secure
Distributed Storage,” ACM Transactions on Information and System Security (TISSEC), vol. 9, no. 1, pp. 1–30, 2006.
[10]. D. Boneh, C. Gentry, and B. Waters, “Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys,”
inProceedings of Advances in Cryptology - CRYPTO ’05, ser. LNCS, vol. 3621. Springer, 2005, pp. 258–275.
[11]. L. B. Oliveira, D. Aranha, E. Morais, F. Daguano, J. Lopez, and R. Dahab, “TinyTate: Computing the Tate Pairing in
ResourceConstrained Sensor Nodes,” in Proceedings of 6th IEEE International Symposium on Network Computing and
Applications (NCA ’07).IEEE, 2007, pp. 318–323.
[12]. D. Naor, M. Naor, and J. Lotspiech, “Revocation and Tracing Schemes for Stateless Receivers,” in Proceedings of Advances in
Cryptology - CRYPTO ’01, ser. LNCS. Springer, 2001, pp. 41–62.
[13]. T. H. Yuen, S. S. M. Chow, Y. Zhang, and S. M. Yiu, “IdentityBased Encryption Resilient to Continual Auxiliary Leakage,” in
Proceedings of Advances in Cryptology - EUROCRYPT ’12, ser. LNCS, vol. 7237, 2012, pp. 117–134.
[14]. D. Boneh, X. Boyen, and E.-J. Goh, “Hierarchical Identity Based Encryption with Constant Size Ciphertext,” in Proceedings of
Advances in Cryptology - EUROCRYPT ’05, ser. LNCS, vol. 3494.Springer, 2005, pp. 440–456.
[15]. D. Boneh, R. Canetti, S. Halevi, and J. Katz, “Chosen-Ciphertext Security from Identity-Based Encryption,” SIAM Journal on
Computing (SIAMCOMP), vol. 36, no. 5, pp. 1301–1328, 2007.