数据自治开放的加密技术挑战

doi:10.11959/j.issn.2096-0271.2018018

大数据 ›› 2018, Vol. 4 ›› Issue (2): 50-62.doi: 10.11959/j.issn.2096-0271.2018018

数据自治开放的加密技术挑战

黄霖^1,²,黎源^1,²,汪星辰^1,²,赵运磊^1,²

¹ 复旦大学计算机科学技术学院，上海 201203
² 上海市数据科学重点实验室，上海 201203

出版日期:2018-03-15 发布日期:2018-04-10
作者简介:黄霖（1994-），女，复旦大学软件学院硕士生，主要研究方向为大数据安全及隐私保护。|黎源（1988-），男，复旦大学计算机科学技术学院博士生，主要研究方向为大数据安全及隐私保护。|汪星辰（1993-），男，复旦大学软件学院硕士生，主要研究方向为大数据安全及隐私保护。|赵运磊（1974-），男，复旦大学计算机科学技术教授、博士生导师，主要研究方向为密码协议理论及应用、密码学与计算复杂性的交叉研究。
基金资助:
国家重点研发专项(2017YFB0802000);国家自然科学基金资助项目(61472084);国家自然科学基金资助项目(U1536205);上海市创新行动项目(16DZ1100200);上海市科技发展基金资助项目(16JC1400801);山东省重大科技创新工程(2017CXG0701)

Challenge of encryption technology for self-governing openness of data

Lin HUANG^1,²,Yuan LI^1,²,Xingchen WANG^1,²,Yunlei ZHAO^1,²

¹ School of Computer Science,Fudan University,Shanghai 201203,China
² Shanghai Key Laboratory of Data Science,Shanghai 201203,China

Online:2018-03-15 Published:2018-04-10
Supported by:
National Key R＆D Program of China(2017YFB0802000);NationalNatural Science Foundation of China(61472084);NationalNatural Science Foundation of China(U1536205);Shanghai Innovation Action Project(16DZ1100200);Shanghai Science and Technology Development Funds(16JC1400801);Shandong Provincial Key Research and Development Program(2017CXG0701)

摘要/Abstract

摘要：

数据自治开放以数据盒为基本数据单元向数据使用者开放，因此数据资源稀缺性丧失和隐私泄露等问题的防范主要针对数据盒。一个数据盒可能包含照片、视频、文本和结构化数据等，传统的数据加密技术无法有效应用。系统分析了数据盒对数据加密的需求和传统数据加密技术面临的挑战，探讨了面向数据自治开放的加密新型技术的展望。

关键词: 数据自治开放, 对称可搜索加密, 属性保留加密, 属性揭示加密, 同态加密, 不经意随机存取

Abstract:

Data box is the basic data unit opened to the data users in self-governing openness of data,so the prevention for the degradation of data scarcity and the disclosure of privacy is mainly aimed at the data box.A data box may contain photos,videos,text and structured data,etc.The traditional data encryption technology cannot be effectively applied.The requirement of data encryption for data box and the challenges of traditional data encryption technologies were analyzed,and the prospect of new encryption technologies for self-governing openness of data was discussed.

Key words: self-governing openness of data, searchable symmetric encryption, property-preserving encryption, property-revealing encryption, homomorphic encryption, oblivious random access memory

中图分类号:

TP399

黄霖, 黎源, 汪星辰, 赵运磊. 数据自治开放的加密技术挑战[J]. 大数据, 2018, 4(2): 50-62.

Lin HUANG, Yuan LI, Xingchen WANG, Yunlei ZHAO. Challenge of encryption technology for self-governing openness of data[J]. Big Data Research, 2018, 4(2): 50-62.

图/表 1

参考文献 37

[1]	POPA R A , REDFIELD C , ZELDOVICH N ,et al. CryptDB:protecting confidentiality with encrypted query processing[C]// The 23rd ACM Symposium on Operating Systems Principles,October 23-26,2011,Cascais,Portugal. New York:ACM Press, 2011: 85-100.
[2]	GENTRY C . Fully homomorphic encryption using ideal lattices[J]. ACM Symposium on Theory of Computing, 2009,9(4): 169-178.
[3]	GOLDREICH O , . Towards a theory of software protection and simulation by oblivious RAMs[C]// The 19th Annual ACM Symposium on Theory of Computing,May 25-27,1987,New York,USA. New York:ACM Press, 1987: 182-194.
[4]	BELLARE M , BOLDYREVA A,O’NEILL A . Deterministic and efficiently searchable encryption[C]// The 27th Annual International Cryptology Conference on Advances in Cryptology,August 19-23,2007,Santa Barbaba,USA. Heidelberg:Springer-Verlag, 2007: 535-552.
[5]	BOLDYREVA A , CHENETTE N , LEE Y ,et al. Order-preserving symmetric encryption[C]// The 28th Annual International Conference on Advances in Cryptology:the Trheory and Applicaitons of Cryptographic Techniques,April 26-30,2009,Cologne,Germany. New York:ACM Press, 2009: 224-241.
[6]	BOLDYREVA A , CHENETTE N,O'NEILL A . Order-preserving encryption revisited:improved security analysis and alternative solutions[C]// The 31st Annual Cryptology Conference,August 14-18,2011,Santa Barbara,USA. Heidelberg:Springer, 2011: 578-595.
[7]	PANDEY O , ROUSELAKIS Y . Property preserving symmetric encryption[J]. Lecture Notes in Computer Science, 2012(7237): 375-391.
[8]	AGRAWAL R , KIERNAN J , SRIKANT R ,et al. Order preserving encryption for numeric data[C]// The 2004 ACM SIGMOD International Conference on Management of Data,June 13-18,2004,Paris,France. New York:ACM Press, 2004: 563-574.
[9]	KERSCHBAUM F , . Frequency-hiding order-preserving encryption[C]// The 22nd ACM SIGSAC Conference on Computer and Communications Security,October 12-16,2015,Denver,USA. New York:ACM Press, 2015: 656-667.
[10]	KERSCHBAUM F , SCHR?PFER A . Optimal average-complexity ideal-security order-preserving encryption[C]// The 2014 ACM SIGSAC Conference on Computer and Communications Security,November 3-7,2014,Scottsdale,USA. New York:ACM Press, 2014: 275-286.
[11]	POPA R A , LI F H , ZELDOVICH N . An ideal-security protocol for orderpreserving encoding[C]// IEEE Symposium on Security and Privacy,May 19-22,2013,San Francisco,USA. Piscataway:IEEE Press, 2013: 463-477.
[12]	DAN B , LEWI K , RAYKOVA M ,et al. Semantically secure order-revealing encryption:multi-input functional encryption without obfuscation[J]. Lecture Notes in Computer Science , 2015(9057): 563-594.
[13]	CASH D , LIU F H , O'NEILL A ,et al. Reducing the leakage in practical orderrevealing encryption[J]. IACR Cryptology ePrint Archive, 2016: 661.
[14]	CHENETTE N , LEWI K , WEIS S A ,et al. Practical order-revealing encryption with limited leakage[C]// International Conference on Fast Software Encryption,March 20-23,2016,Bochum,Germany. Heidelberg:Springer, 2016: 474-493.
[15]	BOST R , . ∑oφo?:forward secure searchable encryption[C]// The 2016 ACM SIGSAC Conference on Computer and Communications Security,October 24-28,2016,Vienna,Austria. New York:ACM Press, 2016: 1143-1154.
[16]	KAMARA S , PAPAMANTHOU C . Parallel and dynamic searchable symmetric encryption[C]// International Conference on Financial Cryptography and Data Security,April 1-5,2013,Okinawa,Japan. Heidelberg:Springer, 2013: 258-274.
[17]	STEFANOV E , PAPAMANTHOU C , SHI E . Practical dynamic searchable encryption with small leakage[C]// NDSS Symposium 2014,February 23-26,2014, San Diego,USA.[S.l.:s.n.], 2014: 23-26.
[18]	PODDAR R , BOELTER T , POPA R A . Arx:a strongly encrypted database system[J]. IACR Cryptology ePrint Archive, 2016: 591.
[19]	YAO A C , . How to generate and exchange secrets[C]// The 27th Annual Symposium on Foundations of Computer Science,October 27-29,1986,Toronto,Canada. Piscataway:IEEE Press, 2008(10): 162-167.
[20]	ROCHE D S , APON D , CHOI S G ,et al. POPE:Partial order preserving encoding[C]// The 2016 ACM SIGSAC Conference on Computer and Communications Security,October 24-28,2016,Vienna,Austria. New York:ACM Press, 2016: 1131-1142.
[21]	STEFANOV E , VAN DIJK M , SHI E ,et al. Path ORAM:an extremely simple oblivious RAM protocol[C]// The 2013 ACM SIGSAC Conference on Computer ＆ Communications Security,November 4-8,2013,Berlin,Germany. New York:ACM Press, 2013: 299-310.
[22]	GARG S , MOHASSEL P , PAPAMANTHOU C . TWORAM:roundoptimal oblivious ram with applications to searchable encryption[J]. Journal of Chinese Agricultural Mechanization, 2015: 1010.
[23]	RIVEST R , SHAMIR A , ADLEMAN L M . A method for obtaining digital signatures and public-key cryptosystems[J]. Communications of the ACM, 1983,26(2): 96-99.
[24]	ELGAMAL T . A public key cryptosystem and a signature scheme based on discrete logarithms[J]. IEEE Transactions on Information Theory, 1985,31(4): 469-472.
[25]	PAILLIER P , . Public-key cryptosystems based on composite degree residuosity classes[C]// International Conference on Theory and Application of Cryptographic Techniques,May 2-6,1999,Prague,Czech Republic. Heidelberg:Springer, 1999: 223-238.
[26]	GOLDWASSER S , MICALI S . Probabilistic encryption[J]. Journal of Computer ＆System Sciences, 1984,28(2): 270-299.
[27]	DAN B , GOH E J , NISSIM K . Evaluating 2-DNF Formulas on Ciphertexts[C]// The 2nd International Conference on Theory of Cryptography,February 10-12,2005,Cambridge,USA. Heidelberg:Springer, 2005(3378): 325-341.
[28]	VAN D M , GENTRY C , HALEVI S ,et al. Fully homomorphic encryption over the integers[C]// Annual International Conference on the Theory and Applications of Cryptographic Techniques,April 30-May 4,Paris,France. Heidelberg:Springer, 2010: 24-43.
[29]	CORON J S , MANDAL A , NACCACHE D ,et al. Fully Homomorphic Encryption over the Integers with Shorter Public Keys[C]// The 31st Annual Conference on Advances in Cyptology,August 14-18,2011,Santa Barbara,USA. Heidelberg:Springer, 2011: 487-504.
[30]	CORON J S , LEPOINT T , TIBOUCHI M . Scale-invariant fully homomorphic encryption over the integers[M]// The 17th IACR International Conference on Practice and Theory of Public-Key Cryptography,March 26-28,2014,Buenos Aires,Argentina. Heidelberg: Springer, 2014: 361-372.
[31]	BRAKERSKI Z , GENTRY C , VAIKUNTANATHAN V . (Leveled) fully homomorphic encryption without bootstrapping[J]. ACM Transactions on Computation Theory (TOCT), 2014,6(3): 13.
[32]	BRAKERSKI Z , VAIKUNTANATHAN V . Efficient fully homomorphic encryption from (standard) LWE[C]// Foundations of Computer Science,October 23-25,2011,Palm Springs,USA. Piscataway:IEEE Press, 2011: 97-106.
[33]	GENTRY C , HALEVI S , SMART N P . Fully homomorphic encryption with polylog overhead[C]// Advances in Cryptology EUROCRYPT 2012,April 15-19,2012,Cambridge,UK. Heidelberg:Springer, 2012: 1-16.
[34]	ZHANG Y , KATZ J , PAPAMANTHOU C . IntegriDB:Verifiable SQL for outsourced databases[C]// The 22nd ACM SIGSAC Conference on Computer and Communications Security,October 12-16,2015,Denver,USA. New York:ACM Press, 2015: 1480-1491.
[35]	FULLER B , VARIA M , YERUKHIMOVICH A ,et al. SoK:Cryptographically Protected Database Search[C]// The 38th IEEE Symposium on Security and Privacy,May 22-24,2017,San Jose,USA. Piscataway:IEEE Press, 2017: 172-191.
[36]	TU S , KAASHOEK M F , MADDEN S ,et al. Processing analytical queries over encrypted data[C]// International Conference on Very Large Data Bases,August 26-30,2013,Riva del Garda,Italy. New York:ACM Press, 2013: 289-300.
[37]	FISCH B A , VO B , KRELL F ,et al. Malicious-client security in blind seer:a scalable private DBMS[C]// IEEE Symposium on Security and Privacy,May 18-20,2015,San Jose,USA. Piscataway:IEEE Press, 2015: 395-410.

查询类型	符号表示	释义
等值查询	EQ(A=a)	查询语句EQ查询属性A等于a的数据
单限范围查询	RQ(b<B)	查询语句RQ查询属性B大于b的数据。括号内不等式还包含大于、大于等于、小于等于的情况
布尔运算	S₁∪S₂，S₃∩S₄，S₅\S₆	求S₁与S₂的并集，求S₃与S₄的交集，求S₅减去S₆的差集
“或”门等值查询	EQ（A in[a₁，a₂，…，a_n]）	查询语句EQ查询属性A等于a₁到a_n的n个数据中任一个值的数据
“或”门范围查询	RQ (b₁<B) or RQ（b₂>B）	查询语句RQ查询属性B大于b₁或者小于b₂的数据
“与”门等值查询	EQ(A₁=a₁and A₂=a₂）	查询语句EQ查询属性A₁等于a₁且属性A₂等于a₂的数据
模糊查询	ProximityQ（E，e）	查询语句ProximityQ查询属性E的类似于e的数据
词干查询	StemmerQ（C，c）	查询语句StemmerQ查询属性C的词干为c的数据
不等值查询	NEQ（F≠f）	查询语句NEQ查询属性F不等于f的数据

数据自治开放的加密技术挑战

Challenge of encryption technology for self-governing openness of data

在线阅读

PDF下载

可视化

摘要/Abstract

引用本文

使用本文

图/表 1

参考文献 37

相关文章 8

Metrics

推荐阅读 0

[1]	尹虹舒, 周旭华, 周文君. 纵向联邦线性模型在线推理过程中成员推断攻击的隐私保护研究[J]. 大数据, 2022, 8(5): 45-54.
[2]	刘彦松, 夏琦, 李柱, 夏虎, 张小松, 高建彬. 基于区块链的链上数据安全共享体系研究[J]. 大数据, 2020, 6(5): 92-105.
[3]	朱扬勇, 熊贇, 廖志成, 叶雅珍. 数据自治开放模式[J]. 大数据, 2018, 4(2): 3-13.
[4]	沈逸, 姚旭, 朱扬勇. 数据自治开放与治理模式创新[J]. 大数据, 2018, 4(2): 14-20.
[5]	熊贇, 朱扬勇. 面向数据自治开放的数据盒模型[J]. 大数据, 2018, 4(2): 21-30.
[6]	吴毅坚, 陈士壮, 葛佳丽, 赵文耘. 数据自治开放的软件开发和运行环境[J]. 大数据, 2018, 4(2): 31-41.
[7]	王智慧, 周旭晨, 朱云. 数据自治开放模式下的隐私保护[J]. 大数据, 2018, 4(2): 42-49.
[8]	陈德华, 潘乔, 王梅, 乐嘉锦. 数据自治开放应用平台设计与实践[J]. 大数据, 2018, 4(2): 63-71.