Trust Management for Publishing Graph Data
Muhammad Umer Arshad - Purdue University
Nov 20, 2013Size: 182.2MB
Download: MP4 Video
Watch in your Browser Watch on YouTube
AbstractUse of graph-structured data models is on the rise -- in graph databases, in representing biological and healthcare data as well as geographical data.
In order to secure graph-structured data, and develop cryptographically secure schemes for graph databases, it is essential to formally define and develop suitable collision resistant one-way hashing schemes and show them they are efficient. The widely used Merkle hash technique is not suitable, because graphs may be directed acyclic ones or cyclic ones.
In this talk, we will address this problem. In particular, we:
(1) discuss the practical and formal security model of hashing schemes for graphs,
(2) present the formal security model of perfectly secure hashing schemes,
(3) describe constructions of hashing and perfectly secure hashing of graphs,
and (4) present performance results for the constructions.
We use graph traversal techniques, which are highly efficient for hashing, redaction, and verification of hashes graphs. We have implemented the proposed schemes. Performance analysis on both real and synthetic graph data sets support the viability of our approach.
About the SpeakerUmer received his MS and BS degrees in ECE from University of Engineering and Technology, Lahore, Pakistan in 2005 and 2002 respectively. Currently he is doctoral student in the School of ECE, Purdue University. His research interests are in the area of distributed systems and information security.
The views, opinions and assumptions expressed in these videos are those of the presenter and do not necessarily reflect the official policy or position of CERIAS or Purdue University. All content included in these videos, are the property of Purdue University, the presenter and/or the presenter’s organization, and protected by U.S. and international copyright laws. The collection, arrangement and assembly of all content in these videos and on the hosting website exclusive property of Purdue University. You may not copy, reproduce, distribute, publish, display, perform, modify, create derivative works, transmit, or in any other way exploit any part of copyrighted material without permission from CERIAS, Purdue University.