Abstract
Anonymity with identity escrow attempts to allow users of a service to remain anonymous, while providing the possibility that the service owner can break the anonymity if the service is misused. We introduce a new protocol in which the user’s identity is distributed among several token providers. Anonymity is assured provided at least one of the token providers is honest (and the misuse has not occurred). We analyse the protocol in the applied π-calculus.
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
Preview
Unable to display preview. Download preview PDF.
References
Harris interactive. In: IBM multi-national consumer privacy survey (October 1999)
Business Week/Harris poll: A growing threat. In: Business Week (March 2000)
Backes, M., Meadows, C., Mitchell, J.C.: Relating cryptography and formal methods: a panel. In: FMSE, pp. 61–66 (2003)
Camenisch, J., Lysyanskaya, A.: An identity escrow scheme with appointed verifiers. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 388–407. Springer, Heidelberg (2001)
Camenisch, J., Lysyanskaya, A.: Signature schemes and anonymous credentials from bilinear maps. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 56–72. Springer, Heidelberg (2004)
Camenisch, J., Shoup, V.: Practical verifiable encryption and decryption of discrete logarithms. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 126–144. Springer, Heidelberg (2003)
Cranor, L.F., Reagle, J., Ackerman, M.: Beyond concern: Understanding net users’ attitudes about online privacy. Technical report, AT&T Labs-Research (1999)
Kiayias, A., Yung, M.: Group signatures: Provable security, efficient constructions and anonymity from trapdoor-holders. Cryptology ePrint Archive, Report 2004/076 (2004), http://eprint.iacr.org/
Kilian, J., Petrank, E.: Identity escrow. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 169–187. Springer, Heidelberg (1998)
Leighton, F.T.: Failsafe key escrow systems. Technical Memo 483, MIT Laboratory for Computer Science (1994)
Lysyanskaya, A., Rivest, R.L., Sahai, A., Wolf, S.: Pseudonym systems. In: Heys, H.M., Adams, C.M. (eds.) SAC 1999. LNCS, vol. 1758, pp. 184–199. Springer, Heidelberg (2000)
Marshall, L.F., Molina-Jiminez, C.: Anonymity with identity escrow. In: Dimitrakos, T., Martinelli, F. (eds.), Proceedings of the 1st International Workshop on Formal Aspects in Security and Trust, pp. 121–129, Istituto di Informatica e Telematica, Pisa (2003)
Micali, S.: Fair public-key cryptosystems. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, Springer, Heidelberg (1993)
Mukhamedov, A., Ryan, M.D.: On anonymity with identity escrow. In: Dimitrakos, T., Martinelli, F., Ryan, P.Y.A., Schneider, S. (eds.) FAST 2005. LNCS, vol. 3866, Springer, Heidelberg (2006)
Aybek Mukhamedov and Mark D. Ryan. Anonymity protocol with identity escrow and analysis in the applied π-calculus (extended version) (2007), http://www.cs.bham.ac.uk/~axm,mdr
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mukhamedov, A., Ryan, M.D. (2008). Anonymity Protocol with Identity Escrow and Analysis in the Applied π-Calculus. In: Barthe, G., Fournet, C. (eds) Trustworthy Global Computing. TGC 2007. Lecture Notes in Computer Science, vol 4912. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78663-4_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-78663-4_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78662-7
Online ISBN: 978-3-540-78663-4
eBook Packages: Computer ScienceComputer Science (R0)