Frequency-Hiding Order-Preserving Encryption

被引:104
作者
Kerschbaum, Florian [1 ]
机构
[1] SAP, Karlsruhe, Germany
来源
CCS'15: PROCEEDINGS OF THE 22ND ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY | 2015年
关键词
Order-Preserving Encryption; Randomization; Indistinguishability;
D O I
10.1145/2810103.2813629
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Order-preserving encryption allows encrypting data, while still enabling efficient range queries on the encrypted data. This makes its performance and functionality very suitable for data outsourcing in cloud computing scenarios, but the security of order-preserving is still debatable. We present a scheme that achieves a strictly stronger notion of security than any other scheme so far. The basic idea is to randomize the ciphertexts to hide the frequency of plaintexts. Still, the client storage size remains small, in our experiments up to 1/15 of the plaintext size. As a result, one can more securely outsource large data sets, since we can also show that our security increases with larger data sets.
引用
收藏
页码:656 / 667
页数:12
相关论文
共 37 条
  • [1] Abadi D., 2006, P ACM INT C MAN DAT
  • [2] Agrawal D., 2009, P 25 INT C DAT ENG
  • [3] Agrawal R., 2004, P ACM INT C MAN DAT
  • [4] Agrawal S., 2013, 744 IACR CRYPT EPRIN
  • [5] CONSTRUCTION OF A TREE FROM ITS TRAVERSALS IN OPTIMAL TIME AND SPACE
    ANDERSSON, A
    CARLSSON, S
    [J]. INFORMATION PROCESSING LETTERS, 1990, 34 (01) : 21 - 25
  • [6] [Anonymous], 2000, P 21 IEEE S SEC PRIV
  • [7] [Anonymous], P 18 INT C DAT ENG I
  • [8] [Anonymous], 2011, P 23 ACM S OP SYST P
  • [9] Binnig C., 2009, P ACM INT C MAN DAT
  • [10] Boldyreva A., 2011, P 31 INT C ADV CRYPT