Skip to main content
SpringerLink
Log in

Chameleon Hashes Without Key Exposure Based on Factoring

  • Short Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Chameleon hash is the main primitive to construct a chameleon signature scheme which provides non-repudiation and non-transferability simultaneously. However, the initial chameleon hash schemes suffer from the key exposure problem: non-transferability is based on an unsound assumption that the designated receiver is willing to abuse his private key regardless of its exposure. Recently, several key-exposure-free chameleon hashes have been constructed based on RSA assumption and SDH (strong Diffie-Hellman) assumption. In this paper, we propose a factoring-based chameleon hash scheme which is proven to enjoy all advantages of the previous schemes. In order to support it, we propose a variant Rabin signature scheme which is proven secure against a new type of attack in the random oracle model.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Krawczyk H, Rabin T. Chameleon signatures. In Proc. Symposium on Network and Distributed System Security Symposium (NDSS 2000), San Diego, CA, February, 2000, pp. 143–154.

  2. Ateniese G, de Medeiros B. Identity-based chameleon hash and applications. In Proc. Financial Cryptography (FC’04), Key West, Florida, USA, February 9–12, 2004, Springer-Verlag, LNCS 3110, pp. 164–180.

  3. Chen X, Zhang F, Kim K. Chameleon hashing without key exposure. In Proc. the 7th Information Security Conference (ISC’04), Palo Alto, USA, September 27–29, 2004, Springer-Verlag, LNCS 3225, pp. 87–98.

  4. Ateniese G, de Medeiros B. On the key exposure problem in chameleon hashes. In Proc. the 4th Conference on Security in Communication Networks (SCN’04), Amalfi, Italy, September 8–10, 2004, Springer-Verlag, LNCS 3352, pp. 165–179.

  5. MacKenzie P, Yang K. On simulation-sound trapdoor commitments. In Proc. EUROCRYPT’04, Interlaken, Switzerland, May 2–6, 2004, Springer-Verlag, LNCS 3027, pp. 382–400.

  6. Gennaro R. Multi-trapdoor commitments and their applications to proofs of knowledge secure under concurrent man-in-the-middle attacks. In CRYPTO’04, Santa Barbara, California, USA, August 15–19, 2004, Springer-Verlag, LNCS 3152, pp. 220–236.

  7. Hu L, Dong J, Pei D. Implementation of cryptosystems based on Tate pairing. J. Comput. Sci. & Technol., 2005, 20(2): 264–269.

    Article  MathSciNet  Google Scholar 

  8. Rabin M. Digital signatures. Foundations of Secure Computation. Dobkin D, Jones A, Lipton R (eds.), New York: Academic Press, 1978, pp. 155–168.

  9. Bellare M, Rogaway P. Random oracles are practical: A paradigm for designing efficient protocols. In Proc. the 1st ACM Conf. Computer and Communications Security, Fairfax, VA, November 3–5, 1993, pp. 62–73.

  10. Goldwasser S, Micali S, Rivest R. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal of Computing, 1998, 17(2): pp. 281–308.

    Article  MathSciNet  Google Scholar 

  11. Bellare M, Namprempre C, Neven G. Security proofs for identity-based identification and signature schemes. In Proc. Eurocrypt’2004, Interlaken, Switzerland, May 2–6, 2004, Springer-Verlag, LNCS 3027, pp. 268–286.

  12. Bellare M, Rogaway P. The exact security of digital signatures: How to sign with RSA and Rabin. In Proc. Eurocrypt 96, Zaragoza, Spain, May 12–16, 1996, Springer-Verlag, LNCS 1070, pp. 399–416.

  13. Fischlin M, Fischlin R. The representation problem based on factoring. In Proc. the Cryptographer’s Track at the RSA Conference on Topics in Cryptology 2002 (Topics in Cryptology—CT-RSA 2002), San Jose, CA, USA, February 18–22, 2002, Springer-Verlag, LNCS 2271, pp. 96–113.

Download references

Author information

Authors and Affiliations

  1. School of Mathematics and Econometrics, Hunan University, Changsha, 410082, China

    Wei Gao

  2. School of Mathematics Science, South China Normal University, Guangzhou, 510631, China

    Xue-Li Wang

  3. School of Computer and Communication, Hunan University, Changsha, 410082, China

    Dong-Qing Xie

Authors
  1. Wei Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xue-Li Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dong-Qing Xie
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wei Gao.

Additional information

This work is partially supported by the National Natural Science Foundation of China under Grants No. 10271042 and No. 60373085.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gao, W., Wang, XL. & Xie, DQ. Chameleon Hashes Without Key Exposure Based on Factoring. J Comput Sci Technol 22, 109–113 (2007). https://doi.org/10.1007/s11390-007-9015-9

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-007-9015-9

Keywords

Search

Navigation