Java Projects on Attribute Key Based Data Security System
ABSTRACT:
As more delicate information is shared and put away by outsider locales on the Internet, there will be a need to encode information put away at these destinations. One downside of encoding information is that it can be specifically shared just at a coarse-grained level (i.e., giving another gathering your private key). We build up another cryptosystem for ¯ne-grained sharing of encoded information that we call Key-Policy Attribute-Based Encryption (KP-ABE). In our cryptosystem, ciphertexts are named with sets of properties and private keys are related with getting to structures that control which ciphertexts a client can unscramble. We exhibit the materialness of our development to sharing of review log data and communicate encryption. As more delicate information is shared and put away by outsider locales on the Internet, there will be a need to encode information put away at these destinations. One downside of encoding information is that it can be specifically shared just at a coarse-grained level (i.e., giving another gathering your private key). We build up another cryptosystem for ¯ne-grained sharing of encoded information that we call Key-Policy Attribute-Based Encryption (KP-ABE). In our cryptosystem, ciphertexts are named with sets of properties and private keys are related with getting to structures that control which ciphertexts a client can unscramble. We exhibit the materialness of our development to sharing of review log data and communicate encryption.
EXISTING SYSTEM
Most existing open key encryption strategies enable a gathering to scramble information to a specific client, however, can’t proficiently deal with more expressive sorts of encoded get to control.
PROPOSED SYSTEM
We build up a significantly wealthier kind of property based encryption crypto framework and show its applications. In our framework, each figure content is named by the encryptor with an arrangement of illustrative qualities. Every private key is related to an entrance structure that indicates which sort of figure messages the key can unscramble. We call such a plan a Key-Policy Attribute-Based Encryption since the entrance structure is determined by the private key, while the figure writings are just named with an arrangement of elucidating qualities.
MODULE DESCRIPTION:
1. Attribute-based Encryption
2. Cryptography
3. Encryption And Decryption
H/W System Configuration:-
Processor – Pentium – III
Speed – 1.1 GHz
Slam – 256 MB (min)
Hard Disk – 20 GB
Floppy Drive – 1.44 MB
Console – Standard Windows Keyboard
Mouse – Two or Three Button Mouse
Screen – SVGA
S/W System Configuration:-
Working System : Windows95/98/2000/XP
Application Server : Tomcat5.0/6.X
Front End : HTML, Java, Jsp
Contents : JavaScript.
Server side Script : Java Server Pages.
Database: My SQL
Database Connectivity: JDBC.
CONCLUSION
We proposed a security safeguarding decentralized ABE plan to ensure the client’s protection. In our plan, all the client’s mystery keys are fixing to his identifier to oppose the agreement assaults while the various experts can’t know anything about the client’s identifier. Strikingly, every specialist can join or leave the framework uninhibitedly without the need of reinitializing the framework and there is no focal expert. Besides, any entrance structure can be communicated in our plan utilizing the entrance tree method. At last, our plan depends on the standard many-sided quality suspicion (e.g., DBDH), instead of the non-standard intricacy suppositions (e.g., DDHI).
Download Project: Attribute Key Based Data Security System
