Secure Error-Tolerant Graph Matching Protocols

  • Kalikinkar Mandal
  • Basel Alomair
  • Radha Poovendran
Conference paper

DOI: 10.1007/978-3-319-48965-0_16

Volume 10052 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Mandal K., Alomair B., Poovendran R. (2016) Secure Error-Tolerant Graph Matching Protocols. In: Foresti S., Persiano G. (eds) Cryptology and Network Security. CANS 2016. Lecture Notes in Computer Science, vol 10052. Springer, Cham

Abstract

We consider a setting where there are two parties, each party holds a private graph and they wish to jointly compute the structural dissimilarity between two graphs without revealing any information about their private input graph. Graph edit distance (GED) is a widely accepted metric for measuring the dissimilarity of graphs. It measures the minimum cost for transforming one graph into the other graph by applying graph edit operations. In this paper we present a framework for securely computing approximated GED and as an example, present a protocol based on threshold additive homomorphic encryption scheme. We develop several new sub-protocols such as private maximum computation and optimal assignment protocols to construct the main protocol. We show that our protocols are secure against semi-honest adversaries. The asymptotic complexity of the protocol is \(O(n^5\ell \log ^*(\ell ))\) where \(\ell \) is the bit length of ring elements and n is the number of nodes in the graph.

Keywords

Secure two-party computation Graph edit distance Privacy Graph algorithms 

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  • Kalikinkar Mandal
    • 1
  • Basel Alomair
    • 2
  • Radha Poovendran
    • 1
  1. 1.Network Security Lab, Department of Electrical EngineeringUniversity of WashingtonSeattleUSA
  2. 2.National Center for Cybersecurity TechnologiesKing Abdulaziz City for Science and Technology (KACST)RiyadhSaudi Arabia