Models and Algorithms for Graph Watermarking

  • David Eppstein
  • Michael T. Goodrich
  • Jenny Lam
  • Nil Mamano
  • Michael Mitzenmacher
  • Manuel Torres
Conference paper

DOI: 10.1007/978-3-319-45871-7_18

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9866)
Cite this paper as:
Eppstein D., Goodrich M.T., Lam J., Mamano N., Mitzenmacher M., Torres M. (2016) Models and Algorithms for Graph Watermarking. In: Bishop M., Nascimento A. (eds) Information Security. ISC 2016. Lecture Notes in Computer Science, vol 9866. Springer, Cham

Abstract

We introduce models and algorithmic foundations for graph watermarking. Our approach is based on characterizing the feasibility of graph watermarking in terms of keygen, marking, and identification functions defined over graph families with known distributions. We demonstrate the strength of this approach with exemplary watermarking schemes for two random graph models, the classic Erdős-Rényi model and a random power-law graph model, both of which are used to model real-world networks.

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • David Eppstein
    • 1
  • Michael T. Goodrich
    • 1
  • Jenny Lam
    • 2
  • Nil Mamano
    • 1
  • Michael Mitzenmacher
    • 3
  • Manuel Torres
    • 1
  1. 1.Department of Computer ScienceUniversity of CaliforniaIrvineUSA
  2. 2.Department of Computer ScienceSan José State UniversitySan JoséUSA
  3. 3.Department of Computer ScienceHarvard UniversityCambridgeUSA

Personalised recommendations