Muhammad Umer Arshad's guest appearances

Muhammad Umer Arshad

CERIAS Weekly Security Seminar - Purdue University

Ryan Henry

Cory Doctorow

Doug Smith

Larry Ponemon

George Heron

Laura Thomas

Eli Lilly

Stephen Elliott

Tony Sager

David Carroll

Jack Daniel

Joe Judge

Chris Reed

Richard III

John Richardson

OwlTail

Use 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 speaker: Umer 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.

<p>Use of graph-structured data models is on the rise -- in graph databases, in representing biological and healthcare data as well as geographical <a href="http://data.In" rel="nofollow" target="_blank">data.In</a> 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 speaker: Umer 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.</p>

Muhammad Umer Arshad, Trust Management for Publishing Graph Data