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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Or “whp,” that is, with probability at least \(1 - O(n^{-a})\), for some \(a>0\).
References
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)
Bollobás, B.: Random Graphs, Cambridge Studies in Advanced Mathematics, vol. 73, 2nd edn. Cambridge University Press, Cambridge (2001)
Caldarelli, G.: Scale-Free Networks: Complex Webs in Nature and Technology. Oxford University Press, Oxford (2013)
Chung, F., Lu, L.: Complex graphs and networks. In: CBMS Regional Conference Series in Mathematics, vol. 107. American Mathematical Society (2006)
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)
Collberg, C., Thomborson, C.: Software watermarking: models and dynamic embeddings. In: ACM Symposium on Principles of Programming Language (POPL), pp. 311–324 (1999)
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). http://arxiv.org/abs/1605.09425
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)
Khanna, S., Zane, F.: Watermarking maps: hiding information in structured data. In: 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 596–605 (2000). http://dl.acm.org/citation.cfm?id=338219.338612
Leskovec, J., Sosič, R.: SNAP: a general purpose network analysis and graph mining library in C++. http://snap.stanford.edu/snap
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)
Mitzenmacher, M.: A brief history of generative models for power law and lognormal distributions. Internet Math. 1(2), 226–251 (2004)
Narayanan, A., Shmatikov, V.: De-anonymizing social networks. In: IEEE Symposium on Security and Privacy (SP), pp. 173–187 (2009)
Newman, M., Barabasi, A.L., Watts, D.J.: The Structure and Dynamics of Networks. Princeton Studies in Complexity. Princeton University Press, Princeton (2006)
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)
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)
Yang, J., Leskovec, J.: Defining and evaluating network communities based on ground-truth. CoRR abs/1205.6233 (2012). http://arxiv.org/abs/1205.6233
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)
Zhao, X., Liu, Q., Zhou, L., Zheng, H., Zhao, B.Y.: Graph watermarks. ArXiv ePrint abs/1506.00022 (2015). http://arxiv.org/abs/1506.00022
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
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. https://doi.org/10.1007/978-3-319-45871-7_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-45871-7_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-45870-0
Online ISBN: 978-3-319-45871-7
eBook Packages: Computer ScienceComputer Science (R0)