Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Unconditionally Secure Blind Authentication Codes: The Model, Constructions, and Links to Commitment

  • Chapter
Formal to Practical Security

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

Abstract

In this paper, as a fundamental cryptographic protocol with information-theoretic security, we propose an unconditionally secure blind authentication code (BA-code for short) which is an unconditionally secure authentication code with anonymity of messages. As we will see, the BA-code is a simple model of an authentication code with the function similar to that of the unconditionally secure blind signature (USBS for short). The relationship between BA-codes and USBS is similar to the one between traditional authentication codes and unconditionally secure signature schemes as well as the one between group authentication codes and group signature schemes. In addition, we provide two kinds of constructions of BA-codes: direct constructions based on polynomials over finite fields, and a generic construction by using unconditionally secure encryption and A2-codes. Furthermore, as application we show a link between BA-codes and commitment in unconditional security setting: starting from BA-codes, unconditionally secure commitment schemes can be constructed in a black-box way.

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. Abe, M.: A secure three-move blind signature scheme for polynomially many signatures. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 136–151. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  2. Bellare, M., Namprempre, C., Pointcheval, D., Semanko, M.: The power of RSA inversion oracles and the security of Chaum’s RSA-based blind signature scheme. In: Syverson, P.F. (ed.) FC 2001. LNCS, vol. 2339, pp. 319–338. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Bellare, M., Namprempre, C., Pointcheval, D., Semanko, M.: The One-More-RSA-Inversion problems and security of Chaum’s blind signature scheme. J. Cryptology 16(3), 185–215 (2003)

    Article  MATH  Google Scholar 

  4. Blum, M.: Coin flipping by telephone: a protocol for solving impossible problems. In: 24th IEEE Spring Computer Conference, pp. 133–137. IEEE Press, Los Alamitos (1982)

    Google Scholar 

  5. Blundo, C., Masucci, B., Stinson, D.R., Wei, R.: Constructions and bounds for unconditionally secure non-interactive commitment schemes. Designs, Codes, and Cryptography 26, 97–110 (2002)

    Article  MATH  Google Scholar 

  6. Camenisch, J., Koprowski, M., Warinschi, B.: Efficient blind signatures without random oracles. In: Blundo, C., Cimato, S. (eds.) SCN 2004. LNCS, vol. 3352, pp. 134–148. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  7. Chaum, D.: Blind signatures for untraceable payments. In: Advances in Cryptology 1981 - 1997, pp. 199–204. Prenum Publishing Corporation (1982)

    Google Scholar 

  8. Chaum, D., Fiat, A., Naor, M.: Untraceable electronic cash. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 319–327. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

  9. Chaum, D., van Heyst, E.: Group Signatures. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 257–265. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  10. Hanaoka, G., Shikata, J., Hanaoka, Y., Imai, H.: Unconditionally secure anonymous encryption and group authentication. The Computer Journal 49, 310–321 (2006); The earlier version appeared in: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 81–99. Springer, Heidelberg (2002)

    Google Scholar 

  11. Hara, Y., Seito, T., Shikata, J., Matsumoto, T.: Unconditionally secure blind signatures. In: Proc. of International Conference on Information Theoretic Security (ICITS 2007), Madrid, Spain, May 2007, pp. 25–44 (2007)

    Google Scholar 

  12. Juels, A., Luby, M., Ostrovsky, R.: Security of blind digital signatures. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 150–164. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  13. Johansson, T.: Further results on asymmetric authentication schemes. Information and Computation 151, 100–133 (1999)

    Article  MATH  Google Scholar 

  14. Kurosawa, K.: New bound on authentication code with arbitration. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 140–149. Springer, Heidelberg (1994)

    Google Scholar 

  15. Kurosawa, K., Obana, S.: Combinatorial bounds for authentication codes with arbitration. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 289–300. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  16. Namprempre, C., Neven, G., Abdalla, M.: A study of blind message authentication codes. IEICE Trans. Fundamentals 1973 E90-A(1), 75–82 (2007); The earlier version appeared in: Pointcheval, D. (ed.) CT-RSA 2006. LNCS, vol. 3860, pp. 262–279. Springer, Heidelberg (2006)

    Google Scholar 

  17. Obana, S., Kurosawa, K.: A2-code = affine resolvable + BIBD. In: Han, Y., Quing, S. (eds.) ICICS 1997. LNCS, vol. 1334, pp. 118–129. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  18. Okamoto, T.: Efficient blind and partially blind signatures without random oracles. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 80–99. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  19. Pinkas, B.: Fair secure two-party computation. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 87–105. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  20. Pinto, A., Souto, A., Matos, A., Antunes, L.: Commitment and authentication systems. In: Proc. of International Conference on Information Theoretic Security (ICITS 2007), Madrid, Spain (May 2007)

    Google Scholar 

  21. Pointcheval, D.: Strengthened security for blind signatures. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 391–405. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  22. Pointcheval, D., Stern, J.: Provably secure blind signature schemes. In: Kim, K.-c., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol. 1163, pp. 252–265. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  23. Pointcheval, D., Stern, J.: New blind signatures equivalent to factorization. In: ACM CCS, pp. 92–99. ACM Press, New York (1997)

    Google Scholar 

  24. Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. J. Cryptology 13(3), 361–396 (2000)

    Article  MATH  Google Scholar 

  25. Rivest, R.: Unconditionally secure commitment and oblivious transfer schemes using private channels and a trusted initializer (1999) (manuscript), http://people.csail.mit.edu/rivest/Rivest-commitment.pdf

  26. Shannon, C.E.: Communication theory of secret systems. Bell Syst. Tech.J. 28, 656–715 (1949)

    Article  MATH  Google Scholar 

  27. Shikata, J., Hanaoka, G., Zheng, Y., Imai, H.: Security notions for unconditionally secure signature schemes. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 434–449. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  28. Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484–1509 (1997)

    Article  MATH  Google Scholar 

  29. Simmons, G.J.: Message authentication with arbitration of transmitter/receiver disputes. In: Price, W.L., Chaum, D. (eds.) EUROCRYPT 1987. LNCS, vol. 304, pp. 151–165. Springer, Heidelberg (1988)

    Chapter  Google Scholar 

  30. Simmons, G.J.: A Cartesian construction for unconditionally secure authentication codes that permit arbitration. J. Cryptology 2, 77–104 (1990)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Environment and Information Sciences, Yokohama National University, Japan

    Yuki Hara, Taiki Ishiwata, Junji Shikata & Tsutomu Matsumoto

Authors
  1. Yuki Hara
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Taiki Ishiwata
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Junji Shikata
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Tsutomu Matsumoto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LORIA, Équipe Cassis, Bât. A, Campus Scientifique, BP 239, 54506, Vandoeuvre-lès-Nancy Cedex, France

    Véronique Cortier

  2. Centre de Recherche, INRIA Bordeaux – Sud-Ouest, Bât. A29, 351 Cours de la Libération, 33405, Talence, France

    Claude Kirchner

  3. Department of Philosophy, Keio University, 2-15-45 Mita, Minato-ku, 108-8345, Tokyo, Japan

    Mitsuhiro Okada

  4. 3-1 Morinosato Wakamiya Atsugi-shi, 243-0198, Kanagawa, Japan

    Hideki Sakurada

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Hara, Y., Ishiwata, T., Shikata, J., Matsumoto, T. (2009). Unconditionally Secure Blind Authentication Codes: The Model, Constructions, and Links to Commitment. In: Cortier, V., Kirchner, C., Okada, M., Sakurada, H. (eds) Formal to Practical Security. Lecture Notes in Computer Science, vol 5458. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02002-5_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02002-5_7

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation