ASSESSMENT OF PROSPECTIVE ADVERSARIES IN DATA PUBLISHING

Ch. Anjaiah, P.Niranjan Kumar, Dr.M.V.Siva Prasad

Abstract


Differential privacy assurances that occurrence of a verification cannot be conditional from a statistical information release with minute assumptions on an attacker’s environment information and does not conserve information reliability at the record stage, and therefore cannot be employed for several situation. M-Privacy can be assured while there are duplicate records which are treated as a particular record mutual by only some providers. Collaborative data publishing can be measured as a cooperative computation difficulty, in which numerous providers desire to calculate an anonymized vision of their information devoid of revealing any concealed and responsive information. Secure multi-party computation permits more than two parties to jointly calculate some general function by hiding their inputs. When a sub-coalition of an m-adversary is capable to contravene privacy, then upward pruning permit the algorithm to conclude instantly while the m-adversary is capable to violate confidentiality.


Keywords


Differential privacy; Collaborative data publishing; Secure multi-party computation; m-adversary;

References


M. E. Nergiz, A. E. C, ic,ek, T. B. Pedersen, and Y. Saygın, “Alook-ahead approach to secure multiparty protocols,” IEEE TKDE,vol. 24, pp. 1170–1185, 2012.

M. Ben-Or, S. Goldwasser, and A. Wigderson, “Completenesstheorems for non-cryptographic fault-tolerant distributed computation,”in Proceedings of the twentieth annual ACM symposium onTheory of computing, ser. STOC ’88, 1988, pp. 1–10.

S. Pohlig and M. Hellman, “An improved algorithm for computinglogarithms over GF(p) and its cryptographic significance(Corresp.),” IEEE Trans. Inf. Theor., vol. 24, no. 1, pp. 106–110, 2006

N. Mohammed, B. C. M. Fung, P. C. K. Hung, and C. Lee,“Centralized and distributed anonymization for high-dimensionalhealthcare data,” ACM Trans. on Knowl. Discovery from Data, vol. 4,no. 4, pp. 18:1–18:33, October 2010

S. Zhong, Z. Yang, and R. N. Wright, “Privacy-enhancing kanonymizationof customer data,” in PODS ’05: Proc. of the24th ACM SIGMOD-SIGACT-SIGART Symposium on Principles ofDatabase Systems, 2005, pp. 139–147.

R. Burke, B. Mobasher, R. Zabicki, and R. Bhaumik, “Identifyingattack models for secure recommendation,” in Beyond Personalization:A Workshop on the Next Generation of Recommender Systems,2005.

G. Cormode, D. Srivastava, N. Li, and T. Li, “Minimizing minimalityand maximizing utility: analyzing method-based attackson anonymized data,” Proc. VLDB Endow., vol. 3, Sept. 2010

S. Goryczka, L. Xiong, and B. C. M. Fung, “m-Privacy for collaborativedata publishing,” in Proc. of the 7th Intl. Conf. on CollaborativeComputing: Networking, Applications and Worksharing, 2011.

N. Mohammed, B. C. M. Fung, K. Wang, and P. C. K. Hung,“Privacy-preserving data mashup,” in Proc. of the 12th Intl. Conf.on Extending Database Technology, 2009, pp. 228–239.

M. Burkhart, M. Strasser, D. Many, and X. Dimitropoulos, “Sepia:Privacy-preserving aggregation of multi-domain network eventsand statistics,” in USENIX Security Symposiun. USENIX, 2010.

J. Vaidya and C. Clifton, “Secure set intersection cardinality withapplication to association rule mining,” J. Comput. Secur., vol. 13,pp. 593–622, July 2005.

S. Goryczka, L. Xiong, and B. C. M. Fung, “m-Privacy for collaborativedata publishing,” in Proc. of the 7th Intl. Conf. on CollaborativeComputing: Networking, Applications and Worksharing, 2011.

P. Jurczyk and L. Xiong, “Distributed anonymization: Achievingprivacy for both data subjects and data providers,” in DBSec, 2009,pp. 191–207

Y. Lindell and B. Pinkas, “Secure multiparty computation forprivacy-preserving data mining,” The Journal of Privacy and Confidentiality,vol. 1, no. 1, pp. 59–98, 2009.

W. Jiang and C. Clifton, “A secure distributed framework forachieving k-anonymity,” The VLDB Journal Special Issue on Privacy-Preserving Data Management, vol. 15, no. 4, pp. 316–333, 2006.

“m-Privacy for Collaborative Data Publishing”, Slawomir Goryczka, Li Xiong, and Benjamin C. M. Fung, 2013.


Full Text: PDF

Refbacks

  • There are currently no refbacks.




Copyright © 2012 - 2021, All rights reserved.| ijitr.com

Creative Commons License
International Journal of Innovative Technology and Research is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJITR , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.