Weitere Kapitel dieses Buchs durch Wischen aufrufen
In vertically partitioned distributed databases, the data will be distributed over multiple sites. To publish such data for research or business applications, data may be collected at one site and published data to the needy. Publishing data in many fields like banking, medical, political, research, etc., by preserving one’s privacy is very important. Apart from preserving privacy, anonymity of the publisher must be preserved. To achieve these objectives in this paper, multidimensional k-anonymity with onion routing and mix-network methods are proposed to preserve privacy and to provide anonymous communication. Mix-net is a multistage system which accepts quantities of data on input batch and produces cryptographically transformed data through output batch. Output batch is a permutation of the transformed input batch, to achieve untraceability between the input and output batches. Mix-net can change the appearance and random reordering which prevents trace back. In onion routing encryption, data is encapsulated in layers of encryption, which is analogous to layers of onion. The data is being sent to transmit inside the several layers of encryption. The final node or exit node in the chain is to decrypt and deliver the data to the recipient by applying multidimensional k-anonymity on collected data.
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten
Sie möchten Zugang zu diesem Inhalt erhalten? Dann informieren Sie sich jetzt über unsere Produkte:
G kountouna, Olga, “A Survey on Privacy Preservation Methods.”, Technical Report, Knowledge and Database Systems Laboratory, NTUA, 2011, SECE, Knowledge and Data Base Management Laboratory (DBLAB), pp: 1–30, 2011.
Chaum, David, “The dining cryptographers problem: Unconditional sender and recipient untraceability.” Journal of cryptology 1.1, pp: 65–75, 1988.
Sweeney, Latanya. “K-anonymity: A model for protecting privacy.”, International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 10.05 pp: 557–570, 2002.
Machanavajjhala, Ashwin, et al., “l-diversity: Privacy beyond k-anonymity.”, ACM Transactions on Knowledge Discovery from Data (TKDD) 1.1, 2007.
Li, Ninghui, Tiancheng Li, and Suresh Venkatasubramanian., “t-closeness: Privacy beyond k-anonymity and l-diversity.”, Data Engineering, 2007. ICDE 2007. IEEE 23rd International Conference on. IEEE, 2007.
Terrovitis, Manolis, Nikos Mamoulis, and Panos Kalnis., “Privacy-preserving anonymization of set-valued data.”, Proceedings of the VLDB Endowment 1.1 (2008): pp: 115–125.
R. C.W. Wong, J. Li, A. W.-C. Fu, and Ke Wang., “(α, k)-anonymity: an enhanced k-anonymity model for privacy-preserving data publishing”, In Proceedings of the ACM KDD, pp: 754–759, New York, 2006.
Alina Campan, Traian Marius Truta, Nicholas Cooper, “P‐Sensitive K‐Anonymity with Generalization Constraints”, Transactions On Data Privacy 3, pp: 65—89, 2010.
Wong, Raymond Chi-Wing, et al., “(α, k)-anonymity: an enhanced k-anonymity model for privacy preserving data publishing.”, Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 2006.
Xiao, Xiaokui, and Yufei Tao., “M-invariance: towards privacy preserving re-publication of dynamic datasets.,” Proceedings of the 2007 ACM SIGMOD international conference on Management of data. ACM, 2007.
LeFevre, Kristen, David J. DeWitt, and Raghu Ramakrishnan., “Mondrian multidimensional k-anonymity.”, Data Engineering, 2006. ICDE’06. Proceedings of the 22nd International Conference on. IEEE, 2006.
Xiong, Li, et al., “Privacy preserving information discovery on ehrs.”, Information Discovery on Electronic Health Records (2008): pp: 197–225.
Jiang, Wei, and Chris Clifton., “Privacy-preserving distributed k-anonymity.”, Data and Applications Security XIX. Springer Berlin Heidelberg, 2005. pp: 166–177.
LeFevre, Kristen, David J. DeWitt, and Raghu Ramakrishnan., “Incognito: Efficient full-domain k-anonymity.”, Proceedings of the 2005 ACM SIGMOD international conference on Management of data. ACM, 2005.
Bayardo, Roberto J., and Rakesh Agrawal., “Data privacy through optimal k-anonymization.”, Data Engineering, 2005. ICDE 2005. Proceedings. 21st International Conference on. IEEE, 2005.
Srinivas R., and A. Raga Deepthi. “Hierarchical Model for Preserving Privacy in Horizontally Partitioned Databases.” Age 15: 35. IJETTCS, Volume 2, Feb 2013.
Srinivas R., K. PRASADA RAO, and V. SREE REKHA., “Preserving Privacy in Horizontally Partitioned Databases Using Hierarchical Model.”, IOSR Journal of Engineering May 2.5 (2012): pp: 1091–1094.
Chaum, David L. “Untraceable electronic mail, return addresses, and digital pseudonyms.” Communications of the ACM 24.2 (1981): 84–90.
Chaum, David. “Untraceable electronic mail, return addresses and digital pseudonyms.” Secure electronic voting. Springer US, 2003. 211–219.
Danezis, George. “Mix-networks with restricted routes.” Privacy Enhancing Technologies. Springer Berlin Heidelberg, 2003.
Abe, Masayuki. “Mix-networks on permutation networks.” Advances in cryptology-ASIACRYPT’99. Springer Berlin Heidelberg, 1999. 258–273.
Sampigethaya, Krishna, and Radha Poovendran. “A survey on mix networks and their secure applications.” Proceedings of the IEEE 94.12 (2006): 2142–2181.
Srinivas, R., A. Yesu Babu, and Ssaist Surampalem. “Mixnet for Anonymous Communication to Preserving Privacy in Hierarchical model networks”.
Demirel, Denise, Hugo Jonker, and Melanie Volkamer. “Random block verification: Improving the norwegian electoral mix-net.” Electronic Voting. 2012.
Dingledine, Roger, Nick Mathewson, and Paul Syverson. Tor: The second-generation onion router. Naval Research Lab Washington DC, 2004.
Goldschlag, David, Michael Reed, and Paul Syverson. “Onion routing.” Communications of the ACM 42.2 (1999): 39–41.
Reed, Michael G., Paul F. Syverson, and avid M. Goldschlag. “Anonymous connections and onion routing.” Selected Areas in Communications, IEEE Journal on 16.4 (1998): 482–494.
Syverson, Paul F., David M. Goldschlag, and Michael G. Reed. “Anonymous connections and onion routing.” Security and Privacy, 1997. Proceedings., 1997 IEEE Symposium on. IEEE, 1997.
Syverson, Paul, et al. “Towards an analysis of onion routing security.” Designing Privacy Enhancing Technologies. Springer Berlin Heidelberg, 2001.
R. Srinivas, et al. “Preserving Privacy in Vertically Partitioned Distributed Data using Hierarchical and Ring Models.”, in Joint International Conference on Artificial Intelligence and Evolutionary Computations in Engineering Systems (ICAIECES-2016) at SRM University, Kattankulathur, Chennai, India, during 19–21 st May 2016.
- Publishing Personal Information by Preserving Privacy in Vertically Partitioned Distributed Databases
K. A. Sireesha
- Springer Singapore
Neuer Inhalt/© ITandMEDIA