Skip to main content
SpringerLink
Log in

A systematic method to design strong designated verifier signature without random oracles

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

Strong designated verifier signature (SDVS) provides secret authentication service to entities in a computing task. The primitive assures that an entity’s signature is verified only by a designated service provider. It also assures that a transcript about a computing task can be produced by both the entity and its service provider independently. Then neither can prove to a third party that an entity is involved in a task. Currently, most SDVS schemes without random oracles have no strong unforgeability and privacy of signer’s identity. This paper proposes a systematic method to design SDVS schemes without random oracles. It provides a basic scheme with unforgeability and non-transferability properties. Then provides it an SDVS scheme with strong unforgeability and privacy of signer’s identity properties and based on standard assumptions. Finally, a more efficient SDVS scheme is shown based on a non-black box assumption.

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. Asaar, M., Salmasizadeh, M.: A pairing based strong designated verifier signature scheme without random oracles. Cryptology ePrint Archive: Report 2012/061 (2012)

  2. Boneh, D., Shen, E., Waters, B.: Strongly unforgeable signatures based on computational Diffie-Hellman. In: PKC’05. LNCS, vol. 3958, pp. 229–240. Springer, Berlin (2005)

    Google Scholar 

  3. Cao, F., Cao, Z.: An identity based universal designated verifier signature scheme secure in the standard model. J. Syst. Softw. 82, 643–649 (2009)

    Article  Google Scholar 

  4. Cramer, R., Damgård, I.: Proofs of partial knowledge and simplified design of witness hiding protocols. In: Desmedt, Y. (ed.) CRYPTO’94, Santa Barbara, California. LNCS, vol. 839, pp. 174–187. Springer, Berlin (1994)

    Google Scholar 

  5. Cramer, R., Shoup, V.: A practical public-key encryptosystem provable secure against adaptive chosen ciphertext attack. In: Krawczyk, H. (ed.) CRYPTO’98, Santa Barbara, California. LNCS, vol. 1462, pp. 13–25. Springer, Berlin (1998)

    Google Scholar 

  6. Huang, Q., Yang, G., Wong, D., Susilo, W.: Efficient strong designated verifier signature schemes without random oracles or delegatability. Cryptology ePrint Archive: Report 2009/518 (2009)

  7. Jakobsson, M., Sako, K., Impagliazzo, R.: Designated verifier proofs and their applications. In: Maurer, U.M. (ed.) EUROCRYPT ’96, Saragossa, Spain, May 1996. LNCS, vol. 1070, pp. 143–154. Springer, Berlin (1996)

    Chapter  Google Scholar 

  8. Kang, L., Tang, X., Lu, X., Fan, J.: A short signature scheme in the standard model. Cryptology ePrint Archive: Report 2007/398 (2007)

  9. Laguillaumie, F., Libert, B., Quisquater, J.: Universal designated verifier signatures without random oracles or non-black box assumptions. In: Security and Cryptography for Networks. LNCS, vol. 4116, pp. 63–77. Springer, Berlin (2006)

    Chapter  Google Scholar 

  10. Laguillaumie, F., Vergnaud, D.: Designated verifiers signature: anonymity and efficient construction from any bilinear map. In: Blundo, C., Cimato, S. (eds.) SCN 2004, Amalfi, Italy, September 2005. LNCS, vol. 3352, pp. 105–119. Springer, Berlin (2005)

    Google Scholar 

  11. Mao, W.: Modern Cryptography: Theory and Practice, Chap. 10. Prentice Hall, New York (2003)

    Google Scholar 

  12. Möller, B.: Algorithms for multi-exponentiation. In: Vaudenay, S., Youssef, A. (eds.) SAC 2001, Toronto, Canada. LNCS, vol. 2259, pp. 165–180. Springer, Berlin (2001)

    Google Scholar 

  13. Steinfeld, R., Wang, H., Pieprzyk, J.: Efficient extension of standard Schnorr/RSA signatures into universal designated-verifier signatures. In: PKC’04. LNCS, vol. 2947, pp. 86–100. Springer, Berlin (2004)

    Google Scholar 

  14. Saeednia, S., Kramer, S., Markovitch, O.: An efficient strong designated verifier signature scheme. In: Lim, J., Lee, D. (eds.) ICISC 2003, Seoul, Korea, November 2004. LNCS, vol. 2971, pp. 40–54. Springer, Berlin (2004)

    Google Scholar 

  15. Tian, H., Sun, X., Wang, M.: A new public key encryption scheme. J. Comput. Sci. Technol. 22(1), 95–102 (2007)

    Article  MathSciNet  Google Scholar 

  16. Tian, H., Jiang, Z., Liu, Y., Wei, B.: A non-delegatable strong designated verifier signature without random oracles. In: INCOS 2012, pp. 237–244 (2012)

    Google Scholar 

  17. Vergnaud, D.: New extensions of pairing-based signatures into universal designated verifier signatures. In: Automata, Languages and Programming. LNCS, vol. 4052, pp. 58–69 (2006)

    Chapter  Google Scholar 

  18. Yoneyama, K., Ushida, M., Ohta, K.: Rigorous security requirements for designated verifier signatures. In: Lai, X., Yung, M., Lin, D. (eds.) Inscrypt 2010. LNCS, vol. 6584, pp. 318–335. Springer, Berlin (2011)

    Google Scholar 

  19. Zhang, R., Furukawa, J., Imai, H.: Short signature and universal designated verifier signature without random oracles. In: ACNS’05. LNCS, vol. 3531, pp. 483–498. Springer, Berlin (2005)

    Google Scholar 

  20. Zhang, H., Ji, C.: An efficient designated verifier signature scheme without random oracles. In: Proc. of First International Symposium on Data, Privacy and E-Commerce, pp. 338–340. IEEE Press, New York (2007)

    Chapter  Google Scholar 

Download references

Acknowledgements

This work is supported by the National Natural Science Foundation of China (Grant Nos. 61003244, 61070168, 61103199), Doctoral Fund of Ministry of Education of China (Grant No. 20120171110027), Fundamental Research Funds for the Central Universities (Grant Nos. 11lgpy71, 11lgzd06), Beijing Municipal Natural Science Foundation (Grant No. 4112052), Science and Technology Planning Project of Guangdong Province (Grant No. 2012B010100032), and the Industry-Education-Research Cooperation Project of Guangdong Province and the Ministry of Education (Grant No. 2012B091000060).

Author information

Authors and Affiliations

  1. School of Information Science and Technology, Sun Yat-Sen University, Guangzhou, Guangdong, 510275, P.R. China

    Haibo Tian & Baodian Wei

  2. Guangdong Key Laboratory of Information Security Technology, Guangzhou, P.R. China

    Haibo Tian & Baodian Wei

  3. School of Computer, Communication University of China, Beijing, 100024, China

    Zhengtao Jiang

  4. Faculty of Computer, Guangdong University of Technology, Guangzhou, Guangdong, 510006, P.R. China

    Yi Liu

Authors
  1. Haibo Tian
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhengtao Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yi Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Baodian Wei
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Haibo Tian.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tian, H., Jiang, Z., Liu, Y. et al. A systematic method to design strong designated verifier signature without random oracles. Cluster Comput 16, 817–827 (2013). https://doi.org/10.1007/s10586-013-0255-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-013-0255-x

Keywords

Search

Navigation