Skip to main content
SpringerLink
Log in
SpringerLink
Log in

BGN Authentication and Its Extension to Convey Message Commitments

  • Conference paper
Computational Science and Its Applications - ICCSA 2006 (ICCSA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3982))

Included in the following conference series:

Abstract

We instantiate the cryptosystem proposed by Boneh, Goh, and Nissim in TCC’05 [5] into an entity authentication scheme, in which an entity is authenticated by an interactive zero-knowledge proof on its private key. Completeness and soundness of our scheme is supported by the indistinguishability of BGN ciphertexts of sums and products, which essentially relies on the semantic security of the BGN cryptosystem. We further extend our scheme so that the authentication conveys Pedersen commitments on a message, while the BGN authentication serves the ‘proving you know how to open’ functionality for the commitment. Our message commitment scheme is both statistically hiding and computationally binding provided the subgroup decision problem is hard.

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 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Adida, B., Wikstrom, D.: Obfuscated ciphertext mixing. Cryptology ePrint Archive, Report 2005/394 (November 2005), http://eprint.iacr.org/

  2. Vanstone, S.A., Menezes, A., van Oorschot, P.C.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)

    Google Scholar 

  3. Beaver, D.: Adaptive zero knowledge and computational equivocation (extended abstract). In: STOC, pp. 629–638 (1996)

    Google Scholar 

  4. Blum, M.: Coin flipping by telephone. In: IEEE Spring COMPCOM, pp. 133–137 (1982)

    Google Scholar 

  5. Boneh, D., Goh, E.-J., Nissim, K.: Evaluating 2-dnf formulas on ciphertexts. In: Theory of Cryptography Conference, TCC, Feburary 2005, pp. 325–341 (2005)

    Google Scholar 

  6. C.C.I.T.T.: Recommendation X.509. The Directory-Authentication (1988)

    Google Scholar 

  7. Canetti, R., Fischlin, M.: Universally composable commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 19–40. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  8. Canetti, R., Goldreich, O., Goldwasser, S., Micali, S.: Resettable zero-knowledge (extended abstract). In: STOC, pp. 235–244 (2000)

    Google Scholar 

  9. Chase, M., Healy, A., Lysyanskaya, A., Malkin, T., Reyzin, L.: Mercurial commitments with applications to zero-knowledge sets. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 422–439. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  10. Courtois, N.: Efficient zero-knowledge authentication based on a linear algebra problem minRank. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 402–421. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Damgård, I., Nielsen, J.B.: Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor. Technical report, BRICS Report Series RS-01-41 (October 2001)

    Google Scholar 

  12. Damgård, I., Fujisaki, E.: A statistically-hiding integer commitment scheme based on groups with hidden order. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 125–142. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  13. Dolev, D., Dwork, C., Naor, M.: Nonmalleable cryptography. SIAM J. Comput. 30(2), 391–437 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  14. Feige, U., Fiat, A., Shamir, A.: Zero-knowledge proofs of identity. J. Cryptology 1(2), 77–94 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  15. Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186–194. Springer, Heidelberg (1987)

    Google Scholar 

  16. Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186–208 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  17. The Open Group. Unix., http://www.unix.org/

  18. Haller, N.M.: The s/key one-time password system. In: Symposium on Network and Distributed System Security, pp. 151–157 (1994)

    Google Scholar 

  19. International Organization for Standardization. ISO/IEC 9798-2 (July 1999)

    Google Scholar 

  20. Lamport, L.: Password authentification with insecure communication. Commun. ACM 24(11), 770–772 (1981)

    Article  MathSciNet  Google Scholar 

  21. Liskov, M., Lysyanskaya, A., Micali, S., Reyzin, L., Smith, A.: Mutually independent commitments. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 385–401. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  22. Naor, M.: Bit commitment using pseudorandomness. J. Cryptology 4(2), 151–158 (1991)

    Article  MATH  Google Scholar 

  23. Naor, M.: Deniable ring authentication. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 481–498. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  24. Needham, R.M., Schroeder, M.D.: Using encryption for authentication in large networks of computers. Commun. ACM 21(12), 993–999 (1978)

    Article  MATH  Google Scholar 

  25. Needham, R.M., Schroeder, M.D.: Authentication revisited. Operating Systems Review 21(1), 7 (1987)

    Article  Google Scholar 

  26. Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129–140. Springer, Heidelberg (1992)

    Google Scholar 

  27. Schnorr, C.-P.: Efficient identification and signatures for smart cards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 239–252. Springer, Heidelberg (1990)

    Google Scholar 

  28. Steiner, J.G., Neuman, B.C., Schiller, J.I.: Kerberos: An authentication service for open network systems. In: USENIX Winter, pp. 191–202 (1988)

    Google Scholar 

  29. Groth, J., et al.: Perfect non-interactive zero knowledge for np. Cryptology ePrint Archive, Report 2005/290 (August 2005), http://eprint.iacr.org/

  30. Wei, V.K.: Signature from a new subgroup assumption. Cryptology ePrint Archive, Report 2005/429 (November 2005), http://eprint.iacr.org/

Download references

Author information

Authors and Affiliations

  1. Department of Information Engineering, Chinese University of Hong Kong, Shatin, N.T., Hong Kong

    Yuen-Yan Chan & Jin Li

  2. School of Mathematics and Computational Science, Sun Yat-Sen University, Guangzhou, 510275, P.R. China

    Jin Li

Authors
  1. Yuen-Yan Chan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jin Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina Gavrilova

  2. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. OptimaNumerics Ltd., Cathedral House, 23-31 Waring Street, BT1 2DX, Belfast, UK

    C. J. Kenneth Tan

  5. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  6. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  7. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  8. School of Information and Communication Engineering, Sungkyunkwan University, Korea

    Hyunseung Choo

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chan, YY., Li, J. (2006). BGN Authentication and Its Extension to Convey Message Commitments. In: Gavrilova, M., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751595_40

Download citation

  • DOI: https://doi.org/10.1007/11751595_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34075-1

  • Online ISBN: 978-3-540-34076-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation