Abstract
Secret Handshake protocol allows members of the same group to authenticate each other secretly, that is, two members who belong to the same group can learn counterpart is in the same group, while non-member of the group cannot determine whether the counterpart is a member of the group or not. Yamashita and Tanaka proposed Secret Handshake Scheme with Multiple Groups (SHSMG). They extended a single group setting to a multiple groups setting where two members output “accept” iff both member’s affiliations of the multiple groups are identical. In this paper, we first show the flaw of their SHSMG, and we construct a new secure SHSMG. Second, we introduce a new concept of Secret Handshake scheme, “monotone condition Secret Handshake with Multiple Groups (mc-SHSMG)”, in order to extend the condition of “accept”. In our new setting of handshake protocol, members can authenticate each other in monotone condition (not only both member’s affiliations are identical but also the affiliations are not identical). The communication costs and computational costs of our proposed mc-SHSMG are fewer than the trivial construction of mc-SHSMG.
This research was done while the third and fifth author were fully in the University of Electro-Communications.
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
Ateniese, G., Blanton, M., Kirsch, J.: Secret Handshake with Dynamic and Fuzzy Matching. In: Network and Distributed System Security Symposium (2007)
Balfanz, D., Durfee, G., Shankar, N., Smetters, D., Staddon, J., Wong, H.-C.: Secret Handshakes from Pairing-Based Key Agreements. In: IEEE Symposium on Security and Privacy, pp. 180–196 (2003)
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)
Jarecki, S., Kim, J., Tsudik, G.: Authentication for paranoids: Multi-party secret handshakes. In: Zhou, J., Yung, M., Bao, F. (eds.) ACNS 2006. LNCS, vol. 3989, pp. 325–339. Springer, Heidelberg (2006)
Tsudik, G., Xu, S.: A Flexible Framework for Secret Handshakes (Multi-party Anonymous and Un-observable Authentication). Cryptology ePrint Archive (2005)
Tsudik, G., Xu, S.: Brief announcement: A flexible framework for secret handshakes. In: ACM Symposium on Principles of Distributed Computing (2005)
Yamashita, N., Tanaka, K.: Secret handshake with multiple groups. In: Lee, J.K., Yi, O., Yung, M. (eds.) WISA 2006. LNCS, vol. 4298, pp. 339–348. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kawai, Y., Tanno, S., Kondo, T., Yoneyama, K., Kunihiro, N., Ohta, K. (2009). Extension of Secret Handshake Protocols with Multiple Groups in Monotone Condition. In: Chung, KI., Sohn, K., Yung, M. (eds) Information Security Applications. WISA 2008. Lecture Notes in Computer Science, vol 5379. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00306-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-00306-6_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00305-9
Online ISBN: 978-3-642-00306-6
eBook Packages: Computer ScienceComputer Science (R0)