Skip to main content

RSA-Based Collusion Resistant Quorum Controlled Proxy Re-encryption Scheme for Distributed Secure Communication

  • Conference paper
  • First Online:
Distributed Computing and Internet Technology (ICDCIT 2019)

Abstract

In this paper, we analyze the quorum controlled proxy re-encryption scheme proposed by Jakobsson for the security. We show that the scheme is susceptible to collusion and cannot be used for secure communication. We design a new quorum controlled proxy re-encryption scheme based on RSA public key cryptosystem. We show that the proposed scheme is collusion resistant and non-transitive. Using the quorum/threshold controlled proxy re-encryption scheme, the trust on the proxy can be reduced and single point of failure problem can be solved. The proposed scheme can be used in any network application where distribution of trust and delegation of tasks are the requirements.

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

Access this chapter

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., Fu, K., Green, M., Hohenberger, S.: Improved proxy re-encryption schemes with applications to secure distributed storage. ACM Trans. Inf. Syst. Secur. (TISSEC 2006) 9(1), 1–30 (2006). https://doi.org/10.1145/1127345.1127346

    Article  MATH  Google Scholar 

  2. Bellare, M., Sandhu, R.S.: The security of practical two-party RSA signature schemes. IACR Cryptology ePrint Archive 2001, 60 (2001). https://eprint.iacr.org/2001/060.pdf

  3. Blaze, M., Bleumer, G., Strauss, M.: Divertible protocols and atomic proxy cryptography. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 127–144. Springer, Heidelberg (1998). https://doi.org/10.1007/BFb0054122

    Chapter  Google Scholar 

  4. Chen, Y.R., Tygar, J.D., Tzeng, W.G.: Secure group key management using uni-directional proxy re-encryption schemes. In: Proceedings of the 2011 IEEE International Conference on Computer Communications INFOCOM 2011, pp. 1952–1960, April 2011. https://doi.org/10.1109/INFCOM.2011.5934999

  5. Desmedt, Y., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 307–315. Springer, New York (1990). https://doi.org/10.1007/0-387-34805-0_28

    Chapter  Google Scholar 

  6. Horowitz, E., Sahni, S., Rajasekaran, S.: Fundamentals of Computer Algorithms, 2nd edn. Silicon Press, Summit (2007)

    MATH  Google Scholar 

  7. Ivan, A., Dodis, Y.: Proxy cryptography revisited. In: Proceedings of the Network and Distributed System Security Symposium (NDSS) (2003). https://www.ndss-symposium.org/ndss2003/proxy-cryptography-revisited/

  8. Jakobsson, M.: On quorum controlled asymmetric proxy re-encryption. In: Imai, H., Zheng, Y. (eds.) PKC 1999. LNCS, vol. 1560, pp. 112–121. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-49162-7_9

    Chapter  Google Scholar 

  9. Lin, H.Y., Tzeng, W.G.: A secure erasure code-based cloud storage system with secure data forwarding. IEEE Trans. Parallel Distrib. Syst. 23(6), 995–1003 (2012). https://doi.org/10.1109/TPDS.2011.252

    Article  Google Scholar 

  10. Liu, Q., Wang, G., Wu, J.: Time-based proxy re-encryption scheme for secure data sharing in a cloud environment. Inf. Sci. 258, 355–370 (2014). https://doi.org/10.1016/j.ins.2012.09.034

    Article  Google Scholar 

  11. Mambo, M., Okamoto, E.: Proxy cryptosystems: delegation of the power to decrypt ciphertexts. Inst. Electron. Inf. Commun. Eng. (IEICE) Trans. Fundam. Electron. Commun. Comput. Sci. 80(1), 54–63 (1997)

    Google Scholar 

  12. Pareek, G., Purushothama, B.R.: On efficient access control mechanisms in hierarchy using unidirectional and transitive proxy re-encryption schemes. In: SECRYPT, pp. 519–524. SciTePress (2017). https://doi.org/10.5220/0006466405190524

  13. Pedersen, T.P.: A Threshold cryptosystem without a trusted party. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 522–526. Springer, Heidelberg (1991). https://doi.org/10.1007/3-540-46416-6_47

    Chapter  Google Scholar 

  14. Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979). https://doi.org/10.1145/359168.359176

    Article  MathSciNet  MATH  Google Scholar 

  15. Tysowski, P.K., Hasan, M.A.: Hybrid attribute- and re-encryption-based key management for secure and scalable mobile applications in clouds. IEEE Trans. Cloud Comput. 1(2), 172–186 (2013). https://doi.org/10.1109/TCC.2013.11

    Article  Google Scholar 

Download references

Acknowledgements

This work is supported by Ministry of Human Resource Development (MHRD), Government of India.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to B. R. Purushothama .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Patil, S.M., Purushothama, B.R. (2019). RSA-Based Collusion Resistant Quorum Controlled Proxy Re-encryption Scheme for Distributed Secure Communication. In: Fahrnberger, G., Gopinathan, S., Parida, L. (eds) Distributed Computing and Internet Technology. ICDCIT 2019. Lecture Notes in Computer Science(), vol 11319. Springer, Cham. https://doi.org/10.1007/978-3-030-05366-6_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-05366-6_29

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-05365-9

  • Online ISBN: 978-3-030-05366-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics