{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:27:31Z","timestamp":1750307251300,"version":"3.41.0"},"reference-count":19,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2010,12,1]],"date-time":"2010-12-01T00:00:00Z","timestamp":1291161600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/E040829\/1"],"award-info":[{"award-number":["EP\/E040829\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst. Secur."],"published-print":{"date-parts":[[2010,12]]},"abstract":"<jats:p><jats:italic>Anonymity with identity escrow<\/jats:italic>attempts to allow users of an online service to remain anonymous, while providing the possibility that the service owner can break the anonymity in exceptional circumstances, such as to assist in a criminal investigation. In the article, we propose an identity escrow protocol that distributes user identity among several escrow agents. The main feature of our scheme is it is based on standard encryption algorithms and it provides user anonymity even if all but one escrow holders are dishonest acting in a coalition. We also present analysis of the anonymity property of our protocol in the applied pi-calculus. We review a related scheme by Marshall and Molina-Jiminez [2003] that aimed to achieve goals similar to ours, and show that their scheme suffers from serious weaknesses.<\/jats:p>","DOI":"10.1145\/1880022.1880035","type":"journal-article","created":{"date-parts":[[2010,12,29]],"date-time":"2010-12-29T14:32:48Z","timestamp":1293633168000},"page":"1-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Identity Escrow Protocol and Anonymity Analysis in the Applied Pi-Calculus"],"prefix":"10.1145","volume":"13","author":[{"given":"Aybek","family":"Mukhamedov","sequence":"first","affiliation":[{"name":"University of Birmingham"}]},{"given":"Mark D.","family":"Ryan","sequence":"additional","affiliation":[{"name":"University of Birmingham"}]}],"member":"320","published-online":{"date-parts":[[2010,12]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Abadi M. Blanchet B. and Fournet C . 2004 . Just fast keying in the pi calculus. In Proceedings of the 13th European Symposium on Programming (ESOP\u201904). D. Schmidt Ed. Lecture Notes in Computer Science vol. 2986 Springer 340--354. Abadi M. Blanchet B. and Fournet C. 2004. Just fast keying in the pi calculus. In Proceedings of the 13th European Symposium on Programming (ESOP\u201904) . D. Schmidt Ed. Lecture Notes in Computer Science vol. 2986 Springer 340--354.","DOI":"10.1007\/978-3-540-24725-8_24"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/360204.360213"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/872752.873511"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SECPRI.2004.1301317"},{"key":"e_1_2_1_5_1","unstructured":"BusinessWeek. 2000. Business Week\/Harris poll: A growing threat. Bus. Week. BusinessWeek . 2000. Business Week\/Harris poll: A growing threat. Bus. Week ."},{"volume-title":"Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology (CRYPTO\u201901)","author":"Camenisch J.","key":"e_1_2_1_6_1"},{"volume-title":"Proceedings of the 24th Annual International Cryptology Conference on Advances in Cryptology (CRYPTO\u201904)","author":"Camenisch J.","key":"e_1_2_1_7_1"},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Camenisch J. and Shoup V . 2003 . Practical verifiable encryption and decryption of discrete logarithms. In Proceedings of the Annual International Cryptology Conference (CRYPTO). D. Boneh Ed. Lecture Notes in Computer Science vol. 2729 Springer 126--144. Camenisch J. and Shoup V. 2003. Practical verifiable encryption and decryption of discrete logarithms. In Proceedings of the Annual International Cryptology Conference (CRYPTO) . D. Boneh Ed. Lecture Notes in Computer Science vol. 2729 Springer 126--144.","DOI":"10.1007\/978-3-540-45146-4_8"},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Cranor L. F. Reagle J. and Ackerman M. 1999. Beyond concern: Understanding net users\u2019 attitudes about online privacy. Tech. rep. AT&amp;T Labs-Research. Cranor L. F. Reagle J. and Ackerman M. 1999. Beyond concern: Understanding net users\u2019 attitudes about online privacy. Tech. rep. AT&amp;T Labs-Research.","DOI":"10.7551\/mitpress\/3874.003.0008"},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Fournet C. and Abadi M . 2003 . Hiding names: Private authentication in the applied pi-calculus. In Proceedings of the International Symposium on Software Security (ISSS\u201902). M. Okada et al. Eds. Lecture Notes in Computer Science vol. 2609 Springer 317--338. Fournet C. and Abadi M. 2003. Hiding names: Private authentication in the applied pi-calculus. In Proceedings of the International Symposium on Software Security (ISSS\u201902) . M. Okada et al. Eds. Lecture Notes in Computer Science vol. 2609 Springer 317--338.","DOI":"10.1007\/3-540-36532-X_20"},{"key":"e_1_2_1_11_1","unstructured":"Harris. 1999. IBM multi-national consumer privacy survey. Harris Interactive. Harris . 1999. IBM multi-national consumer privacy survey. Harris Interactive ."},{"key":"e_1_2_1_12_1","unstructured":"Kiayias A. and Yung M. 2004. Group signatures: Provable security efficient constructions and anonymity from trapdoor-holders. Cryptology ePrint Archive rep. 2004\/076. http:\/\/eprint.iacr.org\/. Kiayias A. and Yung M. 2004. Group signatures: Provable security efficient constructions and anonymity from trapdoor-holders. Cryptology ePrint Archive rep. 2004\/076. http:\/\/eprint.iacr.org\/."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/646763.706323"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31987-0_14"},{"key":"e_1_2_1_15_1","unstructured":"Leighton T. 1994. Failsafe key escrow systems. Tech. memo 483 MIT Laboratory for Computer Science. Leighton T. 1994. Failsafe key escrow systems. Tech. memo 483 MIT Laboratory for Computer Science."},{"volume-title":"Proceedings of the 1st International Workshop on Formal Aspects in Security and Trust. T. Dimitrakos and F. Martinelli Eds., 121--129","author":"Marshall L.","key":"e_1_2_1_16_1"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/646757.705519"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11679219_17"},{"key":"e_1_2_1_19_1","unstructured":"Mukhamedov A. and Ryan M. D. 2007. On anonymity with identity escrow. In Proceedings of the 3rd Symposium on Trustworthy Global Computing (TGC). Lecture Notes in Computer Science Springer. Mukhamedov A. and Ryan M. D. 2007. On anonymity with identity escrow. In Proceedings of the 3rd Symposium on Trustworthy Global Computing (TGC) . Lecture Notes in Computer Science Springer."}],"container-title":["ACM Transactions on Information and System Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1880022.1880035","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1880022.1880035","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:16Z","timestamp":1750243936000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1880022.1880035"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,12]]}},"alternative-id":["10.1145\/1880022.1880035"],"URL":"https:\/\/doi.org\/10.1145\/1880022.1880035","relation":{},"ISSN":["1094-9224","1557-7406"],"issn-type":[{"type":"print","value":"1094-9224"},{"type":"electronic","value":"1557-7406"}],"subject":[],"published":{"date-parts":[[2010,12]]},"assertion":[{"value":"2008-06-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-12-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}