Models and Algorithms for Graph Watermarking

  • David Eppstein
  • Michael T. Goodrich
  • Jenny Lam
  • Nil Mamano
  • Michael Mitzenmacher
  • Manuel Torres
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9866)


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.


Watermark Scheme Random Graph Model Permutation Graph Marked Graph Potential Edge 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Backstrom, L., Dwork, C., Kleinberg, J.: Wherefore art thou r3579x?: Anonymized social networks, hidden patterns, and structural steganography. Commun. ACM 54(12), 133–141 (2011)CrossRefGoogle Scholar
  2. 2.
    Bollobás, B.: Random Graphs, Cambridge Studies in Advanced Mathematics, vol. 73, 2nd edn. Cambridge University Press, Cambridge (2001)CrossRefGoogle Scholar
  3. 3.
    Caldarelli, G.: Scale-Free Networks: Complex Webs in Nature and Technology. Oxford University Press, Oxford (2013)zbMATHGoogle Scholar
  4. 4.
    Chung, F., Lu, L.: Complex graphs and networks. In: CBMS Regional Conference Series in Mathematics, vol. 107. American Mathematical Society (2006)Google Scholar
  5. 5.
    Collberg, C.S., Kobourov, S.G., Carter, E., Thomborson, C.: Graph-based approaches to software watermarking. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol. 2880, pp. 156–167. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  6. 6.
    Collberg, C., Thomborson, C.: Software watermarking: models and dynamic embeddings. In: ACM Symposium on Principles of Programming Language (POPL), pp. 311–324 (1999)Google Scholar
  7. 7.
    Eppstein, D., Goodrich, M.T., Lam, J., Mamano, N., Mitzenmacher, M., Torres, M.: Models and algorithms for graph watermarking. ArXiv ePrint abs/1605.09425 (2016).
  8. 8.
    Hopper, N.J., Molnar, D., Wagner, D.: From weak to strong watermarking. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 362–382. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  9. 9.
    Khanna, S., Zane, F.: Watermarking maps: hiding information in structured data. In: 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 596–605 (2000).
  10. 10.
    Leskovec, J., Sosič, R.: SNAP: a general purpose network analysis and graph mining library in C++.
  11. 11.
    Mislove, A., Marcon, M., Gummadi, K.P., Druschel, P., Bhattacharjee, B.: Measurement and analysis of online social networks. In: 5th ACM/Usenix Internet Measurement Conference (IMC) (2007)Google Scholar
  12. 12.
    Mitzenmacher, M.: A brief history of generative models for power law and lognormal distributions. Internet Math. 1(2), 226–251 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Narayanan, A., Shmatikov, V.: De-anonymizing social networks. In: IEEE Symposium on Security and Privacy (SP), pp. 173–187 (2009)Google Scholar
  14. 14.
    Newman, M., Barabasi, A.L., Watts, D.J.: The Structure and Dynamics of Networks. Princeton Studies in Complexity. Princeton University Press, Princeton (2006)zbMATHGoogle Scholar
  15. 15.
    Sala, A., Cao, L., Wilson, C., Zablit, R., Zheng, H., Zhao, B.Y.: Measurement-calibrated graph models for social network experiments. In: 19th International Conference on the World Wide Web (WWW), pp. 861–870 (2010)Google Scholar
  16. 16.
    Venkatesan, R., Vazirani, V.V., Sinha, S.: A graph theoretic approach to software watermarking. In: Moskowitz, I.S. (ed.) IH 2001. LNCS, vol. 2137, pp. 157–168. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  17. 17.
    Yang, J., Leskovec, J.: Defining and evaluating network communities based on ground-truth. CoRR abs/1205.6233 (2012).
  18. 18.
    Zhao, X., Liu, Q., Zheng, H., Zhao, B.Y.: Towards graph watermarks. In: 2015 ACM Conference on Online Social Networks (COSN), pp. 101–112 (2015)Google Scholar
  19. 19.
    Zhao, X., Liu, Q., Zhou, L., Zheng, H., Zhao, B.Y.: Graph watermarks. ArXiv ePrint abs/1506.00022 (2015).

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