1. 西北农林科技大学机械与电子工程学院, 712100, 陕西杨凌
2. 西北农林科技大学信息工程学院, 712100, 陕西杨凌
网络首发:2012-08-10,
纸质出版:2012
移动端阅览
景旭 1, 2, 李冰冰 2, 等. 跨隐私数据库加密数据等值连接共享协议[J]. 西安交通大学学报, 2012,46(8):37-42.
A Protocol of Encrypted Data Equijoin Sharing Across Private Database[J]. 2012, 46(8): 37-42.
针对管理型SaaS(software as a service)中两个租户公平共享隐私数据的问题
提出一种跨隐私数据库加密数据等值连接共享协议.在该协议中:两个租户通过服务提供方(service provider
SP)用可交换加密函数交换某共有属性的全集
实现属性值交集共享; SP用该属性值生成的密钥加密对应元组其他属性值后向对方租户分发; 租户用交集生成的密钥解密; 组合双方属性交集中等值元素的元组
实现两个租户通过不可信SP公平共享隐私数据.完备性、安全性证明和效率分析结果表明
在半诚实模型下
协议安全可证
满足最少必要信息共享条件
计算代价和通信代价分别是用AGRAWAL协议实现公平共享的57%和75%.
A protocol of encrypted data equijoin sharing across private database is proposed for the problem of fair sharing the private data between two tenants in management-type software as a service. The protocol realizes the sharing of the intersection on a mutual attribute with the help of service provider and using a commutative encryption function to exchange the universal set of the attribute between two tenants. The service provider encrypts other attributes using the key that is generated by the value of attribute
and then sends them to counterpart. Each tenant decrypts them with the key that is generated by intersection. Then the equijoin of private data is shared fairly by assembling both parties' tuples of equivalent elements in the intersection. Analyzing results for completeness
security and efficiency in a semi-honest model show that the protocol is proved safely
and meets the minimal necessary information sharing
and that the computation and the communication costs are 57% and 75% of those in utilizing the fair sharing information by AGRAWAL's protocol.
CHONG F, CARRARO G. Architecture strategies for catching the long tail [R/OL]∥(2006-04-01)[2011-06-10]. http:∥msdn.microsoft.com/en-us/library/aa479069.aspx.
PAPAZOGLOU M P, TRAVERSO P, DUSTDAR S, et al. Service-oriented computing: state of the art and research challenges [J]. IEEE Computer, 2007, 40(11): 64-71.
KWOK T, NGUYEN T, LAM L. A software as a service with multi-tenancy support for an electronic contract management application [C]∥Proceedings of the 2008 IEEE International Conference on Services Computing. Washington DC,USA:IEEE Computer Society, 2008: 179-186.
BEZEMER C, ZAIDAM A. Challenges of reengineering into multi-tenant SaaS applications, TUD-SERG-2010-012 [R]. Delft, Netherlands: Delft University of Technology. Software Engineering Research Group, Department of Software Technology, Faculty of Electrical Engineering, Mathematics and Computer Science, 2010.
AGRAWAL R, EVFIMIEVSKI A, SRIKANT R. Information integration across autonomous enterprises: US, 2008/0065910 A1[P].2008-05-13.
AGRAWAL R, EVFIMIEVSKI A, SRIKANT R. Information sharing across private databases[C]∥Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data. New York, NY, USA: ACM, 2003: 86-97.
MA Sha, YANG Bo, LI Kangshun, et al. A privacy-preserving join on outsourced database [C]∥Proceedings of the 14th International Conference on Information Security. Berlin,Germany: Springer-Verlag, 2011: 278-292.
SIEGENTHALER M, BIRMAN K. Sharing private information across distributed databases[C]∥Proceedings of the 8th IEEE International Symposium on Network Computing and Applications. Piscataway, NJ, USA: IEEE, 2009: 82-89.
CARBUNAR B, SION R. Joining privately on outsourced data[C]∥Proceedings of the 7th VLDB Conference on Secure Data Management. Berlin, Germany: Springer-Verlag, 2010: 70-86.
LINDELL Y, PINKAS B. Secure multiparty computation for privacy-preserving data mining [J]. Journal of Privacy and Confidentiality, 2009, 1(1):59-98.
程柏良,曾国荪,揭安全. 基于安全多方计算的可信防共谋协议模型[J]. 通信学报, 2011, 32(8):23-30.
CHENG Bailiang, ZENG Guosun, JIE Anquan. Trusted coalition-proof protocol model based on secure multi-part computing [J]. Journal on Communications, 2011, 32(8): 23-30.
刘文, 罗守山, 王永滨. 安全两方向量优势统计协议及其应用[J]. 电子学报, 2010, 38(11): 2573-2577.
LIU Wen, LUO Shoushan, WANG Yongbin. Secure two-party vector dominance statistic protocol and its applications [J]. Acta Electronica Sinica, 2010, 38(11): 2573-2577.
BEAVER D, MICALI S, ROGAWAY P. The round complexity of secure protocols [C]∥Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing. New York, NY, USA: ACM, 1991:503-513.
0
浏览量
4
下载量
1
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621