Skip to main content
Log in

Delegateable signatures based on non-interactive witness indistinguishable and non-interactive witness hiding proofs

  • Published:
Science in China Series F: Information Sciences Aims and scope Submit manuscript

Abstract

A delegateable signature scheme (DSS) which was first introduced by Barak is mainly based on the non-interactive zero-knowledge proof (NIZK) for preventing the signing verifier from telling which witness (i.e., restricted subset) is being used. However, the scheme is not significantly efficient due to the difficulty of constructing NIZK. We first show that a non-interactive witness indistinguishable (NIWI) proof system and a non-interactive witness hiding (NIWH) proof system are easier and more efficient proof models than NIZK in some cases. Furthermore, the witnesses employed in these two protocols (NIWI and NIWT) cannot also be distinguished by the verifiers. Combined with the Σ-protocol, we then construct NIWI and NIWH proofs for any NP statement under the existence of one-way functions and show that each proof is different from those under the existence of trapdoor permutations. Finally, based on our NIWI and NIWH proofs, we construct delegateable signature schemes under the existence of one-way functions, which are more efficient than Barak’s scheme under the existence of trapdoor permutations.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Barak B. Delegateable Signatures, 2001. http://www.math.ias.edu/boaz/Papers/delgsigs.ps

  2. Mambo M, Usuda K, Okamoto E. Proxy Signatures. In: Proceedings of the 1995 Symposium on Cryptography and Information Security (SCIS 95). 1995, B1.1.1–17

  3. Feige U, Shamir A. Witness Indistinguishable and Witness Hiding Protocols. In: 22nd ACM Symposium on the Theory of Computing. 1990. 416–426

  4. Goldreich O. Foundations of Cryptography (Basic Tools). Cambridge: Cambridge University Press, 2001

    MATH  Google Scholar 

  5. Damgard I. On Σ-protocols. Available at http://www.daimi.au.dk/ivan/sigma.ps

  6. Goldwasser S, Micali S, Rivest R. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J Comput, 1988, 17(2): 281–308

    Article  MATH  MathSciNet  Google Scholar 

  7. Goldreich O, Sahai A, Vadhan S. Honest Verifier Statistical Zero-Knowledge Equals General Statistical Zero-Knowledge. In: Proc. 30th STOC. 1998, 399–408

  8. Vadhan S. An unconditional study of computational zero-knowledge. In: FOCS 04. 2004, 176–185

  9. Menezes A J, van Oorschot P C, Vanstone S A. Handbook of Applied Cryptography. Boca Raton, Florida: CRC Press, 1996

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tang ChunMing.

Additional information

Supported partially by the National Natural Science Foundation of China (Grant Nos. 90604034, 10371127 and 10671114)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tang, C., Pei, D., Wang, X. et al. Delegateable signatures based on non-interactive witness indistinguishable and non-interactive witness hiding proofs. Sci. China Ser. F-Inf. Sci. 51, 128–144 (2008). https://doi.org/10.1007/s11432-008-0003-7

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-008-0003-7

Keywords

Navigation