Skip to main content
SpringerLink
Log in
Book cover

International Conference on Coding and Cryptology

IWCC 2011: Coding and Cryptology pp 1–10Cite as

A Signature Scheme with Efficient Proof of Validity

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 6639))

Abstract

A signature scheme is presented that, when combined with the Groth-Sahai proof system, can efficiently prove the validity of a committed signature to a message shown in the clear. Compared to the Boneh-Boyen signature scheme, the proposed scheme yields a shorter proof of validity and is based on a more desirable hardness assumption that achieves a better security bound when analyzed in the generic group model.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abe, M., Fuchsbauer, G., Groth, J., Haralambiev, K., Ohkubo, M.: Structure-preserving signatures and commitments to group elements. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 209–236. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  2. Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: First ACM Conference on Computer and Communication Security. Association for Computing Machinery, pp. 62–73 (1993)

    Google Scholar 

  3. Bellare, M., Rogaway, P.: The exact security of digital signatures - how to sign with RSA and rabin. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 399–416. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  4. Boneh, D., Boyen, X.: Short signatures without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 56–73. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  5. Boneh, D., Boyen, X.: Short signatures without random oracles and the sdh assumption in bilinear groups. Journal of Cryptology 21(2), 149–177 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514–532. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Chevallier-Mames, B.: An efficient CDH-based signature scheme with a tight security reduction. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 511–526. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Cramer, R., Shoup, V.: Signature schemes based on the strong RSA assumptions. In: ACM CCS 1999, pp. 46–51 (1999)

    Google Scholar 

  9. Galbraith, S., Paterson, K., Smart, N.: Pairings for cryptographers. Technical Report 2006/165, IACR ePrint archive (2006)

    Google Scholar 

  10. Gennaro, R., Halevi, S., Rabin, T.: Secure hash-and-sign signatures without the random oracle. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 123–139. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  11. Goh, E.-J., Jarecki, S.: A signature scheme as secure as the diffie-hellman problem. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 401–415. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  12. Groth, J.: Fully anonymous group signatures without random oracles. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 164–180. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  13. Groth, J., Sahai, A.: Efficient non-interactive proof systems for bilinear groups. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 415–432. Springer, Heidelberg (2008); Full version available: IACR ePrint Archive 2007/155

    Chapter  Google Scholar 

  14. Katz, J., Wang, N.: Efficiency improvements for signature schemes with tight security reductions. In: ACM Conference on Computer and Communications Security, pp. 155–164. ACM, New York (2003)

    Google Scholar 

  15. Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. Journal of Cryptology 13(3), 339–360 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  16. A. Rupp, G. Leander, E. Bangerter, A.-R. Sadeghi, and A. W. Dent. Sufficient conditions for intractability over black-box groups: Generic lower bounds for generalizaed dl and dh problems. IACR ePrint Archive 2007/360, 2007.

    Chapter  Google Scholar 

  17. Schnorr, C.P.: Efficient signature generation for smart cards. Journal of Cryptology 4(3), 239–252 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  18. Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM 27(4) (1980)

    Google Scholar 

  19. Waters, B.: Efficient identity-based encryption without random oracles. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 114–127. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  20. Waters, B.: Dual system encryption: Realizing fully secure IBE and HIBE under simple assumptions. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 619–636. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Information Sharing Platform Laboratories, NTT Corporation, Japan

    Masayuki Abe

  2. NICT, Japan

    Miyako Ohkubo

Authors
  1. Masayuki Abe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Miyako Ohkubo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Physical and Mathematical Sciences, Division of Mathematical Sciences, Nanyang Technological University, 637371, Singapore

    Yeow Meng Chee , San Ling , Huaxiong Wang  & Chaoping Xing , ,  & 

  2. College of Information Engineering, Qingdao University, 266071, Shandong, P.R. China

    Zhenbo Guo

  3. Qingdao University, 266071, Shandong, P.R. China

    Fengjing Shao

  4. School of Mathematical Sciences, Yangzhou University, 225002, Jiangsu, P.R. China

    Yuansheng Tang

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abe, M., Ohkubo, M. (2011). A Signature Scheme with Efficient Proof of Validity. In: Chee, Y.M., et al. Coding and Cryptology. IWCC 2011. Lecture Notes in Computer Science, vol 6639. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20901-7_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20901-7_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20900-0

  • Online ISBN: 978-3-642-20901-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation