{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T09:10:02Z","timestamp":1746177002904,"version":"3.40.4"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319054155"},{"type":"electronic","value":"9783319054162"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-05416-2_6","type":"book-chapter","created":{"date-parts":[[2014,4,5]],"date-time":"2014-04-05T05:41:09Z","timestamp":1396676469000},"page":"71-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Strand Space Approach to Provable Anonymity"],"prefix":"10.1007","author":[{"given":"Yongjian","family":"Li","sequence":"first","affiliation":[]},{"given":"Jun","family":"Pang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,4,6]]},"reference":[{"key":"6_CR1","series-title":"LNCS","first-page":"198","volume-title":"ESORICS 1996","author":"S Schneider","year":"1996","unstructured":"Schneider, S., Sidiropoulos, A.: CSP and anonymity. In: Martella, G., Kurth, H., Montolivo, E., Bertino, E. (eds.) ESORICS 1996. LNCS, vol. 1146, pp. 198\u2013218. Springer, Heidelberg (1996)"},{"issue":"1","key":"6_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/JCS-2004-12102","volume":"12","author":"D Hughes","year":"2004","unstructured":"Hughes, D., Shmatikov, V.: Information hiding, anonymity and privacy: a modular approach. J. Comput. Secur. 12(1), 3\u201336 (2004)","journal-title":"J. Comput. Secur."},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Garcia, F.D., Hasuo, I., Pieters, W., van Rossum, P.: Provable anonymity. In: Proceedings of the 3rd Workshop on Formal Methods in Security Engineering, pp. 63\u201372. ACM (2005)","DOI":"10.1145\/1103576.1103585"},{"key":"6_CR4","series-title":"LNCS","first-page":"301","volume-title":"TGC 2006","author":"T Chothia","year":"2007","unstructured":"Chothia, T., Orzan, S., Pang, J., Torabi Dashti, M.: A Framework for automatically checking anonymity with $$\\mu $$ CRL. In: Montanari, U., Sannella, D., Bruni, R. (eds.) TGC 2006. LNCS, vol. 4661, pp. 301\u2013318. Springer, Heidelberg (2007)"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Arapinis, M., Chothia, T., Ritter, E., Ryan, M.D.: Analysing unlinkability and anonymity using the applied pi calculus. In: Proceedings of the 23rd IEEE Computer Security Foundations Symposium, pp. 107\u2013121. IEEE CS (2010)","DOI":"10.1109\/CSF.2010.15"},{"issue":"3\/4","key":"6_CR6","doi-asserted-by":"crossref","first-page":"355","DOI":"10.3233\/JCS-2004-123-403","volume":"12","author":"V Shmatikov","year":"2004","unstructured":"Shmatikov, V.: Probabilistic model checking of an anonymity system. J. Comput. Secur. 12(3\/4), 355\u2013377 (2004)","journal-title":"J. Comput. Secur."},{"issue":"3","key":"6_CR7","doi-asserted-by":"crossref","first-page":"483","DOI":"10.3233\/JCS-2005-13305","volume":"13","author":"JY Halpern","year":"2005","unstructured":"Halpern, J.Y., O\u2019Neill, K.R.: Anonymity and information hiding in multiagent systems. J. Comput. Secur. 13(3), 483\u2013514 (2005)","journal-title":"J. Comput. Secur."},{"key":"6_CR8","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/11539452_16","volume-title":"CONCUR 2005","author":"M Bhargava","year":"2005","unstructured":"Bhargava, M., Palamidessi, C.: Probabilistic anonymity. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 171\u2013185. Springer, Heidelberg (2005)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Deng, Y., Palamidessi, C., Pang, J.: Weak probabilistic anonymity. In: Proceedings of the 3rd Workshop on Security Issues in Concurrency, vol. 180 of ENTCS, pp. 55\u201376 (2007)","DOI":"10.1016\/j.entcs.2005.05.047"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Chen, X., Pang, J.: Measuring query privacy in location-based services. In: Proceedings of the 2nd ACM Conference on Data and Application Security and Privacy, pp. 49\u201360. ACM Press (2012)","DOI":"10.1145\/2133601.2133608"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Chen, X., Pang, J.: Protecting query privacy in location-based services. GeoInformatica (2013, To appear)","DOI":"10.1145\/2133601.2133608"},{"issue":"4","key":"6_CR12","doi-asserted-by":"crossref","first-page":"435","DOI":"10.3233\/JCS-2009-0340","volume":"17","author":"S Delaune","year":"2009","unstructured":"Delaune, S., Kremer, S., Ryan, M.D.: Verifying privacy-type properties of electronic voting protocols. J. Comput. Secur. 17(4), 435\u2013487 (2009)","journal-title":"J. Comput. Secur."},{"issue":"2\u20133","key":"6_CR13","first-page":"89","volume":"64","author":"HL Jonker","year":"2009","unstructured":"Jonker, H.L., Mauw, S., Pang, J.: A formal framework for quantifying voter-controlled privacy. J. Algorithm Cogn. Inf. Logic 64(2\u20133), 89\u2013105 (2009)","journal-title":"J. Algorithm Cogn. Inf. Logic"},{"key":"6_CR14","series-title":"LNCS","first-page":"87","volume-title":"ACNS 2007","author":"Z Luo","year":"2007","unstructured":"Luo, Z., Cai, X., Pang, J., Deng, Y.: Analyzing an electronic cash protocol using applied pi calculus. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol. 4521, pp. 87\u2013103. Springer, Heidelberg (2007)"},{"key":"6_CR15","unstructured":"Yan, L., Sere, K., Zhou, X., Pang, J.: Towards an integrated architecture for peer-to-peer and ad hoc overlay network applications. In: Proceedings of the 10th Workshop on Future Trends in Distributed Computing Systems, pp. 312\u2013318. IEEE CS (2004)"},{"key":"6_CR16","series-title":"LNCS","first-page":"115","volume-title":"FORTE 2006","author":"T Chothia","year":"2006","unstructured":"Chothia, T.: Analysing the MUTE anonymous file-sharing system using the pi-calculus. In: Najm, E., Pradat-Peyre, J.-F., Donzeau-Gouge, V.V. (eds.) FORTE 2006. LNCS, vol. 4229, pp. 115\u2013130. Springer, Heidelberg (2006)"},{"key":"6_CR17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-642-33167-1_19","volume-title":"ESORICS 2012","author":"N Dong","year":"2012","unstructured":"Dong, N., Jonker, H., Pang, J.: Formal analysis of privacy in an eHealth protocol. In: Foresti, S., Yung, M., Martinelli, F. (eds.) ESORICS 2012. LNCS, vol. 7459, pp. 325\u2013342. Springer, Heidelberg (2012)"},{"issue":"1","key":"6_CR18","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.ipl.2006.06.016","volume":"101","author":"Y Kawabe","year":"2007","unstructured":"Kawabe, Y., Mano, K., Sakurada, H., Tsukada, Y.: Theorem-proving anonymity of infinite state systems. Inform. Process. Lett. 101(1), 46\u201351 (2007)","journal-title":"Inform. Process. Lett."},{"key":"6_CR19","series-title":"LNCS","volume-title":"Isabelle\/HOL","year":"2002","unstructured":"Nipkow, T., Paulson, L.C., Wenzel, M.T. (eds.): Isabelle\/HOL. LNCS, vol. 2283. Springer, Heidelberg (2002)"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Li, Y., Pang, J.: An inductive approach to provable anonymity. In: Proceedings of the 6th Conference on Availability, Reliability and Security, pp. 454\u2013459. IEEE CS (2011)","DOI":"10.1109\/ARES.2011.70"},{"key":"6_CR21","unstructured":"Javier Thayer, F., Herzog, J.C., Guttman, J.D.: Strand spaces: why is a security protocol correct? In: Proceedings of the 19th IEEE Symposium on Security and Privacy, pp. 96\u2013109. IEEE CS (1998)"},{"issue":"1","key":"6_CR22","doi-asserted-by":"crossref","first-page":"191","DOI":"10.3233\/JCS-1999-72-304","volume":"7","author":"JF Thayer","year":"1999","unstructured":"Thayer, J.F., Herzog, J.C., Guttman, J.D.: Strand spaces: proving security protocols correct. J. Comput. Secur. 7(1), 191\u2013230 (1999)","journal-title":"J. Comput. Secur."},{"issue":"4","key":"6_CR23","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s00165-011-0187-2","volume":"25","author":"Y Li","year":"2013","unstructured":"Li, Y., Pang, J.: An inductive approach to strand spaces. Formal Aspects Comput. 25(4), 465\u2013501 (2013)","journal-title":"Formal Aspects Comput."},{"key":"6_CR24","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/3-540-61996-8_37","volume-title":"Information Hiding","author":"DM Goldschlag","year":"1996","unstructured":"Goldschlag, D.M., Reed, M.G., Syverson, P.F.: Hiding routing information. In: Anderson, R. (ed.) Information Hiding. LNCS, vol. 1774, pp. 137\u2013150. Springer, Heidelberg (1996)"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Syverson, P.F., Goldschlag, D.M., Reed, M.G.: Anonymous connections and onion routing. In: Proceedings of the 18th IEEE Symposium on Security and Privacy, pp. 44\u201354. IEEE (1997)","DOI":"10.1109\/SECPRI.1997.601314"},{"issue":"12","key":"6_CR26","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"29","author":"D Dolev","year":"1983","unstructured":"Dolev, D., Yao, A.: On the security of public key protocols. IEEE Trans. Inf. Theory 29(12), 198\u2013208 (1983)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Dingledine, R., Mathewson, N., Syverson, P.F.: Tor: the second-generation onion router. In: Proceedings of the 13th USENIX Security Symposium, pp. 303\u2013320 (2004)","DOI":"10.21236\/ADA465464"},{"issue":"2","key":"6_CR28","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"DL Chaum","year":"1981","unstructured":"Chaum, D.L.: Untraceable electronic mail, return addresses, and\u00a0digital\u00a0pseudonyms. Commun. ACM 24(2), 84\u201390 (1981)","journal-title":"Commun. ACM"}],"container-title":["Communications in Computer and Information Science","Formal Techniques for Safety-Critical Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-05416-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T08:46:55Z","timestamp":1746175615000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-05416-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319054155","9783319054162"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-05416-2_6","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"6 April 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}