
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Jaideep Vaidya, Christopher W. Clifton, "PrivacyPreserving Kth Element Score over Vertically Partitioned Data," IEEE Transactions on Knowledge and Data Engineering, vol. 21, no. 2, pp. 253258, February, 2009.  
BibTex  x  
@article{ 10.1109/TKDE.2008.167, author = {Jaideep Vaidya and Christopher W. Clifton}, title = {PrivacyPreserving Kth Element Score over Vertically Partitioned Data}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {21}, number = {2}, issn = {10414347}, year = {2009}, pages = {253258}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2008.167}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  PrivacyPreserving Kth Element Score over Vertically Partitioned Data IS  2 SN  10414347 SP253 EP258 EPD  253258 A1  Jaideep Vaidya, A1  Christopher W. Clifton, PY  2009 KW  Privacy KW  security KW  k{\rm th} element score KW  topk queries. VL  21 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] R. Fagin, “Combining Fuzzy Information from Multiple Systems,” Proc. 15th ACM SIGACTSIGMODSIGART Symp. Principles of Database Systems (PODS '96), pp. 216226, http://www.acm.org/sigmod/dblp/db/conf/pods Fagin96.html, June 1996.
[2] R. Fagin, “Combining Fuzzy Information from Multiple Systems,” J. Computer and System Sciences, (Special issue for selected papers from the 1996 ACM Symp. Principles of Database Systems), pp.8399, 1999.
[3] N. Zhang and W. Zhao, “Distributed Privacy Preserving Information Sharing,” Proc. 31st Int'l Conf. Very Large Data Bases (VLDB '05), pp. 889900, 2005.
[4] W. Jiang and C. Clifton, “AcFramework for PrivacyPreserving Collaboration,” Proc. Seventh SIAM Int'l Conf. Data Mining (SDM), 2007.
[5] M. Shaneck, Y. Kim, and V. Kumar, “Privacy Preserving Nearest Neighbor Search,” Proc. ICDM Workshops, pp. 541545, 2006.
[6] T.M. Cover and P. Hart, “Nearest Neighbor Pattern Classification,” IEEE Trans. Information Theory, vol. 13, pp. 2127, Jan. 1967.
[7] L. Ertoz, M. Steinbach, and V. Kumar, “A New Shared Nearest Neighbor Clustering Algorithm and Its Applications,” Proc. Text Mine, First SIAM Int'l Conf. Data Mining (SDM '01), Workshop Clustering High Dimensional Data and Its Applications, 2001.
[8] R.A. Jarvis and E.A. Patrick, “Clustering Using a Similarity Measure Based on Shared Nearest Neighbors,” IEEE Trans. Computers, vol. 22, no. 11, pp. 10251034, Nov. 1973.
[9] M.M. Breunig, H.P. Kriegel, R.T. Ng, and J. Sander, “LOF:Identifying DensityBased Local Outliers,” Proc. ACM SIGMOD'00, W. Chen, J.F. Naughton, and P.A. Bernstein, eds., pp. 93104, 2000.
[10] R. Fagin, “Fuzzy Queries in Multimedia Database Systems,” Proc. 17th ACM SIGACTSIGMODSIGART Symp. Principles of Database Systems (PODS '98), pp. 110, http://www.acm.org/sigmod/dblp/db/conf/pods Fagin98.html, June 1998.
[11] S. Chaudhuri and L. Gravano, “Evaluating Top$k$ Selection Queries,” Proc. 25th Int'l Conf. Very Large Data Bases (VLDB'99), pp.397410, http://www.vldb.org/dblp/db/conf/vldbChaudhuriG99.html , Sept. 1999.
[12] N. Bruno, L. Gravano, and A. Marian, “Evaluating Top$k$ Queries over WebAccessible Databases,” Proc. 18th Int'l Conf. Data Eng. (ICDE '02), pp. 369380, http://ieeexplore.ieee.org/iel5/7807/21451 00994751.pdf, Feb./Mar. 2002.
[13] A.C. Yao, “How to Generate and Exchange Secrets,” Proc. 27th IEEE Symp. Foundations of Computer Science (FOCS '86), pp.162167, 1986.
[14] O. Goldreich, The Foundations of Cryptography, vol. 2, ch. General Cryptographic Protocols, Cambridge Univ. Press, http://www.wisdom.weizmann.ac.il/~oded/PSBookFrag prot.ps, 2004.
[15] R. Fagin, A. Lotem, and M. Naor, “Optimal Aggregation Algorithms for Middleware,” Proc. 20th ACM SIGACTSIGMODSIGART Symp. Principles of Database Systems (PODS '01), pp. 102113, http://doi.acm.org/10.1145375551.375567, May 2001.
[16] D. Donjerkovic and R. Ramakrishnan, “Probabilistic Optimization of Top $n$ Queries,” Proc. 25th Int'l Conf. Very Large DataBases (VLDB '99), pp. 411422, http://portal.acm.orgcitation.cfm?id=671510& dl=ACM&coll=GUIDE& CFID=11111111&CFTOKEN=2222222 , 1999.
[17] I.F. Ilyas, W.G. Aref, and A.K. Elmagarmid, “Supporting Top$k$ Join Queries in Relational Databases,” Proc. 29th Int'l Conf. Very Large Data Bases (VLDB '03), pp. 754765, http://www.vldb.org/conf/2003/papersS23P01.pdf , Sept. 2003.
[18] “Special Section on Privacy and Security” SIGKDD Explorations, vol. 4, no. 2, pp. i48, http://www.acm.org/sigs/sigkdd/explorations/ issue42contents.htm, Jan. 2003.
[19] J. Vaidya, C. Clifton, and M. Zhu, PrivacyPreserving Data Mining, first ed., ser. Advances in Information Security, vol. 19, SpringerVerlag, http://www.springeronline.com/sgw/cda/frontpage 0,11855,44035672524964940,00.html , 2005.
[20] G. Aggarwal, N. Mishra, and B. Pinkas, “Secure Computation ofthe $k{\rm th}$ Ranked Element,” Proc. IACR Int'l Conf. Theory and Applications of Cryptographic Techniques (EUROCRYPT '04), May 2004.
[21] D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella, “Fairplay—A Secure TwoParty Computation System,” Proc. 13th USENIX Security Symp., pp. 287302, 2004.
[22] J. Vaidya and C. Clifton, “Secure Set Intersection Cardinality withApplication to Association Rule Mining,” J. Computer Security, vol. 13, no. 4, pp. 593622, Nov. 2005.
[23] R. Agrawal, A. Evfimievski, and R. Srikant, “Information Sharing across Private Databases,” Proc. ACM SIGMOD '03, http://doi.acm.org/10.1145872757.872771, June 2003.
[24] M.J. Freedman, K. Nissim, and B. Pinkas, “Efficient Private Matching and Set Intersection,” Proc. Int'l Conf. Theory and Applications of Cryptographic Techniques (EUROCRYPT '04), May 2004.
[25] M. Kantarciogˇlu and C. Clifton, “PrivacyPreserving Distributed Mining of Association Rules on Horizontally Partitioned Data,” IEEE Trans. Knowledge and Data Eng., vol. 16, no. 9, pp.10261037, http://csdl.computer.org/comp/trans/tk/2004/ 09k1026abs.htm, Sept. 2004.
[26] M. Bawa, R.J. Bayardo Jr, and R. Agrawal, “PrivacyPreserving Indexing of Documents on the Network,” Proc. 29th Int'l Conf. Very Large Data Bases (VLDB '03), pp. 922933, http://www.vldb.org/conf/2003/papersS27P03.pdf , Sept. 2003.
[27] S.C. Pohlig and M.E. Hellman, “An Improved Algorithm for Computing Logarithms over GF(p) and Its Cryptographic Significance,” IEEE Trans. Information Theory, vol. IT24, pp.106110, 1978.
[28] B. Goethals, S. Laur, H. Lipmaa, and T. Mielikäinen, “On Secure Scalar Product Computation for PrivacyPreserving Data Mining,” Proc. Seventh Ann. Int'l Conf. Information Security and Cryptology (ICISC '04), C. Park and S. Chee, eds., vol. 3506, pp.104120, Dec. 2004.
[29] M. Fischlin, “A CostEffective PayPerMultiplication Comparison Method for Millionaires,” RSA Security 2001 Cryptographer's Track LNCS, vol. 2020, SpringerVerlag, pp. 457471, 2001.
[30] I. Ioannidis and A. Grama, “An Efficient Protocol for Yao's Millionaires' Problem,” Proc. Hawaii Int'l Conf. System Sciences (HICSS36), pp. 205210, Jan. 2003.