Approaches to distributed privacy protecting data mining

Size: px
Start display at page:

Download "Approaches to distributed privacy protecting data mining"

Transcription

1 Approaches to distributed privacy protecting data mining Bartosz Przydatek CMU Approaches to distributed privacy protecting data mining p.1/11

2 Introduction Data Mining and Privacy Protection conflicting goals Approaches to distributed privacy protecting data mining p.2/11

3 Introduction Data Mining and Privacy Protection conflicting goals Conflict Resolution: Inference Control Inference Control Techniques Controlled Release Input/Output Perturbation Query Restriction & Auditing... Approaches to distributed privacy protecting data mining p.2/11

4 Introduction Data Mining and Privacy Protection conflicting goals Conflict Resolution: Inference Control Inference Control Techniques Controlled Release Input/Output Perturbation Query Restriction & Auditing... Distributed data mining old and new challenges Approaches to distributed privacy protecting data mining p.2/11

5 Outline What does privacy mean? Perturbation techniques Secure Multi-Party Computation (MPC) Privacy by secure MPC Conclusions Approaches to distributed privacy protecting data mining p.3/11

6 What Does Privacy Mean? Intuitively, it seems to be clear... Exact vs. partial disclosure Approaches to distributed privacy protecting data mining p.4/11

7 What Does Privacy Mean? Intuitively, it seems to be clear... Exact vs. partial disclosure Quantifying Privacy Interval width for a confidence level [Agrawal, Srikant 2000] Information theoretic approach [Agrawal, Aggarwal 2001] Game theoretic approach [Kleinberg, Papadimitriou, Raghavan 2001] Approaches to distributed privacy protecting data mining p.4/11

8 What Does Privacy Mean? Intuitively, it seems to be clear... Exact vs. partial disclosure Quantifying Privacy Interval width for a confidence level [Agrawal, Srikant 2000] Information theoretic approach [Agrawal, Aggarwal 2001] Game theoretic approach [Kleinberg, Papadimitriou, Raghavan 2001] Privacy in secure multi-party computation Approaches to distributed privacy protecting data mining p.4/11

9 Privacy by Perturbation Studied extensively in the context of single databases Can be applied in distributed setting Approaches to distributed privacy protecting data mining p.5/11

10 Privacy by Perturbation Studied extensively in the context of single databases Can be applied in distributed setting Various techniques randomized input distortion output perturbation k-anonymity [Sweeney 98] Approaches to distributed privacy protecting data mining p.5/11

11 Problems with Perturbations Bias, precision & consistency Can be computationally challenging Outlier removal & blurring the data detection of anomalies? Combining multiple versions of data released for different purposes Approaches to distributed privacy protecting data mining p.6/11

12 Secure Multi-Party Computation Introduced by Yao in 1982, inspired by coin-flipping (Blum) and mental poker (Shamir, Rivest, Adleman) m parties P 1,..., P m want to compute f(x 1,..., x m ), where x i is a private input of P i, without revealing more than necessary... Approaches to distributed privacy protecting data mining p.7/11

13 Secure Multi-Party Computation Introduced by Yao in 1982, inspired by coin-flipping (Blum) and mental poker (Shamir, Rivest, Adleman) m parties P 1,..., P m want to compute f(x 1,..., x m ), where x i is a private input of P i, without revealing more than necessary i.e., simulation of a trusted party! Approaches to distributed privacy protecting data mining p.7/11

14 Secure Multi-Party Computation Introduced by Yao in 1982, inspired by coin-flipping (Blum) and mental poker (Shamir, Rivest, Adleman) m parties P 1,..., P m want to compute f(x 1,..., x m ), where x i is a private input of P i, without revealing more than necessary i.e., simulation of a trusted party! A very general and powerful tool, various models Efficient completeness results: [Yao 86] (2-party), [GMW 87] (crypt.) and [BGW+CCD 88] (uncond.) Approaches to distributed privacy protecting data mining p.7/11

15 Privacy by Multi-Party Computation MPC creates a trusted party! Approaches to distributed privacy protecting data mining p.8/11

16 Privacy by Multi-Party Computation MPC creates a trusted party! Problems: Efficiency communication complexity Approaches to distributed privacy protecting data mining p.8/11

17 Privacy by Multi-Party Computation MPC creates a trusted party! Problems: Efficiency communication complexity Does it really solve the privacy problem? Approaches to distributed privacy protecting data mining p.8/11

18 Efficient MPC Solutions Efficient special purpose protocols Learning decision trees [Lindell, Pinkas 2000] Approaches to distributed privacy protecting data mining p.9/11

19 Efficient MPC Solutions Efficient special purpose protocols Learning decision trees [Lindell, Pinkas 2000] Private approximations Introduced by [FIMNSW 2000] A tradeoff between privacy and approximability [Halevi, Krauthgamer, Kushilevitz, Nissim, 2001] Some functions cannot be computed with low communication (set equality vs. set disjointness) Approaches to distributed privacy protecting data mining p.9/11

20 Efficient MPC Solutions Efficient special purpose protocols Learning decision trees [Lindell, Pinkas 2000] Private approximations Introduced by [FIMNSW 2000] A tradeoff between privacy and approximability [Halevi, Krauthgamer, Kushilevitz, Nissim, 2001] Some functions cannot be computed with low communication (set equality vs. set disjointness) A different approach to MPC? Approaches to distributed privacy protecting data mining p.9/11

21 Which queries preserve privacy? Approaches to distributed privacy protecting data mining p.10/11

22 Which queries preserve privacy? Query restriction query-set-size, query-set-overlap query auditing partitioning Approaches to distributed privacy protecting data mining p.10/11

23 Which queries preserve privacy? Query restriction query-set-size, query-set-overlap query auditing partitioning Query auditing efficient in simple cases a NP-hard problem in general [Kleinberg, Papadimitriou, Raghavan 2001] Approaches to distributed privacy protecting data mining p.10/11

24 Conclusions Privacy means... Various approaches, problem dependent Probably no the best single solution Still a lot of work to be done Approaches to distributed privacy protecting data mining p.11/11

A Review on Privacy Preserving Data Mining Approaches

A Review on Privacy Preserving Data Mining Approaches A Review on Privacy Preserving Data Mining Approaches Anu Thomas Asst.Prof. Computer Science & Engineering Department DJMIT,Mogar,Anand Gujarat Technological University Anu.thomas@djmit.ac.in Jimesh Rana

More information

Statistical Databases: Query Restriction

Statistical Databases: Query Restriction Statistical Databases: Query Restriction Nina Mishra January 21, 2004 Introduction A statistical database typically contains information about n individuals where n is very large. A statistical database

More information

Approximation Algorithms for k-anonymity 1

Approximation Algorithms for k-anonymity 1 Journal of Privacy Technology 20051120001 Approximation Algorithms for k-anonymity 1 Gagan Aggarwal 2 Google Inc., Mountain View, CA Tomas Feder 268 Waverley St., Palo Alto, CA Krishnaram Kenthapadi 3

More information

CS573 Data Privacy and Security. Differential Privacy. Li Xiong

CS573 Data Privacy and Security. Differential Privacy. Li Xiong CS573 Data Privacy and Security Differential Privacy Li Xiong Outline Differential Privacy Definition Basic techniques Composition theorems Statistical Data Privacy Non-interactive vs interactive Privacy

More information

Privacy in Statistical Databases

Privacy in Statistical Databases Privacy in Statistical Databases CSE 598D/STAT 598B Fall 2007 Lecture 2, 9/13/2007 Aleksandra Slavkovic Office hours: MW 3:30-4:30 Office: Thomas 412 Phone: x3-4918 Adam Smith Office hours: Mondays 3-5pm

More information

Privacy-Preserving Data Mining

Privacy-Preserving Data Mining Privacy-Preserving Data Mining Alexandre Evfimievski IBM Almaden Research Center, USA P Tyrone Grandison IBM Almaden Research Center, USA INTRODUCTION Privacy-preserving data mining (PPDM) refers to the

More information

Accountability in Privacy-Preserving Data Mining

Accountability in Privacy-Preserving Data Mining PORTIA Privacy, Obligations, and Rights in Technologies of Information Assessment Accountability in Privacy-Preserving Data Mining Rebecca Wright Computer Science Department Stevens Institute of Technology

More information

Research Trends in Privacy Preserving in Association Rule Mining (PPARM) On Horizontally Partitioned Database

Research Trends in Privacy Preserving in Association Rule Mining (PPARM) On Horizontally Partitioned Database 204 IJEDR Volume 2, Issue ISSN: 232-9939 Research Trends in Privacy Preserving in Association Rule Mining (PPARM) On Horizontally Partitioned Database Rachit Adhvaryu, 2 Nikunj Domadiya PG Student, 2 Professor

More information

Security Control Methods for Statistical Database

Security Control Methods for Statistical Database Security Control Methods for Statistical Database Li Xiong CS573 Data Privacy and Security Statistical Database A statistical database is a database which provides statistics on subsets of records OLAP

More information

Privacy Protected Spatial Query Processing

Privacy Protected Spatial Query Processing Privacy Protected Spatial Query Processing Slide 1 Topics Introduction Cloaking-based Solution Transformation-based Solution Private Information Retrieval-based Solution Slide 2 1 Motivation The proliferation

More information

An Architecture for Privacy-preserving Mining of Client Information

An Architecture for Privacy-preserving Mining of Client Information An Architecture for Privacy-preserving Mining of Client Information Murat Kantarcioglu Jaideep Vaidya Department of Computer Sciences Purdue University 1398 Computer Sciences Building West Lafayette, IN

More information

Hiding Sensitive Predictive Frequent Itemsets

Hiding Sensitive Predictive Frequent Itemsets Hiding Sensitive Predictive Frequent Itemsets Barış Yıldız and Belgin Ergenç Abstract In this work, we propose an itemset hiding algorithm with four versions that use different heuristics in selecting

More information

Securing services running over untrusted clouds : the two-tiered trust model

Securing services running over untrusted clouds : the two-tiered trust model Securing services running over untrusted clouds : the two-tiered trust model Aggelos Kiayias (U. Athens & U. Connecticut) Joint work, Juan Garay, Ran Gelles, David Johnson, Moti Yung (AT&T UCLA - AT&T

More information

PPKM: Preserving Privacy in Knowledge Management

PPKM: Preserving Privacy in Knowledge Management PPKM: Preserving Privacy in Knowledge Management N. Maheswari (Corresponding Author) P.G. Department of Computer Science Kongu Arts and Science College, Erode-638-107, Tamil Nadu, India E-mail: mahii_14@yahoo.com

More information

Privacy Preserving Data Publishing: From k-anonymity to Differential Privacy. Xiaokui Xiao Nanyang Technological University

Privacy Preserving Data Publishing: From k-anonymity to Differential Privacy. Xiaokui Xiao Nanyang Technological University Privacy Preserving Data Publishing: From k-anonymity to Differential Privacy Xiaokui Xiao Nanyang Technological University Outline Privacy preserving data publishing: What and Why Examples of privacy attacks

More information

Secure Multiparty Computation

Secure Multiparty Computation Secure Multiparty Computation Li Xiong CS573 Data Privacy and Security Outline Secure multiparty computation Problem and security definitions Basic cryptographic tools and general constructions Yao s Millionnare

More information

Data Anonymization. Graham Cormode.

Data Anonymization. Graham Cormode. Data Anonymization Graham Cormode graham@research.att.com 1 Why Anonymize? For Data Sharing Give real(istic) data to others to study without compromising privacy of individuals in the data Allows third-parties

More information

Privacy in Distributed Database

Privacy in Distributed Database Privacy in Distributed Database Priyanka Pandey 1 & Javed Aktar Khan 2 1,2 Department of Computer Science and Engineering, Takshshila Institute of Engineering and Technology, Jabalpur, M.P., India pandeypriyanka906@gmail.com;

More information

Privacy preserving association rules mining on distributed homogenous databases. Mahmoud Hussein*, Ashraf El-Sisi and Nabil Ismail

Privacy preserving association rules mining on distributed homogenous databases. Mahmoud Hussein*, Ashraf El-Sisi and Nabil Ismail 172 Int. J. Data Mining, Modelling and Management, Vol. 3, No. 2, 2011 Privacy preserving association rules mining on distributed homogenous databases Mahmoud Hussein*, Ashraf El-Sisi and Nabil Ismail

More information

MINING ASSOCIATION RULE FOR HORIZONTALLY PARTITIONED DATABASES USING CK SECURE SUM TECHNIQUE

MINING ASSOCIATION RULE FOR HORIZONTALLY PARTITIONED DATABASES USING CK SECURE SUM TECHNIQUE MINING ASSOCIATION RULE FOR HORIZONTALLY PARTITIONED DATABASES USING CK SECURE SUM TECHNIQUE Jayanti Danasana 1, Raghvendra Kumar 1 and Debadutta Dey 1 1 School of Computer Engineering, KIIT University,

More information

Privacy Preserving Two-Layer Decision Tree Classifier for Multiparty Databases

Privacy Preserving Two-Layer Decision Tree Classifier for Multiparty Databases Privacy Preserving Two-Layer Decision Tree Classifier for Multiparty Databases Alka Gangrade T.I.T.-M.C.A. Technocrats Institute of Technology Bhopal, India alkagangrade@yahoo.co.in Ravindra Patel Dept.

More information

Secure Multi-Party Computation. Lecture 13

Secure Multi-Party Computation. Lecture 13 Secure Multi-Party Computation Lecture 13 Must We Trust? Can we have an auction without an auctioneer?! Declared winning bid should be correct Only the winner and winning bid should be revealed Using data

More information

Introduction to Data Mining

Introduction to Data Mining Introduction to Data Mining Privacy preserving data mining Li Xiong Slides credits: Chris Clifton Agrawal and Srikant 4/3/2011 1 Privacy Preserving Data Mining Privacy concerns about personal data AOL

More information

Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation

Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation Yehuda Lindell Department of Computer Science and Applied Math, Weizmann Institute of Science, Rehovot, Israel. lindell@wisdom.weizmann.ac.il

More information

A FUZZY BASED APPROACH FOR PRIVACY PRESERVING CLUSTERING

A FUZZY BASED APPROACH FOR PRIVACY PRESERVING CLUSTERING A FUZZY BASED APPROACH FOR PRIVACY PRESERVING CLUSTERING 1 B.KARTHIKEYAN, 2 G.MANIKANDAN, 3 V.VAITHIYANATHAN 1 Assistant Professor, School of Computing, SASTRA University, TamilNadu, India. 2 Assistant

More information

Privacy, Security & Ethical Issues

Privacy, Security & Ethical Issues Privacy, Security & Ethical Issues How do we mine data when we can t even look at it? 2 Individual Privacy Nobody should know more about any entity after the data mining than they did before Approaches:

More information

Secure Multiparty Computation: Introduction. Ran Cohen (Tel Aviv University)

Secure Multiparty Computation: Introduction. Ran Cohen (Tel Aviv University) Secure Multiparty Computation: Introduction Ran Cohen (Tel Aviv University) Scenario 1: Private Dating Alice and Bob meet at a pub If both of them want to date together they will find out If Alice doesn

More information

The Applicability of the Perturbation Model-based Privacy Preserving Data Mining for Real-world Data

The Applicability of the Perturbation Model-based Privacy Preserving Data Mining for Real-world Data The Applicability of the Perturbation Model-based Privacy Preserving Data Mining for Real-world Data Li Liu, Murat Kantarcioglu and Bhavani Thuraisingham Computer Science Department University of Texas

More information

Auditing a Batch of SQL Queries

Auditing a Batch of SQL Queries Auditing a Batch of SQL Queries Rajeev Motwani, Shubha U. Nabar, Dilys Thomas Department of Computer Science, Stanford University Abstract. In this paper, we study the problem of auditing a batch of SQL

More information

Research Statement. Yehuda Lindell. Dept. of Computer Science Bar-Ilan University, Israel.

Research Statement. Yehuda Lindell. Dept. of Computer Science Bar-Ilan University, Israel. Research Statement Yehuda Lindell Dept. of Computer Science Bar-Ilan University, Israel. lindell@cs.biu.ac.il www.cs.biu.ac.il/ lindell July 11, 2005 The main focus of my research is the theoretical foundations

More information

CS573 Data Privacy and Security. Cryptographic Primitives and Secure Multiparty Computation. Li Xiong

CS573 Data Privacy and Security. Cryptographic Primitives and Secure Multiparty Computation. Li Xiong CS573 Data Privacy and Security Cryptographic Primitives and Secure Multiparty Computation Li Xiong Outline Cryptographic primitives Symmetric Encryption Public Key Encryption Secure Multiparty Computation

More information

SECURITY IN COMPUTING, FIFTH EDITION

SECURITY IN COMPUTING, FIFTH EDITION 1 SECURITY IN COMPUTING, FIFTH EDITION Chapter 7: Database Security 2 Database Terms Database administrator Database management system (DBMS) Record Field/element Schema Subschema Attribute Relation 3

More information

PBKM: A Secure Knowledge Management Framework

PBKM: A Secure Knowledge Management Framework PBKM: A Secure Knowledge Management Framework (extended abstract) Shouhuai Xu and Weining Zhang Department of Computer Science, University of Texas at San Antonio {shxu,wzhang}@cs.utsa.edu Abstract We

More information

ADDITIVE GAUSSIAN NOISE BASED DATA PERTURBATION IN MULTI-LEVEL TRUST PRIVACY PRESERVING DATA MINING

ADDITIVE GAUSSIAN NOISE BASED DATA PERTURBATION IN MULTI-LEVEL TRUST PRIVACY PRESERVING DATA MINING ADDITIVE GAUSSIAN NOISE BASED DATA PERTURBATION IN MULTI-LEVEL TRUST PRIVACY PRESERVING DATA MINING R.Kalaivani #1,S.Chidambaram #2 # Department of Information Techology, National Engineering College,

More information

Secure Multiparty Computation

Secure Multiparty Computation CS573 Data Privacy and Security Secure Multiparty Computation Problem and security definitions Li Xiong Outline Cryptographic primitives Symmetric Encryption Public Key Encryption Secure Multiparty Computation

More information

Privacy Preserving Naïve Bayes Classifier for Horizontally Distribution Scenario Using Un-trusted Third Party

Privacy Preserving Naïve Bayes Classifier for Horizontally Distribution Scenario Using Un-trusted Third Party IOSR Journal of Computer Engineering (IOSRJCE) ISSN: 2278-0661, ISBN: 2278-8727, Volume 7, Issue 6 (Nov. - Dec. 2012), PP 04-12 Privacy Preserving Naïve Bayes Classifier for Horizontally Distribution Scenario

More information

k Anonymous Private Query Based on Blind Signature and Oblivious Transfer

k Anonymous Private Query Based on Blind Signature and Oblivious Transfer Edith Cowan University Research Online International Cyber Resilience conference Conferences, Symposia and Campus Events 2011 k Anonymous Private Query Based on Blind Signature and Oblivious Transfer Russell

More information

Privacy Preserving Data Mining Technique and Their Implementation

Privacy Preserving Data Mining Technique and Their Implementation International Journal of Research Studies in Computer Science and Engineering (IJRSCSE) Volume 4, Issue 2, 2017, PP 14-19 ISSN 2349-4840 (Print) & ISSN 2349-4859 (Online) DOI: http://dx.doi.org/10.20431/2349-4859.0402003

More information

Distributed Data Mining with Differential Privacy

Distributed Data Mining with Differential Privacy Distributed Data Mining with Differential Privacy Ning Zhang, Ming Li, Wenjing Lou Department of Electrical and Computer Engineering, Worcester Polytechnic Institute, MA Email: {ning, mingli}@wpi.edu,

More information

Preserving Data Mining through Data Perturbation

Preserving Data Mining through Data Perturbation Preserving Data Mining through Data Perturbation Mr. Swapnil Kadam, Prof. Navnath Pokale Abstract Data perturbation, a widely employed and accepted Privacy Preserving Data Mining (PPDM) approach, tacitly

More information

Mining Multiple Private Databases Using a knn Classifier

Mining Multiple Private Databases Using a knn Classifier Mining Multiple Private Databases Using a knn Classifier Li Xiong Emory University lxiong@mathcs.emory.edu Subramanyam Chitti, Ling Liu Georgia Institute of Technology chittis, lingliu@cc.gatech.edu ABSTRACT

More information

PRIVACY-PRESERVING MULTI-PARTY DECISION TREE INDUCTION

PRIVACY-PRESERVING MULTI-PARTY DECISION TREE INDUCTION PRIVACY-PRESERVING MULTI-PARTY DECISION TREE INDUCTION Justin Z. Zhan, LiWu Chang, Stan Matwin Abstract We propose a new scheme for multiple parties to conduct data mining computations without disclosing

More information

Differential Privacy. Seminar: Robust Data Mining Techniques. Thomas Edlich. July 16, 2017

Differential Privacy. Seminar: Robust Data Mining Techniques. Thomas Edlich. July 16, 2017 Differential Privacy Seminar: Robust Techniques Thomas Edlich Technische Universität München Department of Informatics kdd.in.tum.de July 16, 2017 Outline 1. Introduction 2. Definition and Features of

More information

A Theory of Privacy and Utility for Data Sources

A Theory of Privacy and Utility for Data Sources A Theory of Privacy and Utility for Data Sources Lalitha Sankar Princeton University 7/26/2011 Lalitha Sankar (PU) Privacy and Utility 1 Electronic Data Repositories Technological leaps in information

More information

On Privacy-Preservation of Text and Sparse Binary Data with Sketches

On Privacy-Preservation of Text and Sparse Binary Data with Sketches On Privacy-Preservation of Text and Sparse Binary Data with Sketches Charu C. Aggarwal Philip S. Yu Abstract In recent years, privacy preserving data mining has become very important because of the proliferation

More information

. (1) N. supp T (A) = If supp T (A) S min, then A is a frequent itemset in T, where S min is a user-defined parameter called minimum support [3].

. (1) N. supp T (A) = If supp T (A) S min, then A is a frequent itemset in T, where S min is a user-defined parameter called minimum support [3]. An Improved Approach to High Level Privacy Preserving Itemset Mining Rajesh Kumar Boora Ruchi Shukla $ A. K. Misra Computer Science and Engineering Department Motilal Nehru National Institute of Technology,

More information

0x1A Great Papers in Computer Security

0x1A Great Papers in Computer Security CS 380S 0x1A Great Papers in Computer Security Vitaly Shmatikov http://www.cs.utexas.edu/~shmat/courses/cs380s/ C. Dwork Differential Privacy (ICALP 2006 and many other papers) Basic Setting DB= x 1 x

More information

Information Security in Big Data: Privacy & Data Mining

Information Security in Big Data: Privacy & Data Mining Engineering (IJERCSE) Vol. 1, Issue 2, December 2014 Information Security in Big Data: Privacy & Data Mining [1] Kiran S.Gaikwad, [2] Assistant Professor. Seema Singh Solanki [1][2] Everest College of

More information

Final Exam DATA MINING I - 1DL360

Final Exam DATA MINING I - 1DL360 Uppsala University Department of Information Technology Kjell Orsborn Final Exam 2012-10-17 DATA MINING I - 1DL360 Date... Wednesday, October 17, 2012 Time... 08:00-13:00 Teacher on duty... Kjell Orsborn,

More information

Achieving k-anonmity* Privacy Protection Using Generalization and Suppression

Achieving k-anonmity* Privacy Protection Using Generalization and Suppression UT DALLAS Erik Jonsson School of Engineering & Computer Science Achieving k-anonmity* Privacy Protection Using Generalization and Suppression Murat Kantarcioglu Based on Sweeney 2002 paper Releasing Private

More information

Privacy-Preserving Algorithms for Distributed Mining of Frequent Itemsets

Privacy-Preserving Algorithms for Distributed Mining of Frequent Itemsets Privacy-Preserving Algorithms for Distributed Mining of Frequent Itemsets Sheng Zhong August 15, 2003 Abstract Standard algorithms for association rule mining are based on identification of frequent itemsets.

More information

Privacy Protection Against Malicious Adversaries in Distributed Information Sharing Systems

Privacy Protection Against Malicious Adversaries in Distributed Information Sharing Systems Privacy Protection Against Malicious Adversaries in Distributed Information Sharing Systems Nan Zhang, Member, IEEE, Wei Zhao, Fellow, IEEE Abstract We address issues related to sharing information in

More information

VECTOR QUANTIZATION FOR PRIVACY PRESERVING CLUSTERING IN DATA MINING

VECTOR QUANTIZATION FOR PRIVACY PRESERVING CLUSTERING IN DATA MINING VECTOR QUANTIZATION FOR PRIVACY PRESERVING CLUSTERING IN DATA MINING D.Aruna Kumari 1, Dr.Rajasekhara Rao 2 and M.Suman 3 1,3 Department of Electronics and Computer Engineering, K.L.University, Vaddeswaram,Guntur

More information

IMPLEMENTATION OF UNIFY ALGORITHM FOR MINING OF ASSOCIATION RULES IN PARTITIONED DATABASES

IMPLEMENTATION OF UNIFY ALGORITHM FOR MINING OF ASSOCIATION RULES IN PARTITIONED DATABASES IMPLEMENTATION OF UNIFY ALGORITHM FOR MINING OF ASSOCIATION RULES IN PARTITIONED DATABASES KATARU MANI 1, N. JAYA KRISHNA 2 1 Mtech Student, Department of CSE. EMAIL: manicsit@gmail.com 2 Assistant Professor,

More information

Privacy-Preserving SVM Classification on Vertically Partitioned Data

Privacy-Preserving SVM Classification on Vertically Partitioned Data Privacy-Preserving SVM Classification on Vertically Partitioned Data Hwanjo Yu, Jaideep Vaidya 2, and Xiaoqian Jiang University of Iowa, Iowa City IA 08544, USA {hwanjoyu, xjia}@cs.uiowa.edu 2 Rutgers

More information

COIN FLIPPING BY TELEPHONE

COIN FLIPPING BY TELEPHONE COIN FLIPPING BY TELEPHONE A protocol for solving impossible problems Based on Manuel Blum's Paper from 1981 Proved useful for: - Mental poker - Certified Mail - Exchange of Secrets Table of Contents Application

More information

Garbled Circuits via Structured Encryption Seny Kamara Microsoft Research Lei Wei University of North Carolina

Garbled Circuits via Structured Encryption Seny Kamara Microsoft Research Lei Wei University of North Carolina Garbled Circuits via Structured Encryption Seny Kamara Microsoft Research Lei Wei University of North Carolina Garbled Circuits Fundamental cryptographic primitive Possess many useful properties Homomorphic

More information

Leveraging the Multi in Secure Multi-Party Computation

Leveraging the Multi in Secure Multi-Party Computation Leveraging the Multi in Secure Multi-arty Computation Jaideep Vaidya Department of Computer Sciences and CERIAS urdue University 250 N University St West Lafayette, IN 47907-2066 jsvaidya@cs.purdue.edu

More information

Introduction to Secure Multi-Party Computation

Introduction to Secure Multi-Party Computation Introduction to Secure Multi-Party Computation Many thanks to Vitaly Shmatikov of the University of Texas, Austin for providing these slides. slide 1 Motivation General framework for describing computation

More information

Differential Privacy. Cynthia Dwork. Mamadou H. Diallo

Differential Privacy. Cynthia Dwork. Mamadou H. Diallo Differential Privacy Cynthia Dwork Mamadou H. Diallo 1 Focus Overview Privacy preservation in statistical databases Goal: to enable the user to learn properties of the population as a whole, while protecting

More information

PRIVACY PRESERVING IN DISTRIBUTED DATABASE USING DATA ENCRYPTION STANDARD (DES)

PRIVACY PRESERVING IN DISTRIBUTED DATABASE USING DATA ENCRYPTION STANDARD (DES) PRIVACY PRESERVING IN DISTRIBUTED DATABASE USING DATA ENCRYPTION STANDARD (DES) Jyotirmayee Rautaray 1, Raghvendra Kumar 2 School of Computer Engineering, KIIT University, Odisha, India 1 School of Computer

More information

Frequent grams based Embedding for Privacy Preserving Record Linkage

Frequent grams based Embedding for Privacy Preserving Record Linkage Frequent grams based Embedding for Privacy Preserving Record Linkage ABSTRACT Luca Bonomi Emory University Atlanta, USA lbonomi@mathcs.emory.edu Rui Chen Concordia University Montreal, Canada ru_che@encs.concordia.ca

More information

MTAT Research Seminar in Cryptography Building a secure aggregation database

MTAT Research Seminar in Cryptography Building a secure aggregation database MTAT.07.006 Research Seminar in Cryptography Building a secure aggregation database Dan Bogdanov University of Tartu, Institute of Computer Science 22.10.2006 1 Introduction This paper starts by describing

More information

A Survey on A Privacy Preserving Technique using K-means Clustering Algorithm

A Survey on A Privacy Preserving Technique using K-means Clustering Algorithm A Survey on A Privacy Preserving Technique using K-means Clustering Algorithm Falguni A.Patel 1, Chetna G.Chand 2 1 Student(Master of Engineering), Computer Engineering Department, Government Engineering

More information

Privacy and Security Ensured Rule Mining under Partitioned Databases

Privacy and Security Ensured Rule Mining under Partitioned Databases www.ijiarec.com ISSN:2348-2079 Volume-5 Issue-1 International Journal of Intellectual Advancements and Research in Engineering Computations Privacy and Security Ensured Rule Mining under Partitioned Databases

More information

Efficient and Secure Multi-Party Computation with Faulty Majority and Complete Fairness

Efficient and Secure Multi-Party Computation with Faulty Majority and Complete Fairness Efficient and Secure Multi-Party Computation with Faulty Majority and Complete Fairness Juan Garay Philip MacKenzie Ke Yang (Bell Labs) (Bell Labs) (CMU) 0 Multi-Party Computation (MPC) Parties È ½ È ¾

More information

Accumulative Privacy Preserving Data Mining Using Gaussian Noise Data Perturbation at Multi Level Trust

Accumulative Privacy Preserving Data Mining Using Gaussian Noise Data Perturbation at Multi Level Trust Accumulative Privacy Preserving Data Mining Using Gaussian Noise Data Perturbation at Multi Level Trust G.Mareeswari 1, V.Anusuya 2 ME, Department of CSE, PSR Engineering College, Sivakasi, Tamilnadu,

More information

PrivApprox. Privacy- Preserving Stream Analytics.

PrivApprox. Privacy- Preserving Stream Analytics. PrivApprox Privacy- Preserving Stream Analytics https://privapprox.github.io Do Le Quoc, Martin Beck, Pramod Bhatotia, Ruichuan Chen, Christof Fetzer, Thorsten Strufe July 2017 Motivation Clients Analysts

More information

Experimental Analysis of a Privacy-Preserving Scalar Product Protocol

Experimental Analysis of a Privacy-Preserving Scalar Product Protocol Experimental Analysis of a Privacy-Preserving Scalar Product Protocol Zhiqiang Yang Rebecca N. Wright Hiranmayee Subramaniam Computer Science Department Stevens Institute of Technology graduate Stevens

More information

Blind Machine Learning

Blind Machine Learning Blind Machine Learning Vinod Vaikuntanathan MIT Joint work with Chiraag Juvekar and Anantha Chandrakasan Problem 1. Blind Inference (application: Monetizing ML) 6)(asdpasfz $0.1 Convolutional NN MRI Image

More information

A Distributed k-secure Sum Protocol for Secure Multi-Party Computations

A Distributed k-secure Sum Protocol for Secure Multi-Party Computations HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ A Distributed k-secure Sum Protocol for Secure Multi-Party Computations Rashid Sheikh, Beerendra Kumar, Durgesh Kumar Mishra 68 Abstract Secure sum computation

More information

Evaluating the Classification Accuracy of Data Mining Algorithms for Anonymized Data

Evaluating the Classification Accuracy of Data Mining Algorithms for Anonymized Data International Journal of Computer Science and Telecommunications [Volume 3, Issue 8, August 2012] 63 ISSN 2047-3338 Evaluating the Classification Accuracy of Data Mining Algorithms for Anonymized Data

More information

Solutions. Location-Based Services (LBS) Problem Statement. PIR Overview. Spatial K-Anonymity

Solutions. Location-Based Services (LBS) Problem Statement. PIR Overview. Spatial K-Anonymity 2 Location-Based Services (LBS) Private Queries in Location-Based Services: Anonymizers are Not Necessary Gabriel Ghinita Panos Kalnis Ali Khoshgozaran 2 Cyrus Shahabi 2 Kian Lee Tan LBS users Mobile devices

More information

An Ad Omnia Approach to Defining and Achiev ing Private Data Analysis

An Ad Omnia Approach to Defining and Achiev ing Private Data Analysis An Ad Omnia Approach to Defining and Achiev ing Private Data Analysis Mohammad Hammoud CS3525 Dept. of Computer Science University of Pittsburgh Introduction This paper addresses the problem of defining

More information

(α, k)-anonymity: An Enhanced k-anonymity Model for Privacy-Preserving Data Publishing

(α, k)-anonymity: An Enhanced k-anonymity Model for Privacy-Preserving Data Publishing (α, k)-anonymity: An Enhanced k-anonymity Model for Privacy-Preserving Data Publishing Raymond Chi-Wing Wong, Jiuyong Li +, Ada Wai-Chee Fu and Ke Wang Department of Computer Science and Engineering +

More information

FREQUENT ITEMSET MINING USING PFP-GROWTH VIA SMART SPLITTING

FREQUENT ITEMSET MINING USING PFP-GROWTH VIA SMART SPLITTING FREQUENT ITEMSET MINING USING PFP-GROWTH VIA SMART SPLITTING Neha V. Sonparote, Professor Vijay B. More. Neha V. Sonparote, Dept. of computer Engineering, MET s Institute of Engineering Nashik, Maharashtra,

More information

K-Anonymity. Definitions. How do you publicly release a database without compromising individual privacy?

K-Anonymity. Definitions. How do you publicly release a database without compromising individual privacy? K-Anonymity How do you publicly release a database without compromising individual privacy? The Wrong Approach: REU Summer 2007 Advisors: Ryan Williams and Manuel Blum Just leave out any unique identifiers

More information

PERTURBATION BASED RELIABILITY AND MAINTAINING AUTHENTICATION IN DATA MINING

PERTURBATION BASED RELIABILITY AND MAINTAINING AUTHENTICATION IN DATA MINING PERTURBATION BASED RELIABILITY AND MAINTAINING AUTHENTICATION IN DATA MINING Patil Dnyanesh, W Shaikh Zainoddin M Akhtar, Loknath S, Rashmi.T.N Abstract This paper explores the possibility of using multiplicative

More information

PRIVACY PRESERVING DATA MINING BASED ON VECTOR QUANTIZATION

PRIVACY PRESERVING DATA MINING BASED ON VECTOR QUANTIZATION PRIVACY PRESERVING DATA MINING BASED ON VECTOR QUANTIZATION D.Aruna Kumari 1, Dr.K.Rajasekhara Rao 2, M.Suman 3 1,3 Department of Electronics and Computer Engineering, Associate professors,csi Life Member

More information

Privacy Preserving Data Mining. Danushka Bollegala COMP 527

Privacy Preserving Data Mining. Danushka Bollegala COMP 527 Privacy Preserving ata Mining anushka Bollegala COMP 527 Privacy Issues ata mining attempts to ind mine) interesting patterns rom large datasets However, some o those patterns might reveal inormation that

More information

An Overview of Secure Multiparty Computation

An Overview of Secure Multiparty Computation An Overview of Secure Multiparty Computation T. E. Bjørstad The Selmer Center Department of Informatics University of Bergen Norway Prøveforelesning for PhD-graden 2010-02-11 Outline Background 1 Background

More information

k-ttp: A New Privacy Model for Large-Scale Distributed Environments

k-ttp: A New Privacy Model for Large-Scale Distributed Environments To be presented at the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 04), Seattle, WA, USA, Augsut 2004 k-ttp: A New Privacy Model for Large-Scale Distributed Environments

More information

Privacy-Preserving Data Mining in the Fully Distributed Model

Privacy-Preserving Data Mining in the Fully Distributed Model Privacy-Preserving Data Mining in the Fully Distributed Model Rebecca Wright Stevens Institute of Technology www.cs.stevens.edu/~rwright MADNES 05 22 September, 2005 (Includes joint work with Zhiqiang

More information

Secure Multiparty Computation Introduction to Privacy Preserving Distributed Data Mining

Secure Multiparty Computation Introduction to Privacy Preserving Distributed Data Mining CS573 Data Privacy and Security Secure Multiparty Computation Introduction to Privacy Preserving Distributed Data Mining Li Xiong Slides credit: Chris Clifton, Purdue University; Murat Kantarcioglu, UT

More information

The Exact Round Complexity of Secure Computation

The Exact Round Complexity of Secure Computation The Exact Round Complexity of Secure Computation Antigoni Polychroniadou (Aarhus University) joint work with Sanjam Garg, Pratyay Mukherjee (UC Berkeley), Omkant Pandey (Drexel University) Background:

More information

IJSER. Privacy and Data Mining

IJSER. Privacy and Data Mining Privacy and Data Mining 2177 Shilpa M.S Dept. of Computer Science Mohandas College of Engineering and Technology Anad,Trivandrum shilpams333@gmail.com Shalini.L Dept. of Computer Science Mohandas College

More information

k-anonymization May Be NP-Hard, but Can it Be Practical?

k-anonymization May Be NP-Hard, but Can it Be Practical? k-anonymization May Be NP-Hard, but Can it Be Practical? David Wilson RTI International dwilson@rti.org 1 Introduction This paper discusses the application of k-anonymity to a real-world set of microdata

More information

Using Commutative Encryption to Share a Secret

Using Commutative Encryption to Share a Secret Using Commutative Encryption to Share a Secret Saied Hosseini Khayat August 18, 2008 Abstract It is shown how to use commutative encryption to share a secret. Suppose Alice wants to share a secret with

More information

CS 425 / ECE 428 Distributed Systems Fall 2017

CS 425 / ECE 428 Distributed Systems Fall 2017 CS 425 / ECE 428 Distributed Systems Fall 2017 Indranil Gupta (Indy) Dec 5, 2017 Lecture 27: Security All slides IG Security Threats Leakage Unauthorized access to service or data E.g., Someone knows your

More information

International Journal of Modern Engineering and Research Technology

International Journal of Modern Engineering and Research Technology Volume 2, Issue 4, October 2015 ISSN: 2348-8565 (Online) International Journal of Modern Engineering and Research Technology Website: http://www.ijmert.org Privacy Preservation in Data Mining Using Mixed

More information

Cryptography. and Network Security. Lecture 0. Manoj Prabhakaran. IIT Bombay

Cryptography. and Network Security. Lecture 0. Manoj Prabhakaran. IIT Bombay Cryptography and Network Security Lecture 0 Manoj Prabhakaran IIT Bombay Security In this course: Cryptography as used in network security Humans, Societies, The World Network Hardware OS Libraries Programs

More information

Privacy preserving data mining: a signal processing perspective and a simple data perturbation protocol

Privacy preserving data mining: a signal processing perspective and a simple data perturbation protocol Privacy preserving data mining: a signal processing perspective and a simple data perturbation protocol Chai Wah Wu IBM Research Division, Thomas J. Watson Research Center P. O. Box 218, Yorktown Heights,

More information

Blocking Anonymity Threats Raised by Frequent Itemset Mining

Blocking Anonymity Threats Raised by Frequent Itemset Mining Blocking Anonymity Threats Raised by Frequent Itemset Mining M. Atzori 1,2 F. Bonchi 2 F. Giannotti 2 D. Pedreschi 1 1 Department of Computer Science University of Pisa 2 Information Science and Technology

More information

CERIAS Tech Report

CERIAS Tech Report CERIAS Tech Report 25-96 A FRAMEWORK FOR EVALUATING PRIVACY PRESERVING DATA MINING ALGORITHMS by ELISA BERTINO, IGOR NAI FOVINO, LOREDANA PARASILITI PROVENZA Center for Education and Research in Information

More information

An Approach for Privacy Preserving in Association Rule Mining Using Data Restriction

An Approach for Privacy Preserving in Association Rule Mining Using Data Restriction International Journal of Engineering Science Invention Volume 2 Issue 1 January. 2013 An Approach for Privacy Preserving in Association Rule Mining Using Data Restriction Janakiramaiah Bonam 1, Dr.RamaMohan

More information

Notes for Lecture 24

Notes for Lecture 24 U.C. Berkeley CS276: Cryptography Handout N24 Luca Trevisan April 21, 2009 Notes for Lecture 24 Scribed by Milosh Drezgich, posted May 11, 2009 Summary Today we introduce the notion of zero knowledge proof

More information

Privacy-preserving query processing over encrypted data in cloud

Privacy-preserving query processing over encrypted data in cloud Scholars' Mine Doctoral Dissertations Student Research & Creative Works Fall 2015 Privacy-preserving query processing over encrypted data in cloud Yousef M. Elmehdwi Follow this and additional works at:

More information

AN EFFECTIVE FRAMEWORK FOR EXTENDING PRIVACY- PRESERVING ACCESS CONTROL MECHANISM FOR RELATIONAL DATA

AN EFFECTIVE FRAMEWORK FOR EXTENDING PRIVACY- PRESERVING ACCESS CONTROL MECHANISM FOR RELATIONAL DATA AN EFFECTIVE FRAMEWORK FOR EXTENDING PRIVACY- PRESERVING ACCESS CONTROL MECHANISM FOR RELATIONAL DATA Morla Dinesh 1, Shaik. Jumlesha 2 1 M.Tech (S.E), Audisankara College Of Engineering &Technology 2

More information

PRIVACY PRESERVING ANALYSIS OF GRAPH STRUCTURED DATA

PRIVACY PRESERVING ANALYSIS OF GRAPH STRUCTURED DATA PRIVACY PRESERVING ANALYSIS OF GRAPH STRUCTURED DATA by Xiaoyun He A dissertation submitted to the Graduate school-newark Rutgers, The State University of New Jersey in partial fulfillment of the requirements

More information

Privacy-Preserving Machine Learning

Privacy-Preserving Machine Learning Privacy-Preserving Machine Learning CS 760: Machine Learning Spring 2018 Mark Craven and David Page www.biostat.wisc.edu/~craven/cs760 1 Goals for the Lecture You should understand the following concepts:

More information