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.
关键词
Keywords
references
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.
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.
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.