Abstract
In 2004, Bellare et al. formalized the notion for identity-based identification (IBI) schemes and proposed many schemes based on their transformation from standard identification schemes. However the authors left the security under active/concurrent attacks of one of the pairing-free schemes, the Beth-IBI scheme, as an open problem. In 2008, Crescenzo provided the solution to this open problem with a small modification to the original Beth-IBI scheme. However, recently Chin et al. pointed out security flaws in Crescenzo’s modified Beth-IBI scheme, resulting in total break of the scheme and leaving Bellare et al’s open problem unanswered once more. In this paper, we provide a solution to the open problem, showing that with only some additional overhead to modify the original Beth-IBI scheme we can achieve security against active and concurrent attacks. Furthermore, our security guarantee results are superior to Crescenzo’s attempt in that we rely only on the classical discrete-logarithm assumption for our active and concurrent security proof, which is a weaker assumption than Crescenzo’s one-more counterpart.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bellare, M., Palacio, A.: Gq and schnorr identification schemes: Proofs of security against impersonation under active and concurrent attacks. In: Yung, M. (ed.) CRYPTO, Springer, Lecture Notes in Computer Science, vol. 2442, pp. 162–177 (2002)
Bellare, M., Namprempre, C., Neven, G.: Security proofs for identity-based identification and signature schemes. In: Cachin, C., Camenisch, J. (eds.) EUROCRYPT, Springer, Lecture Notes in Computer Science, vol. 3027, pp. 268–286 (2004)
Beth, T.: Efficient zero-knowledge identification scheme for smart cards. In: Günther, C. G. (ed.) EUROCRYPT, Springer, Lecture Notes in Computer Science, vol. 330, pp. 77–84 (1988)
Boneh, D., Franklin, M.K.: Identity-based encryption from the weil pairing. In: Kilian, J. (ed.) CRYPTO, Springer, Lecture Notes in Computer Science, vol. 2139, pp. 213–229 (2001)
Chin, J.J., Tan, S.Y., Heng, S.H., Phan, R.C.W.: On the security of a modified beth identity-based identification scheme. Inf. Process. Lett. 113(1416), 580–583 (2013). doi:10.1016/j.ipl.2013.04.015 URL http://www.sciencedirect.com/science/article/pii/S0020019013001324
Crescenzo, G.D.: On the security of beth’s identification schemes against active and concurrent adversaries. In: Calmet, J., Geiselmann, W., Müller-Quade, J. (eds.) MMICS, Springer, Lecture Notes in Computer Science, vol. 5393, pp. 1–17 (2008)
Feige, U., Shamir, A.: Witness indistinguishable and witness hiding protocols. In: Ortiz, H. (ed.) STOC, ACM, pp. 416–426 (1990)
Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO, Springer, Lecture Notes in Computer Science, vol. 263, pp. 186–194 (1986)
Fujioka, A., Saito, T., Xagawa, K.: Security enhancements by or-proof in identity-based identification. In: Bao, F., Samarati, P., Zhou, J. (eds.) ACNS, Springer, Lecture Notes in Computer Science, vol. 7341, pp. 135–152 (2012)
Heng, S.H.: Design and analysis of some cryptographic primitives. PhD thesis, Graduate School of Science and Engineering, Tokyo Institute of Technology (2004)
Kurosawa, K., Heng, S.H.: From digital signature to id-based identification/signature. In: Bao, F., Deng, R.H., Zhou, J. (eds.) Cryptography, Public Key, Springer, Lecture Notes in Computer Science, vol. 2947, pp. 248–261 (2004)
Kurosawa, K., Heng, S.H.: Identity-based identification without random oracles. In: Gervasi, O., Gavrilova, M.L., Kumar, V., Laganà, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C., J.K. (eds.) ICCSA (2), Springer, Lecture Notes in Computer Science, vol. 3481, pp 603–613 (2005)
Shamir, A.: Identity-based cryptosystems and signature schemes. In: Blakley, G.R., Chaum, D. (eds.) CRYPTO, Springer, Lecture Notes in Computer Science, vol. 196, pp. 47–53 (1984)
Tan, S.Y., Heng, S.H., Goi, B.M.: Java implementation for pairing-based cryptosystems. In: Taniar, D., Gervasi, O., Murgante, B., Pardede, E., Apduhan, B.O. (eds.) ICCSA (4), Springer, Lecture Notes in Computer Science, vol. 6019, pp. 188–198 (2010)
Tan, S.Y., Heng, S.H., Phan, R.C.W., Goi, B.M.: A variant of schnorr identity-based identification scheme with tight reduction. In: Kim, T.H., Adeli, H., Slezak, D., Sandnes, F.E., Song, X., Chung, K.I., Arnett, K.P. (eds.) FGIT, Springer, Lecture Notes in Computer Science, vol. 7105, pp. 361–370 (2011)
Thorncharoensri, P., Susilo, W., Mu, Y.: Identity-based identification scheme secure against concurrent-reset attacks without random oracles. In: Youm, H.Y., Yung, M. (eds.) WISA, Springer, Lecture Notes in Computer Science, vol. 5932, pp. 94–108 (2009)
Acknowledgments
The authors would like to acknowledge the Ministry of Education, Malaysia, for financially aiding this research through the Fundamental Research Grant Scheme FRGS/2/2013/ICT07/MMU/03/5.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chin, JJ., Tan, SY., Heng, SH. et al. Twin-Beth: Security under active and concurrent attacks for the beth identity-based identification scheme. Cryptogr. Commun. 8, 579–591 (2016). https://doi.org/10.1007/s12095-015-0162-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12095-015-0162-5
Keywords
- Beth-IBI
- Identity-based
- Identification
- Active/concurrent security
- Provable security
- Pairing-free
- Discrete logarithm