Skip to main content
SpringerLink
Log in

Attack against a Pairing Based Anonymous Authentication Protocol

  • Conference paper
SOFSEM 2014: Theory and Practice of Computer Science (SOFSEM 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8327))

  • 1438 Accesses

Abstract

Anonymous authentication protocols aim to provide means to anonymously prove membership in a group. Moreover, the membership should not be transferable i.e. a subgroup of members should not be able to help an outsider to gain access on behalf of a group. In this note we present two attacks on a recently published protocol of this kind (ICUIMC ’11 Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication, article no. 32) and thereby we show that it failed the security targets for an anonymous authentication protocol.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. De Santis, A., Di Crescenzo, G., Persiano, G., Yung, M.: On monotone formula closure of SZK. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, SFCS 1994, pp. 454–465. IEEE Computer Society, Washington, DC (1994)

    Chapter  Google Scholar 

  2. Chaum, D., van Heyst, E.: Group signatures. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 257–265. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  3. Ateniese, G., Camenisch, J., Hohenberger, S., de Medeiros, B.: Practical group signatures without random oracles. Cryptology ePrint Archive, Report 2005/385 (2005), http://eprint.iacr.org/

  4. Bellare, M., Micciancio, D., Warinschi, B.: Foundations of group signatures: formal definitions, simplified requirements, and a construction based on general assumptions. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 614–629. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  5. Boneh, D., Boyen, X., Shacham, H.: Short group signatures. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 41–55. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Boyen, X., Waters, B.: Compact group signatures without random oracles. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 427–444. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  7. Groth, J.: Fully anonymous group signatures without random oracles. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 164–180. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  8. Handley, B.: Resource-efficient anonymous group identification. In: Frankel, Y. (ed.) FC 2000. LNCS, vol. 1962, pp. 295–312. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  9. Jaulmes, É., Poupard, G.: On the security of homage group authentication protocol. In: Syverson, P. (ed.) FC 2001. LNCS, vol. 2339, pp. 106–116. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  10. De Santis, A., Di Crescenzo, G., Persiano, G.: Communication-efficient anonymous group identification. In: Proceedings of the 5th ACM Conference on Computer and Communications Security, CCS 1998, pp. 73–82. ACM, New York (1998)

    Google Scholar 

  11. Boneh, D., Franklin, M.: Anonymous authentication with subset queries (extended abstract). In: Proceedings of the 6th ACM Conference on Computer and Communications Security, CCS 1999, pp. 113–119. ACM, New York (1999)

    Google Scholar 

  12. Schechter, S., Parnell, T., Hartemink, A.: Anonymous authentication of membership in dynamic groups. In: Franklin, M. (ed.) FC 1999. LNCS, vol. 1648, pp. 184–195. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  13. Dodis, Y., Kiayias, A., Nicolosi, A., Shoup, V.: Anonymous identification in ad hoc groups. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 609–626. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  14. Jalal, S., King, B.: A pairing based cryptographic anonymous authentication scheme. In: Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication, ICUIMC 2011, pp. 32:1–32:8. ACM, New York (2011)

    Google Scholar 

  15. Boneh, D., Boyen, X.: Short signatures without random oracles and the sdh assumption in bilinear groups. J. Cryptology 21, 149–177 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  16. Ballard, L., Green, M., de Medeiros, B., Monrose, F.: Correlation-resistant storage via keyword-searchable encryption. IACR Cryptology ePrint Archive 2005, 417 (2005)

    Google Scholar 

  17. Scott, M., Barreto, P.S.L.M.: Generating more mnt elliptic curves. Des. Codes Cryptography 38(2), 209–217 (2006)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Fundamental Problems of Technology, Wrocław University of Technology, Poland

    Lucjan Hanzlik & Kamil Kluczniak

Authors
  1. Lucjan Hanzlik
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kamil Kluczniak
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dep. Computer Sci., P. J. Šafárik University, Jesenná 5, 04154, Košice, Slovakia

    Viliam Geffert

  2. Katholieke Universiteit Leuven, 3001, Leuven-Heverlee, Belgium

    Bart Preneel

  3. Department of Computer Science, Comenius University, Mlynska Dolina, 84248, Bratislava, Slovakia

    Branislav Rovan

  4. Institute of Computer Science, Academy of Sciences, 18207, Prague, Czech Republic

    Július Štuller

  5. Institute of Software Technology, Vienna University of Technology, Favoritenstraße 9-11 / 188, 1040, Vienna, Austria

    A Min Tjoa

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Hanzlik, L., Kluczniak, K. (2014). Attack against a Pairing Based Anonymous Authentication Protocol. In: Geffert, V., Preneel, B., Rovan, B., Štuller, J., Tjoa, A.M. (eds) SOFSEM 2014: Theory and Practice of Computer Science. SOFSEM 2014. Lecture Notes in Computer Science, vol 8327. Springer, Cham. https://doi.org/10.1007/978-3-319-04298-5_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-04298-5_27

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-04297-8

  • Online ISBN: 978-3-319-04298-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation