COST EFFICIENT SECURE AND PRIVACY PRESERVING GROUP MATCHING

12
COST EFFICIENT SECURE AND PRIVACY PRESERVING GROUP MATCHING IN SOCIAL NETWORKS A MAIN-PROJECT SUBMITTED TO COMPUTER SCIENCE AND SYSTEMS ENGINEERING DEPTARTMENT BY A.GOWRI 09121A1504 T.SAHITHI 09121A1546 S.SARTHAZ 09121A1544 Under the guidance of Ms.T.KAVITHA Assistant professor Department of CSSE Department of Computer Science and Systems Engineering SREE VIDYANIKETHAN ENGINEERING COLLEGE (AUTONOUMS) (Affiliated to JNTU, Anantapur, Approved by AICTE, New Delhi, Accredited by NBA) Sree Sainath Nagar, A.Rangampet-517102 Chittoor Dist, Andhra Pradesh 2009-2013.

description

PPT

Transcript of COST EFFICIENT SECURE AND PRIVACY PRESERVING GROUP MATCHING

Page 1: COST EFFICIENT SECURE AND PRIVACY PRESERVING GROUP MATCHING

COST EFFICIENT SECURE AND PRIVACY PRESERVING GROUP MATCHING IN SOCIAL NETWORKS

A MAIN-PROJECT SUBMITTED TOCOMPUTER SCIENCE AND SYSTEMS ENGINEERING DEPTARTMENT

BY A.GOWRI 09121A1504T.SAHITHI 09121A1546S.SARTHAZ 09121A1544

 Under the guidance of

Ms.T.KAVITHAAssistant professor

Department of CSSE

Department of Computer Science and Systems EngineeringSREE VIDYANIKETHAN ENGINEERING COLLEGE (AUTONOUMS)

(Affiliated to JNTU, Anantapur, Approved by AICTE, New Delhi, Accredited by NBA)Sree Sainath Nagar, A.Rangampet-517102

Chittoor Dist, Andhra Pradesh2009-2013.

Page 2: COST EFFICIENT SECURE AND PRIVACY PRESERVING GROUP MATCHING

AGENDA

Introduction Statement of Problem Objectives Scope Literature Survey Rival Methods Software & Hardware Requirements Physical Model Mathematical Model

Page 3: COST EFFICIENT SECURE AND PRIVACY PRESERVING GROUP MATCHING

INTRODUCTION

Online social network groups are becoming one of the most frequently used features. Groups in general are formed with common attributes. In most situations attributes of users are sensitive and cannot be shared with a person intending to join the group. However, this paper presents an alternative of using a new algorithm- Identity based ring signature scheme from bilinear pairings.

Page 4: COST EFFICIENT SECURE AND PRIVACY PRESERVING GROUP MATCHING

STATEMENT OF PROBLEM

When a stranger wants to join a group, he would need to match the common attributes with the group members. The existing scheme allows the secure sharing of attributes between stranger and users of group with high computation cost.

Page 5: COST EFFICIENT SECURE AND PRIVACY PRESERVING GROUP MATCHING

OBJECTIVES To make group joins more secure. To achieve minimum required information sharing during group joins. To reduce computation cost.

Page 6: COST EFFICIENT SECURE AND PRIVACY PRESERVING GROUP MATCHING

SCOPE

Secure and privacy preserving group matching in social networks by the use of identity based ring signature scheme from bilinear pairings.

Page 7: COST EFFICIENT SECURE AND PRIVACY PRESERVING GROUP MATCHING

LITERATURE SURVEY

Secret interest groups in social networks with an implementation on facebook.

Efficient algorithms for pairing-based cryptology.

ID-based blind signature and ring signature from pairings.

Page 8: COST EFFICIENT SECURE AND PRIVACY PRESERVING GROUP MATCHING

RIVAL METHODS

Gmatch. Batch verification.

Page 9: COST EFFICIENT SECURE AND PRIVACY PRESERVING GROUP MATCHING

SOFTWARE & HARDWARE REQUIREMENTS

Software requirements: HTML. RSA Tool. Guest operating system (Windows XP, Windows 7, Linux).

Hardware Requirements: Computer with 2GB RAM.

Page 10: COST EFFICIENT SECURE AND PRIVACY PRESERVING GROUP MATCHING

PHYSICAL MODEL

Stranger

Internetcloud

Social networkserver

Page 11: COST EFFICIENT SECURE AND PRIVACY PRESERVING GROUP MATCHING

MATHEMATICAL MODEL

• Key Generation:Di=SH1(IDi)

• Ring Signature Generation:(2n-1)Pa+Ha+nAdG1+(2n-2)MuG1+nMuG2

• Ring Signature Verification:2Pa+Ha+(n-1)AdG1+(n+1)MuG1+nMuG2

Page 12: COST EFFICIENT SECURE AND PRIVACY PRESERVING GROUP MATCHING

Any Queries?

Thank You