The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - July-September (2008 vol.1)
pp: 130-140
Stephen S. Yau , Arizona State University, Tempe
Yin Yin , Arizona State University, Tempe
ABSTRACT
Current data sharing and integration among various organizations require a central and trusted authority to first collect data from all data sources and then integrate the collected data. This process tends to complicate the update of data and to compromise data sources' privacy. In this paper, a repository for integrating data from various data sharing services without central authorities is presented. The major differences between our repository and existing central authorities are: 1) Our repository collects data from data sharing services based on users' integration requirements rather than all the data from the data sharing services as existing central authorities. 2) While existing central authorities have full control of the collected data, the capability of our repository is restricted to computing the integration results required by users and cannot get other information about the data or use it for other purposes. 3) The data collected by our repository cannot be used to generate other results except that of the specified data integration request, and hence the compromise of our repository can only reveal the results of the specified data integration request, while the compromise of central authorities will reveal all data.
INDEX TERMS
Data sharing, Security, integrity, and protection, Distributed systems
CITATION
Stephen S. Yau, Yin Yin, "A Privacy Preserving Repository for Data Integration across Data Sharing Services", IEEE Transactions on Services Computing, vol.1, no. 3, pp. 130-140, July-September 2008, doi:10.1109/TSC.2008.14
REFERENCES
[1] Web Services Business Process Execution Language Version 2.0, OASIS Standard, http://docs.oasis-open.org/wsbpel/2.0wsbpel-v2.0.pdf , 2007.
[2] DTD Schema, http://www.w3.org/TR/REC-xml#dt-doctype, 2008.
[3] XQuery, http://www.w3.org/TRxquery, 2007.
[4] M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, T. Kohno, T. Lange, J. Malone-Lee, G. Neven, P. Paillier, and H. Shi, “Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions,” Advances in Cryptology (CRYPTO '05), pp. 205-222, 2005.
[5] S. Adali, K.S. Candan, Y. Papakonstantinou, and V.S. Subrahmanian, “Query Caching and Optimization in Distributed Mediator Systems,” Proc. ACM Int'l Conf. Management of Data (SIGMOD '96), pp. 137-148, 1996.
[6] R. Agrawal, A.V. Evfimievski, and R. Srikant, “Information Sharing across Private Databases,” Proc. ACM SIGMOD Int'l Conf. Management of Data (SIGMOD '03), pp. 86-97, 2003.
[7] R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu, “Order-Preserving Encryption for Numeric Data,” Proc. ACM Int'l Conf. Management of Data (SIGMOD '04), pp. 563-574, 2004.
[8] Y. Arens, C.A. Knoblock, and W. Shen, ”Query Reformulation for Dynamic Information Integration,” J. Intelligent Information Systems, vol. 6, no. 2, pp. 99-130, 1996.
[9] J. Baek, R. Safavi-Naini, and W. Susilo, ”On the Integration of Public Key Data Encryption and Public Key Encryption with Keyword Search,” Proc. Ninth Information Security Conf. (ISC '06), pp. 217-232, 2006.
[10] M. Bellare, A. Boldyreva, and A. O'Neill, ”Deterministic and Efficiently Searchable Encryption,” Advances in Cryptology (CRYPTO '07), pp. 535-552, 2007.
[11] D. Boneh, G.D. Crescenzo, R. Ostrovsky, and G. Persiano, ”Public Key Encryption with Keyword Search,” Advances in Cryptology (EUROCRYPT '04), pp. 506-522, 2004.
[12] D. Boneh and B. Waters, ”Conjunctive, Subset, and Range Queries on Encrypted Data,” Proc. Theory of Cryptography Conf. (TCC '07), pp. 535-554, 2007.
[13] E. Bresson, D. Catalano, and D. Pointcheval, ”A Simple Public-Key Cryptosystem with a Double Trapdoor Decryption Mechanism and Its Applications,” Advances in Cryptology (ASIACRYPT '03), pp. 37-54, 2003.
[14] R. Curtmola, J.A. Garay, S. Kamara, and R. Ostrovsky, ”Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions,” Proc. ACM Conf. Computer and Comm. Security (CCS '06), pp. 79-88, 2006.
[15] F. Emekci, D. Agrawal, A.E. Abbadi, and A. Gulbeden, ”Privacy Preserving Query Processing Using Third Parties,” Proc. 22nd Int'l Conf. Data Eng. (ICDE '06), p. 27, 2006.
[16] T. Ge and S.B. Zdonik, ”Answering Aggregation Queries in a Secure System Model,” Proc. 33rd Int'l Conf. Very Large Data Bases (VLDB '07), pp. 519-530, 2007.
[17] O. Goldreich, Foundations of Cryptography Volume II Basic Applications. Cambridge Univ. Press, 2001.
[18] Z.G. Ives, D. Florescu, M. Friedman, A.Y. Levy, and D.S. Weld, ”An Adaptive Query Execution System for Data Integration,” Proc. ACM Int'l Conf. Management of Data (SIGMOD '99), pp. 299-310, 1999.
[19] K.P. Fischer, U. Bleimann, W. Fuhrmann, and S.M. Furnell, ”Security Policy Enforcement in BPEL-Defined Collaborative Business Processes,” Proc. 23rd Int'l Conf. Data Eng. Workshop, pp. 685-694, 2007.
[20] N. Kushmerick, D.S. Weld, and R.B. Doorenbos, ”Wrapper Induction for Information Extraction,” Proc. Int'l Joint Conf. Artificial Intelligence, pp. 729-737, 1997.
[21] A.Y. Levy, A. Rajaraman, and J.J. Ordille, ”Querying Heterogeneous Information Sources Using Source Descriptions,” Proc. 22th Int'l Conf. Very Large Data Bases (VLDB '96), pp. 251-262, 1996.
[22] Y. Lindell and B. Pinkas, ”Privacy Preserving Data Mining,” J.Cryptology, vol. 15, no. 3, pp. 177-206, 2002.
[23] P. Paillier, ”Public-Key Cryptosystems Based on Composite Degree Residuosity Classes,” Advances in Cryptology (EUROCRYPT '99), pp. 223-238, 1999.
[24] B. Pinkas, ”Cryptographic Techniques for Privacy-Preserving Data Mining,” SIGKDD Explorations, vol. 4, no. 2, pp. 12-19, 2002.
[25] M. Scannapieco, I. Figotin, E. Bertino, and A.K. Elmagarmid, ”Privacy Preserving Schema and Data Matching,” Proc. ACM Int'l Conf. Management of Data (SIGMOD '07), pp. 653-664, 2007.
[26] E. Shi, J. Bethencourt, H.T.-H. Chan, D.X. Song, and A. Perrig, ”Multidimensional Range Query over Encrypted Data,” Proc. IEEE Symp. Security and Privacy (S&P '07), pp. 350-364, 2007.
[27] D.X. Song, D. Wagner, and A. Perrig, ”Practical Techniques for Searches on Encrypted Data,” Proc. IEEE Symp. Security and Privacy (S&P '00), pp. 44-55, 2000.
[28] L. Xiong, S. Chitti, and L. Liu, ”Preserving Data Privacy for Outsourcing Data Aggregation Services,” ACM Trans. Internet Technology, vol. 7, no. 3, pp. 17-45, 2007.
[29] S.S. Yau and Z. Chen, ”Security Policy Integration and Conflict Reconciliation for Collaborations among Organizations in Ubiquitous Computing Environments,” Proc. Fifth Int'l Conf. Ubiquitous Intelligence and Computing, pp. 3-19, 2008.
[30] B. Yu, G. Li, K.R. Sollins, and A.K.H. Tung, ”Effective Keyword-Based Selection of Relational Databases,” Proc. ACM Int'l Conf. Management of Data (SIGMOD '07), pp. 139-150, 2007.
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool