Skip to main content

Optionally Identifiable Private Handshakes

  • Conference paper
Information Security and Cryptology (Inscrypt 2009)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 6151))

Included in the following conference series:

  • 864 Accesses

Abstract

It is now a trend that Internet users are increasingly concerned about individual privacy, and as a result numerous privacy- preserving authentication techniques have been proposed. In this paper, we propose the concept of private handshakes with optional identifiability, which allows the two users in a handshake deciding real time to either proceed their interaction as secret handshake or as private handshake. Such optionally identifiable private handshakes are a more flexible privacy-preserving authentication primitive than secret handshakes and private handshakes. We formulate a formal definition for optionally identifiable private handshakes, as well as a set of security definitions, and propose a concrete scheme. We implement a proof-of-concept prototype of the proposed scheme, on top of the widely used TLS protocol.

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

Access this chapter

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. Ateniese, G., Blanton, M., Kirsch, J.: Secret Handshakes with Dynamic and Fuzzy Matching. In: Proc. Network and Distributed System Security Symposium, NDSS 2007 (2007)

    Google Scholar 

  2. Ateniese, G., Medeiros, B.: Efficient Group Signatures without Trapdoors. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 246–268. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Balfanz, D., Durfee, G., Shankar, N., Smetters, D., Staddon, J., Wong, H.: Secret Handshakes from Pairing-Based Key Agreements. In: Proc. IEEE Security & Privacy, pp. 180–196 (2003)

    Google Scholar 

  4. Boneh, D., Franklin, M.: Identity-based Encryption from the Weil Paring. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213–229. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  5. Baldwin, R., Gramlich, W.: Cryptographic Protocol for Trustable Matching Making. In: Proc. IEEE Security & Privacy, pp. 92–100 (1985)

    Google Scholar 

  6. Barreto, M., Kim, H., Lynn, B., Scott, M.: Efficient Algorithms for Pairing-based Cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, p. 354. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  7. Bellar, M., Rogaway, P.: Random Oracles Are Practical: A Paradigm for Designing Efficient Protocols. In: Proc. ACM Computers and Communications Security, CCS 2003, pp. 62–73 (2003)

    Google Scholar 

  8. Castelluccia, C., Jarecki, S., Tsudik, G.: Seccret Handshakes from Oblivious Encryption. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol. 3329, pp. 293–307. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  9. Camenisch, J., Lysyanskaya, A.: An Efficient Sysem for Non-Transferable Anonymous Credentials with Optional Anonymity Revocation. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 93–118. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  10. Coron, J.S.: On the Exact Security of Full Domain Hash. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 229–235. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  11. Jarechi, S., Kim, J., Tsudik, G.: Authenticated Group Key Agreement Protocols with the Privacy Property of Affilation-hidding. In: Proc. CT-RSA Conference (2007)

    Google Scholar 

  12. Jarecki, S., Liu, X.: Unlinkable Secret Handshakes and Key-Private Group Key Management Schemes. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol. 4521, pp. 270–287. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  13. Hoepman, J.H.: Private Handshakes. In: Proc. 4th Eur. Symp. on Security and Privacy in Ad hoc and Sensor Networks, pp. 31–42 (2007)

    Google Scholar 

  14. Scott, M.: Multiprecision Integer and Rational Arithmetic C/C++ Library (MIRACL), http://indigo.ie/~mscott/

  15. The Transport Layer Security (TLS) Protocol Version 1.2. IETF Network Working Group, http://tools.ietf.org/html/rfc5246

  16. Tsudik, G., Xu, S.: Flexible Framework for Secret Handshakes. Cryptology ePrint Archive, Report 2005/034

    Google Scholar 

  17. Vergnaud, D.: RSA-based Secret Handshakes. In: Proc. International Workshop on Coding and Cryptogaphy (2005)

    Google Scholar 

  18. Xu, S., Yung, M.: K-Anonymous Secret Handshakes with Reusable Credentials. In: Proc. ACM Computers and Communications Security, CCS 2004, pp. 158–167 (2004)

    Google Scholar 

  19. Yang, Y.J., Weng, J., Zhou, J.Y., Qiu, Y.: Optionally Identifiable Private Handshakes. In: Proc. ICICS 2009 (2009), http://icsd.i2r.a-star.edu.sg/sta/yanjiang/papers/icics09.pdf

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yang, Y., Weng, J., Zhou, J., Qiu, Y. (2010). Optionally Identifiable Private Handshakes. In: Bao, F., Yung, M., Lin, D., Jing, J. (eds) Information Security and Cryptology. Inscrypt 2009. Lecture Notes in Computer Science, vol 6151. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16342-5_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16342-5_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16341-8

  • Online ISBN: 978-3-642-16342-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics