NDLI: Share a pie?: Privacy-Preserving Knowledge Base Export through Count-min Sketches

Please wait, while we are loading the content...

Research Issues and Approaches for Connected and Automated Vehicles

Ghostbuster: A Fine-grained Approach for Anomaly Detection in File System Accesses

Canonical Completeness in Lattice-Based Languages for Attribute-Based Access Control

Privacy-Preserving HMM Forward Computation

Achieving Differential Privacy in Secure Multiparty Data Aggregation Protocols on Star Networks

Sound and Static Analysis of Session Fixation Vulnerabilities in PHP Web Applications

The Human Capital Model for Security Research: New Insights into Technology Transition

PT-CFI: Transparent Backward-Edge Control Flow Violation Detection Using Intel Processor Trace

Panel: Trustworthy Data Science

Detecting ROP with Statistical Learning of Program Characteristics

All Your VMs are Disconnected: Attacking Hardware Virtualized Network

Ripple: Reflection Analysis for Android Apps in Incomplete Information Environments

Aegis: Automatic Enforcement of Security Policies in Workflow-driven Web Applications

Mining Attributed Graphs for Threat Intelligence

Classifying and Comparing Attribute-Based and Relationship-Based Access Control

Share a pie?: Privacy-Preserving Knowledge Base Export through Count-min Sketches

"If You Can't Beat them, Join them": A Usability Approach to Interdependent Privacy in Cloud Apps

A New Bloom Filter Structure for Searchable Encryption Schemes

Detecting Patching of Executables without System Calls

Large-Scale Identification of Malicious Singleton Files

SGXIO: Generic Trusted I/O Path for Intel SGX

Detecting Mobile Application Spoofing Attacks by Leveraging User Visual Similarity Perception

Discovering Browser Extensions via Web Accessible Resources

Decompression Quines and Anti-Viruses

SAMPAC: Socially-Aware collaborative Multi-Party Access Control

Efficient Commodity Matching for Privacy-Preserving Two-Party Bartering

Seamless and Secure Bluetooth LE Connection Migration

Fault Attacks on Encrypted General Purpose Compute Platforms

Scalable Function Call Graph-based Malware Classification

A Study of Security Vulnerabilities on Docker Hub

Deep Android Malware Detection

Graph Automorphism-Based, Semantics-Preserving Security for the Resource Description Framework (RDF)

Statistical Security Incident Forensics against Data Falsification in Smart Grid Advanced Metering Infrastructure

Differentially-Private Big Data Analytics for High-Speed Research Network Traffic Measurement

Analysis of Exception-Based Control Transfers

DroidSieve: Fast and Accurate Classification of Obfuscated Android Malware

Secure Free-Floating Car Sharing for Offline Cars

Comprehensive Method for Detecting Phishing EmailsUsing Correlation-based Analysis and User Participation

Identifying HTTPS-Protected Netflix Videos in Real-Time

Prioritized Analysis of Inter-App Communication Risks

The Authorization Policy Existence Problem

Towards Practical Privacy-Preserving Life Cycle Assessment Computations

Share a pie?: Privacy-Preserving Knowledge Base Export through Count-min Sketches

Content Provider	ACM Digital Library
Author	Ucci, Daniele Baldoni, Roberto Aniello, Leonardo
Abstract	Knowledge base (KB) sharing among parties has been proven to be beneficial in several scenarios. However such sharing can arise considerable privacy concerns depending on the sensitivity of the information stored in each party's KB. In this paper, we focus on the problem of exporting a (part of a) KB of a party towards a receiving one. We introduce a novel solution that enables parties to export data in a privacy-preserving fashion, based on a probabilistic data structure, namely the \emph{count-min sketch}. With this data structure, KBs can be exported in the form of key-value stores and inserted into a set of count-min sketches, where keys can be sensitive and values are counters. Count-min sketches can be tuned to achieve a given key collision probability, which enables a party to deny having certain keys in its own KB, and thus to preserve its privacy. We also introduce a metric, the γ-deniability (novel for count-min sketches), to measure the privacy level obtainable with a count-min sketch. Furthermore, since the value associated to a key can expose to linkage attacks, noise can be added to a count-min sketch to ensure controlled error on retrieved values. Key collisions and noise alter the values contained in the exported KB, and can affect negatively the accuracy of a computation performed on the exported KB. We explore the tradeoff between privacy preservation and computation accuracy by experimental evaluations in two scenarios related to malware detection.
Starting Page	95
Ending Page	106
Page Count	12
File Format	PDF
ISBN	9781450345231
DOI	10.1145/3029806.3029817
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2017-03-22
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Information sharing Knowledge base export Privacy metric Count-min sketches
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Thesis Proposal: Privacy Preserving Distributed Information Sharing (2005)

Statistical analysis of sketch estimators

Comparing count sketches [1,2] and count min sketches [3].

Privacy-Preserving Information Discovery on EHRs

Sketches for size of join estimation

Take your own share of the PIE

Study on K-anonymity Models of Sharing Medical Information

A novel approach for privacy-preserving video sharing

Albatross: A Privacy-Preserving Location Sharing System

Share a pie?: Privacy-Preserving Knowledge Base Export through Count-min Sketches

Similar Documents

Thesis Proposal: Privacy Preserving Distributed Information Sharing (2005)

Statistical analysis of sketch estimators

Comparing count sketches [1,2] and count min sketches [3].

Privacy-Preserving Information Discovery on EHRs

Sketches for size of join estimation

Take your own share of the PIE

Study on K-anonymity Models of Sharing Medical Information

A novel approach for privacy-preserving video sharing

Albatross: A Privacy-Preserving Location Sharing System

Share a pie?: Privacy-Preserving Knowledge Base Export through Count-min Sketches