Privacy-preserving Authentication of Graphs on Cloud

Speaker:  Ashish Kundu – San Jose, CA, United States
Topic(s):  Information Systems, Search, Information Retrieval, Database Systems, Data Mining, Data Science

Abstract

Leakages of structural information in trees and graphs due to (redactable) signatures lead to privacy and confidentiality breaches. So leakage-free redactable signatures are an important topic especially for third-party data management and cloud computing database-as-a-service models, and in emerging privacy-preserving blockchain platforms.  In this talk, we shall go over the threats and specific privacy attacks on graph data. The talk would then focus on a security model for leakage-free redactable signatures (LFRS)  of not only trees but also graphs and forests. LFRS schemes have several applications, especially in enabling secure data management in the emerging cloud computing paradigm,  Data-as-a-Service computing  as well as in healthcare, finance and biological applications. We also formally define the notion of secure names. Such secure names facilitate leakage-free verification of ordering between siblings/nodes. The paper also proposes a construction for secure names, and a construction for leakage-free redactable signatures based on the secure naming scheme. The proposed construction scheme is super-efficient and computes only one signature  that is stored, transmitted and used for authentication of any tree, graph and forest.  Our scheme is optimal in its efficiency (one signature), supports two important security requirements – authenticity and leakage-free (privacy-preserving/confidentiality), and is versatile in its applicability as it is to trees, graphs as well as forests. Our experimental analysis of the proposed scheme corroborates its efficiency. 

About this Lecture

Number of Slides:  50
Duration:  60 - 120 minutes
Languages Available:  English
Last Updated: 

Request this Lecture

To request this particular lecture, please complete this online form.

Request a Tour

To request a tour with this speaker, please complete this online form.

All requests will be sent to ACM headquarters for review.