Science in China Series F: Information Sciences

, Volume 51, Issue 2, pp 128–144 | Cite as

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

  • Tang ChunMing 
  • Pei DingYi 
  • Wang XiaoFeng 
  • Liu ZhuoJun 
Article

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.

Keywords

delegateable signature non-interactive zero-knowledge non-interactive witness indistinguishable non-interactive witness hiding Σ-protocol 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Barak B. Delegateable Signatures, 2001. http://www.math.ias.edu/boaz/Papers/delgsigs.ps
  2. 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–17Google Scholar
  3. 3.
    Feige U, Shamir A. Witness Indistinguishable and Witness Hiding Protocols. In: 22nd ACM Symposium on the Theory of Computing. 1990. 416–426Google Scholar
  4. 4.
    Goldreich O. Foundations of Cryptography (Basic Tools). Cambridge: Cambridge University Press, 2001MATHGoogle Scholar
  5. 5.
    Damgard I. On Σ-protocols. Available at http://www.daimi.au.dk/ivan/sigma.ps
  6. 6.
    Goldwasser S, Micali S, Rivest R. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J Comput, 1988, 17(2): 281–308MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Goldreich O, Sahai A, Vadhan S. Honest Verifier Statistical Zero-Knowledge Equals General Statistical Zero-Knowledge. In: Proc. 30th STOC. 1998, 399–408Google Scholar
  8. 8.
    Vadhan S. An unconditional study of computational zero-knowledge. In: FOCS 04. 2004, 176–185Google Scholar
  9. 9.
    Menezes A J, van Oorschot P C, Vanstone S A. Handbook of Applied Cryptography. Boca Raton, Florida: CRC Press, 1996Google Scholar

Copyright information

© Science in China Press 2008

Authors and Affiliations

  • Tang ChunMing 
    • 1
  • Pei DingYi 
    • 1
    • 2
  • Wang XiaoFeng 
    • 3
  • Liu ZhuoJun 
    • 4
  1. 1.Province Key LaboratoryInstitute of Information Security of Guangzhou UniversityGuangzhouChina
  2. 2.State Key Laboratory of Information SecurityChinese Academy of SciencesBeijingChina
  3. 3.School of Mathematics and Computational Mathematics of Shenzhen UniversityShenzhenChina
  4. 4.Academy of Mathematics and Systems ScienceChinese Academy of SciencesBeijingChina

Personalised recommendations