Frequency-Hiding Order-Preserving Encryption

被引:104
|
作者
Kerschbaum, Florian [1 ]
机构
[1] SAP, Karlsruhe, Germany
关键词
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
相关论文
共 50 条
  • [31] BOPE: Boundary Order-Preserving Encryption Scheme in Relational Database System
    Chen, Si
    Li, Lin
    Zhang, Wenyu
    Chang, Xiaolin
    Han, Zhen
    IEEE ACCESS, 2021, 9 : 30124 - 30134
  • [32] Ensuring Query Completeness In Outsourced Database using Order-Preserving Encryption
    Shen, Ning
    Yeh, Jyh-haw
    Chen, Chien-Ming
    Chen, Yeh-Cheng
    Zhang, Yunpeng
    2019 IEEE INTL CONF ON PARALLEL & DISTRIBUTED PROCESSING WITH APPLICATIONS, BIG DATA & CLOUD COMPUTING, SUSTAINABLE COMPUTING & COMMUNICATIONS, SOCIAL COMPUTING & NETWORKING (ISPA/BDCLOUD/SOCIALCOM/SUSTAINCOM 2019), 2019, : 776 - 783
  • [33] On order-preserving representations
    Ben Simon, G.
    Burger, M.
    Hartnick, T.
    Iozzi, A.
    Wienhard, A.
    JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 2016, 94 : 525 - 544
  • [34] ORDER-PRESERVING ASSIGNMENTS
    PADBERG, M
    ALEVRAS, D
    NAVAL RESEARCH LOGISTICS, 1994, 41 (03) : 395 - 421
  • [35] Order-preserving matching
    Kim, Jinil
    Eades, Peter
    Fleischer, Rudolf
    Hong, Seok-Hee
    Iliopoulos, Costas S.
    Park, Kunsoo
    Puglisi, Simon J.
    Tokuyama, Takeshi
    THEORETICAL COMPUTER SCIENCE, 2014, 525 : 68 - 79
  • [36] Order-preserving indexing
    Crochemore, Maxime
    Iliopoulos, Costas S.
    Kociumaka, Tomasz
    Kubica, Marcin
    Langiu, Alessio
    Pissis, Solon P.
    Radoszewski, Jakub
    Rytter, Wojciech
    Walen, Tomasz
    THEORETICAL COMPUTER SCIENCE, 2016, 638 : 122 - 135
  • [37] A Ciphertext-Size Lower Bound for Order-Preserving Encryption with Limited Leakage
    Cash, David
    Zhang, Cong
    THEORY OF CRYPTOGRAPHY, TCC 2018, PT II, 2018, 11240 : 159 - 176
  • [38] Efficient and Secure Top-k Queries With Top Order-Preserving Encryption
    Quan, Hanyu
    Wang, Boyang
    Zhang, Yuqing
    Wu, Gaofei
    IEEE ACCESS, 2018, 6 : 31525 - 31540
  • [39] Optimal Average-Complexity Ideal-Security Order-Preserving Encryption
    Kerschbaum, Florian
    Schroepfer, Axel
    CCS'14: PROCEEDINGS OF THE 21ST ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2014, : 275 - 286
  • [40] MPOPE: Multi-provider Order-Preserving Encryption for Cloud Data Privacy
    Liang, Jinwen
    Qin, Zheng
    Xiao, Sheng
    Zhang, Jixin
    Yin, Hui
    Li, Keqin
    SECURITY AND PRIVACY IN COMMUNICATION NETWORKS, SECURECOMM 2017, 2018, 238 : 808 - 822