Skip to main content
SpringerLink
Log in

A Publicly Verifiable Encryption Scheme with Short Public/Private Keys

  • Conference paper
Wireless Algorithms, Systems, and Applications (WASA 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6221))

  • 1102 Accesses

Abstract

A publicly verifiable public key encryption scheme has the property that the validity of ciphertexts can be verified without knowledge of private key, which facilitate its non-interactive threshold decryption. Based on a selective identity secure IBE by Boneh et. al, a new publicly verifiable encryption scheme is presented using two hash functions. We prove the IND-CCA2 security of the new scheme under decisional BDHI assumption and target collision resistant property of two hash functions. Furthermore, our scheme has very short public and private keys that are independent of the security parameter, witch significantly simplifies public key certificate management and reduces the computation cost for encryption or decryption.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Boneh, D., Boyen, X.: Efficient Selective-ID Secure Identity-Based Encryption without Random Oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 223–238. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. 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 

  3. Boneh, D., Katz, J.: Improved Efficiency for CCA-Secure Cryptosystems Built Using Identity-Based Encryption. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 87–103. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  4. Boyen, X., Mei, Q., Waters, B.: Direct chosen ciphertext security from identity-based techniques. In: ACM Conference on Computer and Communications Security 2005, pp. 320–329 (2005)

    Google Scholar 

  5. Canetti, R., Halevi, S., Katz, J.: Chosen-Ciphertext Security from Identity-Based Encryption. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 207–222. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Cramer, R., Shoup, V.: A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 13–25. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  7. Waters, B.: Efficient Identity Based Encryption without Random Oracle Model. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 114–127. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Rackoff, C., Simon, D.R.: Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 433–444. Springer, Heidelberg (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Engineering, The Academy of Armored Forces Engineering, Beijing, 100072, China

    Yujun Liu

  2. State Key Laboratory of Information Security, Graduate School of the Chinese Academy of Sciences, Beijing, 100049, China

    Yonggang Cui

  3. Department of Optical and Electronic Engineering, PLA Ordnance Engineering College, Shijiazhuang, 050003, China

    Limin Liu

Authors
  1. Yujun Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yonggang Cui
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Limin Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Nanyang Technological University, Singapore

    Gopal Pandurangan

  2. Virginia Tech, Blacksburg, VA, USA

    V. S. Anil Kumar

  3. School of Software, Tsinghua University, 100084, Beijing, China

    Gu Ming

  4. Dept. of Computer Science, Hong Kong Univ. of Science and Technology, Kowloon, Hong Kong

    Yunhao Liu

  5. Department of Computer Science, Georgia State University, 34 Peachtree Street, Suite 1413, 30303, Atlanta, GA, USA

    Yingshu Li

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, Y., Cui, Y., Liu, L. (2010). A Publicly Verifiable Encryption Scheme with Short Public/Private Keys. In: Pandurangan, G., Anil Kumar, V.S., Ming, G., Liu, Y., Li, Y. (eds) Wireless Algorithms, Systems, and Applications. WASA 2010. Lecture Notes in Computer Science, vol 6221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14654-1_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14654-1_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14653-4

  • Online ISBN: 978-3-642-14654-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation