Skip to main content
SpringerLink
Log in

A Privacy Preserving Source Verifiable Encryption Scheme

  • Conference paper
  • First Online:
Book cover Information Security Practice and Experience (ISPEC 2016)

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

  • 1150 Accesses

Abstract

It is critical to guarantee message confidentiality and user privacy in communication networks, especially for group communications. We find previous works seldom consider these aspects at the same time and some trivial solutions cannot remain secure under strong security models. In order to address the aforementioned problem properly, we propose a privacy-preserving source-verifiable encryption scheme. With our scheme, the sender can prove his legitimation to anyone in a set of users chosen by himself without leaking his identity, and only the intended receiver can retrieve the original message and the identity of the sender from a given ciphertext. Considering the security of our scheme, we define three security models which capture the message confidentiality, the user privacy and the user impersonation resistance respectively. We prove that our scheme maintains all the three aforementioned properties under the random oracle model.

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 EPUB and 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

References

  1. Ateniese, G.: Verifiable encryption of digital signatures and applications. ACM TISSEC 7(1), 1–20 (2004)

    Article  MATH  Google Scholar 

  2. Ateniese, G., Camenisch, J., Joye, M., Tsudik, G.: A practical and provably secure coalition-resistant group signature scheme. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 255–270. Springer, Heidelberg (2000). doi:10.1007/3-540-44598-6_16

    Chapter  Google Scholar 

  3. Bao, F.: An efficient verifiable encryption scheme for encryption of discrete logarithms. In: Quisquater, J.-J., Schneier, B. (eds.) CARDIS 1998. LNCS, vol. 1820, pp. 213–220. Springer, Heidelberg (2000). doi:10.1007/10721064_19

    Chapter  Google Scholar 

  4. Bellare, M., Desai, A., Pointcheval, D., Rogaway, P.: Relations among notions of security for public-key encryption schemes. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 26–45. Springer, Heidelberg (1998). doi:10.1007/BFb0055718

    Chapter  Google Scholar 

  5. Blazy, O., Fuchsbauer, G., Pointcheval, D., Vergnaud, D.: Signatures on randomizable ciphertexts. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol. 6571, pp. 403–422. Springer, Heidelberg (2011). doi:10.1007/978-3-642-19379-8_25

    Chapter  Google Scholar 

  6. Boneh, D.: The decision Diffie-Hellman problem. In: Third International Symposium Algorithmic Number Theory, pp. 48–63 (1998)

    Google Scholar 

  7. Camenisch, J., Damgård, I.: Verifiable encryption, group encryption, and their applications to separable group signatures and signature sharing schemes. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 331–345. Springer, Heidelberg (2000). doi:10.1007/3-540-44448-3_25

    Chapter  Google Scholar 

  8. 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). doi:10.1007/978-3-540-45146-4_8

    Chapter  Google Scholar 

  9. Chim, T.W., Yiu, S., Hui, L.C., Li, V.O.: VSPN: VANET-based secure and privacy-preserving navigation. IEEE Trans. Comput. 63(2), 510–524 (2014)

    Article  MathSciNet  Google Scholar 

  10. Dodis, Y., Kiayias, A., Nicolosi, A., Shoup, V.: Anonymous identification in ad hoc groups. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 609–626. Springer, Heidelberg (2004). doi:10.1007/978-3-540-24676-3_36

    Chapter  Google Scholar 

  11. Fuchsbauer, G.: Commuting signatures and verifiable encryption and an application to non-interactively delegatable credentials. IACR Cryptology ePrint Archive 2010, 233 (2010)

    Google Scholar 

  12. González-Deleito, N., Markowitch, O.: An optimistic multi-party fair exchange protocol with reduced trust requirements. In: Kim, K. (ed.) ICISC 2001. LNCS, vol. 2288, pp. 258–267. Springer, Heidelberg (2002). doi:10.1007/3-540-45861-1_20

    Chapter  Google Scholar 

  13. Groth, J., Kohlweiss, M.: One-out-of-many proofs: or how to leak a secret and spend a coin. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 253–280. Springer, Heidelberg (2015). doi:10.1007/978-3-662-46803-6_9

    Google Scholar 

  14. Hajny, J., Malina, L.: Practical revocable anonymous credentials. In: Decker, B., Chadwick, D.W. (eds.) CMS 2012. LNCS, vol. 7394, pp. 211–213. Springer, Heidelberg (2012). doi:10.1007/978-3-642-32805-3_22

    Chapter  Google Scholar 

  15. Halkes, G.P., Pouwelse, J.A.: Verifiable encryption for p2p block exchange. In: IEEE Tenth International Conference on Peer-to-Peer Computing (P2P), pp. 1–4. IEEE (2010)

    Google Scholar 

  16. Kim, S., Park, S., Won, D.: Group signatures for hierarchical multigroups. In: Okamoto, E., Davida, G., Mambo, M. (eds.) ISW 1997. LNCS, vol. 1396, pp. 273–281. Springer, Heidelberg (1998). doi:10.1007/BFb0030428

    Chapter  Google Scholar 

  17. Mao, W.: Publicly verifiable partial key escrow. In: Han, Y., Okamoto, T., Qing, S. (eds.) ICICS 1997. LNCS, vol. 1334, pp. 409–413. Springer, Heidelberg (1997). doi:10.1007/BFb0028496

    Chapter  Google Scholar 

  18. Park, J., Chong, E.K.P., Siegel, H.J.: Constructing fair-exchange protocols for e-commerce via distributed computation of RSA signatures. In: Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, pp. 172–181 (2003)

    Google Scholar 

  19. Ren, J., Li, Y., Li, T.: Providing source privacy in mobile ad hoc networks. In: IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, MASS 2009, pp. 332–341. IEEE (2009)

    Google Scholar 

  20. Rivest, R.L., Shamir, A., Tauman, Y.: How to leak a secret. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 552–565. Springer, Heidelberg (2001). doi:10.1007/3-540-45682-1_32

    Chapter  Google Scholar 

  21. Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41(2), 303–332 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  22. Stadler, M.: Publicly verifiable secret sharing. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 190–199. Springer, Heidelberg (1996). doi:10.1007/3-540-68339-9_17

    Chapter  Google Scholar 

  23. Tate, S.R., Vishwanathan, R.: Improving cut-and-choose in verifiable encryption and fair exchange protocols using trusted computing technology. In: Gudes, E., Vaidya, J. (eds.) DBSec 2009. LNCS, vol. 5645, pp. 252–267. Springer, Heidelberg (2009). doi:10.1007/978-3-642-03007-9_17

    Chapter  Google Scholar 

  24. Zhan, J.: Privacy-preserving collaborative data mining. IEEE Comput. Intell. Mag. 3(2), 31–41 (2008)

    Article  Google Scholar 

  25. Zhang, Y., Chen, Q., Zhong, S.: Privacy-preserving data aggregation in mobile phone sensing. IEEE Trans. Inf. Forensics Secur. 11(5), 980–992 (2016)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing and Information Technology, Centre for Computer and Information Security Research, University of Wollongong, Wollongong, 2522, Australia

    Zhongyuan Yao, Yi Mu & Guomin Yang

Authors
  1. Zhongyuan Yao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yi Mu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Guomin Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhongyuan Yao .

Editor information

Editors and Affiliations

  1. Huawei International, Singapore, Singapore

    Feng Bao

  2. University of Surrey, Guilford, Surrey, United Kingdom

    Liqun Chen

  3. Singapore Management University, Singapore, Singapore

    Robert H. Deng

  4. Guangzhou University, Guangzhou, Guangdong, China

    Guojun Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Yao, Z., Mu, Y., Yang, G. (2016). A Privacy Preserving Source Verifiable Encryption Scheme. In: Bao, F., Chen, L., Deng, R., Wang, G. (eds) Information Security Practice and Experience. ISPEC 2016. Lecture Notes in Computer Science(), vol 10060. Springer, Cham. https://doi.org/10.1007/978-3-319-49151-6_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-49151-6_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-49150-9

  • Online ISBN: 978-3-319-49151-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation