Citations


Contact Us

For Marketing, Sales and Subscriptions Inquiries
2637 E Atlantic Blvd #43110
Pompano Beach, FL 33062
USA

Conference List

International Journal of Natural Sciences Research

April 2016, Volume 4, 4, pp 68-74

Multi-User Searchable Encryption Scheme with User Revocation

Chia-Chi Wu

,

Iuon-Chang Lin

,

Ya-Hui Liu

Chia-Chi Wu 1

Iuon-Chang Lin 2
Ya-Hui Liu 3

  1. Department of Information Management, National Defense University, Taoyuan, R.O.C. 1

  2. Department of Management Information Systems, Nation Chung Hsing University, Taichung,Taiwan R.O.C; Department of Photonics and Communication Engineering, Asia University, Taichung, Taiwan, R.O.C. 2

  3. Department of Management Information Systems, Nation Chung Hsing University, Taichung,Taiwan R.O.C 3

Pages: 68-74

DOI: 10.18488/journal.63/2016.4.4/63.4.68.74

Share :

Article History:

Received: 27 September, 2016
Revised: 27 October, 2016
Accepted: 02 November, 2016
Published: 08 November, 2016


Abstract:

We improve the previous method to add the function of user revocation in searchable encryption scheme. When document owner doesn’t want to share someone he had shared, he can revoke the user who can’t retrieve the specific document. More importantly, the revocation process must not affect other authorized users, the scheme has to keep a low maintenance cost.
Contribution/ Originality
This study contributes in the existing literature are to provide a searchable keyword encryption scheme and the document owner can dynamically authorize a user to retrieve documents or revoke the authorization. The maintenance cost of the revocation process is low.

Keywords:

Access control, Cloud computing, Information security, Multi-user, Searchable encryption, Privacy.

Video:

Reference:

  1. I. C. Lin and Y. H. Liu, "Searchable encryption for text document with ranked results," presented at the International Conference on Advanced Information Technologies, 2016.
  2. C. Bosch, P. Hartel, W. Jonker, and A. Peter, "A survey of provably secure searchable encryption," ACM Computing Surveys (CSUR), vol. 47, pp. 18:1-18:51, 2015.
  3. I. C. Lin, S. S. Tang, and C. M. Wang, "Multicast key management without rekeying processes," Computer Journal, vol. 53, pp. 939-950, 2010.
  4. D. Song, D. Wagner, and A. Perrig, "Practical techniques for searches on encrypted data," presented at the IEEE Symposium on Security and Privacy, 2000.
  5. E.-J. Goh, "Secure indexes," Technical Report 2003/216, IACR ePrint Cryptography Archive, 2003.
  6. Y. C. Chang and M. Mitzenmacher, "Privacy preserving keyword searches on remote encrypted data," Applied Cryptography and Network Security, vol. 3531, pp. 442–455, 2005.
  7. [D. Boneh, G. di Crescenzo, R. Ostrovsky, and G. Persiano, "Public key encryption with keyword search," presented at the Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2004.
  8. R. L. Rivest, A. Shamir, and L. Adleman, "A method for obtaining digital signatures and public-key cryptosystems," Communications of the ACM, vol. 21, pp. 120-126, 1978.

Statistics:

Google Scholor ideas Microsoft Academic Search bing Google Scholor

Funding:

This study received no specific financial support.

Competing Interests:

The authors declare that they have no competing interests.

Acknowledgement:

All authors contributed equally to the conception and design of the study.

Related Article