Anonymous Searchable Encryption Scheme for Multi-User Databases

被引:2
作者
Varadharajan, Vijayaraghavan [1 ]
Mani, Raghubansh [1 ]
Nallusamy, Rajarathnam [1 ]
机构
[1] Infosys Ltd, Infosys Labs, Convergence Lab, Bangalore 560100, Karnataka, India
来源
PROCEEDINGS OF THE 2013 IEEE INTERNATIONAL CONFERENCE ON CLOUD ENGINEERING (IC2E 2013) | 2013年
关键词
Searchable Encryption; Discrete Log Problem; Multi-user; Proxy Encryption; PRIVATE INFORMATION-RETRIEVAL;
D O I
10.1109/IC2E.2013.30
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
With the ever advancing technology of fast information processing, protecting data with only access control mechanisms is becoming increasingly difficult. If someone breaks into a database, the entire data will be compromised if it is in plaintext form. One quick remedy is to keep the data in encrypted form. However, encryption will make it difficult to do any operations on the data. This has prompted considerable research in the last decade and has led to various schemes of searchable encryption. It allows search over the encrypted data. There are various techniques which support different levels of querying, making it suitable for variety of applications. However, almost all of them are either symmetric-key or single-user schemes or require key sharing. Here, we are proposing a new scheme which will allow multiple users to encrypt, store and decrypt their own data, along with support for doing data searches over all the data by other users.
引用
收藏
页码:225 / 232
页数:8
相关论文
共 23 条
  • [1] Abdalla M., 2005, SEARCHABLE ENCRYPTIO
  • [2] [Anonymous], SEARCHABLE SYMMETRIC
  • [3] [Anonymous], 2003, CRYPTOLOGY EPRINT AR
  • [4] [Anonymous], 1978, COMMUN ACM
  • [5] [Anonymous], P 2000 IEEE S SEC PR
  • [6] [Anonymous], 2004, NDSS
  • [7] Bellovin S. M., 2004, Privacy-enhanced searches using encrypted bloom filters, V2004, P1
  • [8] Blaze Matt, 1998, EUROCRYPT
  • [9] Bo Z., 2011, J NETW COMPUT APPL
  • [10] Boneh D., 2004, EUROCRYPT