Advertisement

Secret Handshake: Strong Anonymity Definition and Construction

  • Yutaka Kawai
  • Kazuki Yoneyama
  • Kazuo Ohta
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5451)

Abstract

Secret handshake allows two members in the same group to authenticate each other secretly. In previous works of secret handshake schemes, two types of anonymities against the group authority (GA) of a group G are discussed: 1)Even GA cannot identify members, namely nobody can identify them (No-Traceability), 2)Only GA can identify members (Traceability). In this paper, first the necessity of tracing of the identification is shown. Second, we classify abilities of GA into the ability of identifying players and that of issuing the certificate to members. We introduce two anonymities Co-Traceability and Strong Detector Resistance. When a more strict anonymity is required ever for GA, the case 2) is unfavorable for members. Then, we introduce Co-Traceability where even if \({\cal A}\) has GA’s ability of identifying members or issuing the certificate, \({\cal A}\) cannot trace members identification. However, if a scheme satisfies Co-Traceability, GA may be able to judge whether handshake players belong to the own group. Then, we introduce Strong Detector Resistance where even if an adversary \({\cal A}\) has GA’s ability of identifying members, \({\cal A}\) cannot make judgments whether a handshaking player belongs to G. Additionally, we propose a secret handshake scheme which satisfies previous security requirements and our proposed anonymity requirements by using group signature scheme with message recovery.

Keywords

Secret handshake anonymity traceability privacy 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ateniese, G., Blanton, M., Kirsch, J.: Secret handshakes with dynamic and fuzzy matching. In: Network and Distributed System Security Symposium (2007)Google Scholar
  2. 2.
    Ateniese, G., Camenisch, J.L., Joye, M., Tsudik, G.: A practical and provably secure coalition-resistant group signature scheme. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 255–270. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  3. 3.
    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, 2003, pp. 180–196. IEEE Computer Society, Los Alamitos (2003)Google Scholar
  4. 4.
    Bellare, M., Shi, H., Zhang, C.: Foundations of group signatures: The case of dynamic groups. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 136–153. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  5. 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)CrossRefGoogle Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    Chaum, D., van Heyst, E.: Group signatures. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 257–265. Springer, Heidelberg (1991)CrossRefGoogle Scholar
  8. 8.
    Furukawa, J., Imai, H.: An efficient group signature scheme from bilinear maps. In: Boyd, C., González Nieto, J.M. (eds.) ACISP 2005. LNCS, vol. 3574, pp. 455–467. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  9. 9.
    Kawai, Y., Yoneyama, K., Ohta, K.: Secret handshake: Strong anonymity definition and construction. In: IACR ePrint Archive, 2009 (2009)Google Scholar
  10. 10.
    Sakai, R., Ohgishi, K., Kasahara, M.: Cryptosystems based on pairing. In: The Symposium on Cryptography and Information Security, SCIS 2000 (2000)Google Scholar
  11. 11.
    Xu, S., Yung, M.: k-anonymous secret handshakes with reusable credentials. In: Proceedings of the 11th ACM conference on Computer and communications security, pp. 158–167. ACM, New York (2004)Google Scholar
  12. 12.
    Yamashita, T., Tada, M.: How to construct secret handshake schemes. In: Computer Security Symposium 2007, CSS 2007, pp. 321–326 (2006) (in japanese)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Yutaka Kawai
    • 1
  • Kazuki Yoneyama
    • 1
  • Kazuo Ohta
    • 1
  1. 1.The University of Electro-CommunicationsTokyoJapan

Personalised recommendations