Skip to main content
SpringerLink
Log in

Secret Handshakes with Revocation Support

  • Conference paper
Information, Security and Cryptology – ICISC 2009 (ICISC 2009)

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

Included in the following conference series:

Abstract

Revocation of credentials in Secret Handshakes is a difficult challenge, as it mixes the conflicting requirements of tracing revoked users and of the untraceability and unlinkability of legitimate protocol players. The schemes proposed in the literature are either limited versions of secret handshake supporting revocation, or they support more complete versions of secret handshake with no possibility of introducing revocation. In this paper we present a simple protocol that allows a user to prove to a verifier possession of a credential. Credentials can be revoked simply by publishing a value in a revocation list. This protocol is extremely flexible, as with it, we can achieve revocation for each of the different nuances of Secret Handshakes known in the literature. We prove the security of the new scheme without random oracles.

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. Ateniese, G., Blanton, M., Kirsch, J.: Secret handshakes with dynamic and fuzzy matching. In: Network and Distributed System Security Symposuim, February, pp. 159–177. The Internet Society (2007); CERIAS TR 2007-24

    Google Scholar 

  2. Ateniese, G., Camenisch, J., Hohenberger, S., de Medeiros, B.: Practical group signatures without random oracles (2005)

    Google Scholar 

  3. Bagherzandi, A., Cheon, J.-H., Jarecki, S.: Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma. In: CCS 2008: Proceedings of the 15th ACM conference on Computer and communications security, pp. 449–458. ACM, New York (2008)

    Chapter  Google Scholar 

  4. Baldwin, R.W., Gramlich, W.C.: Cryptographic protocol for trustable match making. In: IEEE Symposium on Security and Privacy (1985)

    Google Scholar 

  5. Balfanz, D., Durfee, G., Shankar, N., Smetters, D.K., Staddon, J., Wong, H.-C.: Secret handshakes from pairing-based key agreements. In: IEEE Symposium on Security and Privacy, pp. 180–196 (2003)

    Google Scholar 

  6. Benaloh, J., Automation, G.: One-way accumulators: A decentralized alternative to digital signatures, pp. 274–285. Springer, Heidelberg (1993)

    Google Scholar 

  7. Boneh, D., Boyen, X.: Efficient selective-id secure identity-based encryption without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 223–238. Springer, Heidelberg (2004)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  9. Camenisch, J., Lysyanskaya, A.: Dynamic accumulators and application to efficient revocation of anonymous credentials. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 61–76. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  10. Castelluccia, C., Jarecki, S., Tsudik, G.: Secret handshakes from ca-oblivious encryption. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol. 3329, pp. 293–307. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  11. Changshe Ma, J.W., Zheng, D.: Fast digital signature schemes as secure as diffie-hellman assumptions. Cryptology ePrint Archive, Report 2007/019 (2007)

    Google Scholar 

  12. Hoepman, J.-H.: Private handshakes. In: Stajano, F., Meadows, C., Capkun, S., Moore, T. (eds.) ESAS 2007. LNCS, vol. 4572, pp. 31–42. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  13. Jain, G.: Zero knowledge proofs: A survey (2008)

    Google Scholar 

  14. Jarecki, S., Kim, J., Tsudik, G.: Beyond secret handshakes: Affiliation-hiding authenticated key exchange. In: Malkin, T.G. (ed.) CT-RSA 2008. LNCS, vol. 4964, pp. 352–369. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  15. 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 

  16. Li, N., Du, W., Boneh, D.: Oblivious signature-based envelope. Distrib. Comput. 17(4), 293–302 (2005)

    Article  Google Scholar 

  17. 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)

    Chapter  Google Scholar 

  18. Meadows, C.: A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party. sp, 134 (1986)

    Google Scholar 

  19. Nasserian, S., Tsudik, G.: Revisiting oblivious signaturebased envelopes: New constructs and properties. In: Di Crescenzo, G., Rubin, A. (eds.) FC 2006. LNCS, vol. 4107, pp. 221–235. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  20. Pfitzmann, B.: Collision-free accumulators and fail-stop signature schemes without trees, pp. 480–494. Springer, Heidelberg (1997)

    Google Scholar 

  21. Shin, J.S., Gligor, V.D.: A new privacy-enhanced matchmaking protocol. In: Network and Distributed System Security Symposuim, February 2007. The Internet Society (2007)

    Google Scholar 

  22. Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 256–266. Springer, Heidelberg (1997)

    Google Scholar 

  23. Sorniotti, A., Molva, R.: A provably secure secret handshake with dynamic controlled matching. In: Proceedings of The 24th International Information IFIP SEC 2009, Paphos, Cyprus, May 18-20 (2009)

    Google Scholar 

  24. Tso, R., Gu, C., Okamoto, T., Okamoto, E.: Efficient id-based digital signatures with message recovery. In: Bao, F., Ling, S., Okamoto, T., Wang, H., Xing, C. (eds.) CANS 2007. LNCS, vol. 4856, pp. 47–59. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  25. Vergnaud, D.: Rsa-based secret handshakes. In: Ytrehus, Ø. (ed.) WCC 2005. LNCS, vol. 3969, pp. 252–274. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  26. Waters, B.: Efficient identity-based encryption without random oracles. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 114–127. Springer, Heidelberg (2005)

    Google Scholar 

  27. Xu, S., Yung, M.: k-anonymous secret handshakes with reusable credentials. In: CCS 2004: Proceedings of the 11th ACM conference on Computer and communications security (2004)

    Google Scholar 

  28. Zhang, K., Needham, R.: A private matchmaking protocol (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. SAP Research, 805, Docteur Maurice Donat, 06250, Mougins, France

    Alessandro Sorniotti

  2. Institut Eurécom, 2229, Route des Crêtes, 06560, Valbonne, France

    Alessandro Sorniotti & Refik Molva

Authors
  1. Alessandro Sorniotti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Refik Molva
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CIST (Center for Information Security Technologies), Korea University Anam Dong, Sungbuk Gu, Seoul, Korea

    Donghoon Lee

  2. Center for Information Security Technologies(CIST), Korea University, Seoul, Korea

    Seokhie Hong

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sorniotti, A., Molva, R. (2010). Secret Handshakes with Revocation Support. In: Lee, D., Hong, S. (eds) Information, Security and Cryptology – ICISC 2009. ICISC 2009. Lecture Notes in Computer Science, vol 5984. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14423-3_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14423-3_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14422-6

  • Online ISBN: 978-3-642-14423-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation