eceBatchcescescsecescesccsecscecs16.pptx

raosg 2 views 22 slides Mar 06, 2025
Slide 1
Slide 1 of 22
Slide 1
1
Slide 2
2
Slide 3
3
Slide 4
4
Slide 5
5
Slide 6
6
Slide 7
7
Slide 8
8
Slide 9
9
Slide 10
10
Slide 11
11
Slide 12
12
Slide 13
13
Slide 14
14
Slide 15
15
Slide 16
16
Slide 17
17
Slide 18
18
Slide 19
19
Slide 20
20
Slide 21
21
Slide 22
22

About This Presentation

abc


Slide Content

Implementation of Honey Encryption Batch 16 Guided By: Mr. S. Sumahasan Asst. Professor, CSE Dept, GVPW Team Members: M. B. Vaishnavi (15 - 557) K. V. S. D. Sirisha (15- 540) B. Meenakshi (16- 501) Department of Computer Science and Engineering Gayatri Vidya Parishad College of Engineering for Women

Contents Abstract Introduction Existing System Proposed System System Requirements UML Diagrams Project Modules Conclusion Future Enhancement References

Abstract Many working systems in today’s world rely on user-inputted secrets, such as Password-Based Encryption(PBE ). These secrets are inherently weak and of low entropy T hus becomes more likely that the attackers or hackers can break into accounts using Brute force, Dictionary attacks Honey encryption is a encryption scheme that provides resilience against brute force attacks Ensures that messages decrypted with invalid keys yield a valid-looking message .

Introduction Honey Encryption was created by Ari Juels , former chief scientist of the RSA, and Thomas Risten Part from the University of Wisconsin . Honey Encryption is best-suited for constructions in which encrypted data is derived from passwords . It is a security tool that makes it difficult for an attacker who is carrying out a brute force attack to know if he has correctly guessed a passwords or encryption key.

Existing System The existing password based encryption (PBE) methods that are used to protect private data are vulnerable to brute-force attacks. Reason: for a wrongly guessed key, the decryption process gives an invalid-looking plaintext message, confirming the invalidity of the key, while for the correct key it outputs a valid-looking plaintext message, confirming the correctness of the guessed key

Proposed System A new type of encryption scheme called Honey Encryption, by Thomas Ristenpart and Ari Juels . Even though the guessed key is not same as secret key, it generates an valid looking output. Thus confuses the attacker by not confirming the validity of the output

System Requirements Software Requirements: Python3 Flask Visual Studio Code (editor) Hardware Requirements: Os : Windows 7/8/10/XP Pentium IV system with 2.8 GHZ processor RAM : 1GB HDD : 40GB

Project Modules Login : Here, users who have already registered can login to the website by entering email id and password given at the time of registration Registration : Users, who have not yet registered would provide their details (which must be unique ) along with password which they have to use during login

Project Modules Honey Enceyption: Users who have logged in can enter the credit card number, secret key and the guess key. If the secret key and guess key are same, the credit card no. which is entered is displayed. Else, a valid looking credit card is displayed by using the algorithm.

Algorithm Used

Honey Encryption

Activity diagram

State chart diagram

Output Screens Login page

Registration Page

After Successful Login

Entering Details

Result

Entering Details

Result

Conclusion In this project we have presented our implementation of a honey encryption scheme and its application to the credit card use case. Specifically, we addressed the key challenge of generating valid looking messages.

Future Enhancements Honey Encryption can also be applied to message space that follows a simple structure, namely questions and answers.