EMENDATION OF UNDESIRABLE ATTACK ON MULTIPARTY DATA

SHARING USING AIDA ALGORITHM

Presented By

RENE THOMAS

04/15/2023 Dept. of CSE 1

CONTENTS• OBJECTIVE

• EXISTING SYSTEM

• DRAWBACKS

• PROPOSED SYSTEM

• ADVANTAGES

• MODULES USED

• TABLES USED

• DATAFLOW DIAGRAMS

• SCREENSHOTS

04/15/2023 Dept. of CSE 2

OBJECTIVES

04/15/2023 Dept. of CSE 3

Mainly deals with how we can secure multiparty data sharing with fast and

easy implementation.

In order to have complex data sharing we can use AIDA so that the

computation will be effective than the existed one.

Sharing data between sender and receiver without any conflicts.

Anonymously sharing simple data and results in methods for efficient sharing

of complex data. This can be done with AIDA.

EXISTING SYSTEM

• The privacy preserving data sharing with anonymous id assignment uses

a secure sum algorithm

• Secure sum allows parties to compute sum of their individual inputs

without disclosing the inputs to one another.

• This system is only for the authority and the dominant personalities.

• There is no interaction between the user and the admin and other

respected persons participated through any media.

• Mainly the relevance of the existing system is used in patient medical

records, electronic voting, e-mail, social networking etc. 04/15/2023 Dept. of CSE 4

DRAWBACKS OF EXISTING SYSTEM

• The existing systems another person to easily access database.

• The algorithms for mental poker are more complex and utilize cryptographic methods as players.

• Lack of immediate retrievals.

• Lack of immediate information storage

• Lack of prompt updating

• Considering participants are either semi-honest, passive or honest-but-curious and execute their required protocol faithfully.

• Redundancy of records may occur.

• Data verification and validity are done manually.

04/15/2023 Dept. of CSE 5

PROPOSED SYSTEM

• This work deals with the efficient algorithms for assigning identifiers (ID’s) to the nodes of a network in such a way that the id’s are anonymous using a distributed computation with no central authority.

• Given N nodes, this assignment is essentially a permutation of the integers

{ 1… N} with each id being known only to the node to which it is assigned.

• Anonymously sharing simple data and results in methods for efficient sharing of complex data. This can be done with AIDA.

• The methods developed in these works generally require a trusted administrator and their end products differ from and/or in statistical properties.

04/15/2023 Dept. of CSE 6

ADVANTAGES• Reduce time consumption

• Increasing a parameter in the algorithm reduce no of expected rounds.

• Modules are properly arranged.

• The anonymity of database not affecting the records.

• Avoids unauthorized access on data

• More efficient

• Error detection.

• Redundancy can be avoided.

• Increased user satisfaction

• Highly reliable and flexible

• Easy data retrieval04/15/2023 Dept. of CSE 7

MODULES USED

In this project, there exists various modules:

• Encrypt

• Decrypt

• Authentication

• Admin

• Users

04/15/2023 Dept. of CSE 8

1. Encrypt

In encrypt module the user can encrypt the plain-text into cypher-text.

• Generate id

• Generate key

• Show id

2. Decrypt

Since the message is in cypher-text, the decrypt module used to decrypt the

message from encrypted format.

• Decrypt message

04/15/2023 Dept. of CSE 9

3. Authentication

In authentication module mainly the authentication of user

can be done.

Login

Success message

Unsuccessful message

04/15/2023 Dept. of CSE 10

4. User

• The user module is one of the important module in this system.

• The data transfer can be done across different users.

• User login to the system has four different modules.

Modules in user:View Acknowledgment.View keyReceive dataSend message

04/15/2023 Dept. of CSE 11

5. Admin

Admin can view all the details in the system. He is the one who add the employees according to their designations. He has mainly four modules and each of it have different properties.

• Add Employee

• Send Acknowledgment

• Send data

• Generate id

• Data Encryption

04/15/2023 Dept. of CSE 12

TABLES USED

• Database Table

• t_adminlogin

04/15/2023 Dept. of CSE 13

• t_ack

• t_data

04/15/2023 Dept. of CSE 14

• t_dataencrypt

• t_user

04/15/2023 Dept. of CSE 15

DATA FLOW DIAGRAM

04/15/2023 Dept. of CSE 16

Level 0 : Multiparty Data Sharing

04/15/2023 Dept. of CSE 17

Level 1: Admin and User

04/15/2023 Dept. of CSE 18

Level 2 : Admin

04/15/2023 Dept. of CSE 19

Level 2 : User

04/15/2023 Dept. of CSE 20

SCREEN SHOTS

04/15/2023 Dept. of CSE 21

• Login Page of Admin

04/15/2023 Dept. of CSE 22

• Employee Registration for Admin

04/15/2023 Dept. of CSE 23

• Send Request by Admin and Receive Request by User

04/15/2023 Dept. of CSE 24

• Admin sending data and generating id

04/15/2023 Dept. of CSE 25

• User login

04/15/2023 Dept. of CSE 26

• User receive key and data

04/15/2023 Dept. of CSE 27

Multiple party selection

04/15/2023 Dept. of CSE 28

CONCLUSION

•AIDA rule is the main thing in allocating ID to users

•Even under difficult situations the communications and bandwidth is not affected in any manner.

•AIDA proves to be secure for distributed architecture keeping the user safe from prying persons under attack in different segments.

•In future the scheme may be extended as a web service.

•Mobile web services are an area of interest for future extensions to AIDA.

04/15/2023 Dept. of CSE 29

REFERENCE• A. Friedman, R. Wolff, and A. Schuster, “Providing k-anonymity in data mining,” VLDB Journal, vol. 17, no.

4, pp. 789–804, Jul. 2008.

• F. Baiardi, A. Falleni, R. Granchi, F. Martinelli, M. Petrocchi, and A. Vaccarelli, “Seas, a secure e-voting protocol: Design and implementation,” Comput. Security, vol. 24, no. 8, pp. 642–652, Nov. 2005.

• D. Chaum, “Untraceable electronic mail, return address and digital pseudonyms,” Commun. ACM, vol. 24, no. 2, pp. 84–88, Feb. 1981.

• Q. Xie and U. Hengartner, “Privacy-preserving matchmaking for mobile social networking secure against malicious users,” in Proc. 9th Ann. IEEE Conf. Privacy, Security and Trust, Jul. 2011, pp. 252–259.

• J. Smith, “Distributing identity [symmetry breaking distributed access protocols],” IEEE Robot. Autom. Mag., vol. 6, no. 1, pp. 49–56, Mar. 1999

• Larry A. Dunning, Member, IEEE, and Ray Kresman “Privacy Preserving Data Sharing With Anonymous ID Assignment” in IEEE transaction on information and forensics and security, vol 8, no. 2 february 2013

• Benjamin C.M. Fung, Member, IEEE, Thomas Trojer, Member, IEEE, Patrick C.K. Hung, Member, IEEE, Li Xiong, Member, IEEE,

• Khalil Al-Hussaeni, Member, IEEE, and Rachida Dssouli, Member, IEEE, “Service-Oriented Architecture for High-Dimensional Private Data Mashup” IEEE transactions on services computing,vol. 5, no. 3,july-september 2012

04/15/2023 Dept. of CSE 30

04/15/2023 Dept. of CSE 31

renethomas001@outlook.comaugurene@gmail.com