A Robust Verifiably Encrypted Signature Scheme

  • Jianhong Zhang
  • Wei Zou
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4097)


A verifiably encrypted signature can convince the verifier that a given cipher-text is the encryption of a signature on a given message. It is often used as a building block to construct optimistic fair exchange. Recently, Gu gave an ID-based verifiably encrypted signature scheme and claimed that their scheme was secure in random oracle model. Unfortunately, in this works, we show that their scheme is insecure. And we can mount to universal forgery attack in their model. In other words, any one is able to forge a verifiably encrypted signature on arbitrary message m. Subsequently, a novel verifiably encrypted signature scheme (VES) is proposed and the scheme is proven secure in random oracle model. Moreover, the size of verifiably encrypted signature in our scheme is shorter than that of Gu’s signature.


Signature Scheme Random Oracle Blind Signature Random Oracle Model Fair Exchange 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Gu, C.X., Zhu, Y.F.: An ID-Based Verifiable Encrypted Signature Scheme Based on Hess’s Scheme. In: Feng, D., Lin, D., Yung, M. (eds.) CISC 2005. LNCS, vol. 3822, pp. 42–52. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  2. 2.
    Gorantla, M.C., Saxena, A.: Verifiably Encrypted Signature Without Radom Oracles. In: Chakraborty, G. (ed.) ICDCIT 2005. LNCS, vol. 3816, pp. 357–363. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  3. 3.
    Asokan, N., Shoup, V., Waidner, M.: Optimistic Fair Exchange of Digital Signature (extended abstract). In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 591–606. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  4. 4.
    Ateniese, G.: Efficient Verifiable Encryption (and Fair Exchange) of Digital Signatures. In: Proc. of the 6th Conference on CCS, pp. 138–146. ACM Press, New York (1999)CrossRefGoogle Scholar
  5. 5.
    Bao, F., Deng, R.H., Mao, W.: Efficient and Practical fair exchange protocols with off-line TTP. In: IEEE Symposium on Security and Privacy, Oakland, CA (1998)Google Scholar
  6. 6.
    Camenisch, J., Shoup, V.: Practical Verifiable Encryption and Decryption of Discrete Logarithms. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 126–144. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  7. 7.
    Ateniese, G.: Verifiable Encryption of Digital Signature and Applications. ACM Transactions on Information and System Security 7(1), 1–20 (2004)CrossRefGoogle Scholar
  8. 8.
    Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and Verifiably Encrypted Signatures from Bilinear Maps. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 416–432. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  9. 9.
    Zhang, F., Safavi-Naini, R., Susilo, W.: Efficient Verifiably Encrypted Signature and Partially Blind Signature from Bilinear Pairings. In: Johansson, T., Maitra, S. (eds.) INDOCRYPT 2003. LNCS, vol. 2904, pp. 191–204. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  10. 10.
    Pointcheval, D., Stern, J.: Security Arguments for Digital Signatures and Blind Signatures. Journal of Cryptology 13(3), 361–396Google Scholar
  11. 11.
    Hess, F.: Efficient Identity Based Signature Schemes Based on Pairings. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213–229. Springer, Heidelberg (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jianhong Zhang
    • 1
    • 2
  • Wei Zou
    • 1
  1. 1.Institute of Computer Science & TechnologyPeking UniversityBeijingP.R. China
  2. 2.Institute of Image Processing and Pattern RecognitionNorth China University, of TechnologyBeijingP.R. China

Personalised recommendations