1. 复旦大学计算机科学技术学院,上海 201203
2. 上海市数据科学重点实验室,上海 201203
[ "黄霖(1994-),女,复旦大学软件学院硕士生,主要研究方向为大数据安全及隐私保护。" ]
[ "黎源(1988-),男,复旦大学计算机科学技术学院博士生,主要研究方向为大数据安全及隐私保护。" ]
[ "汪星辰(1993-),男,复旦大学软件学院硕士生,主要研究方向为大数据安全及隐私保护。" ]
[ "赵运磊(1974-),男,复旦大学计算机科学技术教授、博士生导师,主要研究方向为密码协议理论及应用、密码学与计算复杂性的交叉研究。" ]
网络首发:2018-03,
纸质出版:2018-03-15
移动端阅览
黄霖, 黎源, 汪星辰, 等. 数据自治开放的加密技术挑战[J]. 大数据, 2018,4(2):2018018.
Lin HUANG, Yuan LI, Xingchen WANG, et al. Challenge of encryption technology for self-governing openness of data[J]. Big data research, 2018, 4(2): 2018018.
黄霖, 黎源, 汪星辰, 等. 数据自治开放的加密技术挑战[J]. 大数据, 2018,4(2):2018018. DOI: 10.11959/j.issn.2096-0271.2018018.
Lin HUANG, Yuan LI, Xingchen WANG, et al. Challenge of encryption technology for self-governing openness of data[J]. Big data research, 2018, 4(2): 2018018. DOI: 10.11959/j.issn.2096-0271.2018018.
数据自治开放以数据盒为基本数据单元向数据使用者开放,因此数据资源稀缺性丧失和隐私泄露等问题的防范主要针对数据盒。一个数据盒可能包含照片、视频、文本和结构化数据等,传统的数据加密技术无法有效应用。系统分析了数据盒对数据加密的需求和传统数据加密技术面临的挑战,探讨了面向数据自治开放的加密新型技术的展望。
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.
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 .
GENTRY C . Fully homomorphic encryption using ideal lattices [J ] . ACM Symposium on Theory of Computing , 2009 , 9 ( 4 ): 169 - 178 .
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 .
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 .
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 .
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 .
PANDEY O , ROUSELAKIS Y . Property preserving symmetric encryption [J ] . Lecture Notes in Computer Science , 2012 ( 7237 ): 375 - 391 .
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 .
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 .
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 .
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 .
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 .
CASH D , LIU F H , O'NEILL A , et al . Reducing the leakage in practical orderrevealing encryption [J ] . IACR Cryptology ePrint Archive , 2016 : 661 .
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 .
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 .
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 .
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 .
PODDAR R , BOELTER T , POPA R A . Arx:a strongly encrypted database system [J ] . IACR Cryptology ePrint Archive , 2016 : 591 .
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 .
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 .
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 .
GARG S , MOHASSEL P , PAPAMANTHOU C . TWORAM:roundoptimal oblivious ram with applications to searchable encryption [J ] . Journal of Chinese Agricultural Mechanization , 2015 : 1010 .
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 .
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 .
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 .
GOLDWASSER S , MICALI S . Probabilistic encryption [J ] . Journal of Computer &System Sciences , 1984 , 28 ( 2 ): 270 - 299 .
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 .
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 .
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 .
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 .
BRAKERSKI Z , GENTRY C , VAIKUNTANATHAN V . (Leveled) fully homomorphic encryption without bootstrapping [J ] . ACM Transactions on Computation Theory (TOCT) , 2014 , 6 ( 3 ): 13 .
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 .
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 .
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 .
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 .
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 .
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 .
0
浏览量
1079
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621