NOTES ON PRIVACY-PRESERVING DISTRIBUTED MINING AND HAMILTONIAN CYCLES

Renren Dong, Ray kresman

Abstract

Distributed storage and retrieval of data is both the norm and a necessity in today’s computing environment. However, sharing and dissemination of this data is subject to privacy concerns. This paper addresses the role of graph theory, especially Hamiltonian cycles, on privacy preserving algorithms for mining distributed data. We propose a new heuristic algorithm for discovering disjoint Hamiltonian cycles in the underlying network. Disjoint Hamiltonian cycles are useful in a number of applications; for example, to ensure that someone’s private data remains private even when others collude to discover the data.

References

  1. Alspach, B., Bermond, J., and Sotteau, D. (1990). Decomposition into cycles 1: Hamilton decompositions. Cycles and Rays, page 9.
  2. Andrew, C. (1986). How to generate and exchange secrets. In Proc. of the 27th IEEE Symposium on Foundations of Computer Science, pages 162-167.
  3. Bae, M. and Bose, B. (2003). Edge disjoint Hamiltonian cycles in k-ary n-cubes and hypercubes. IEEE Transactions on Computers, 52(10):1271-1284.
  4. Baiardi, F., Falleni, A., Granchi, R., Martinelli, F., Petrocchi, M., and Vaccarelli, A. (2005). SEAS, a secure e-voting protocol: design and implementation. Computers & Security, 24(8):642-652.
  5. Bottcher, S. and Obermeier, S. (2008). Secure set union and bag union computation for guaranteeing anonymity of distrustful participants. Journal of Software, 3(1):9.
  6. Chaum, D. (1988). The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology, 1(1):65-75.
  7. Clifton, C., Vaidya, J., Kantarcioglu, M., Lin, X., and Zhu, M. Y. (2002). Tools for privacy preserving distributed data mining. SIGKDD Explor. Newsl., 4(2):28-34.
  8. Dong, R. and Kresman, R. (2009). Indirect disclosures in data mining. In Frontier of Computer Science and Technology, Japan-China Joint Workshop, pages 346- 350, Shanghai, China. IEEE Computer Society.
  9. Dong, R. and Kresman, R. (2010). Proof of certain properties of edge disjoint Hamiltonian cycles. Under preparation.
  10. Garey, M., Johnson, D., et al. (1979). Computers and Intractability: A Guide to the Theory of NPcompleteness. W.H. freeman San Francisco.
  11. Han, J. and Kamber, M. (2006). Data Mining: Concepts and Techniques. Morgan Kaufmann.
  12. Pullan, W. and Hoos, H. (2006). Dynamic local search for the maximum clique problem. Journal of Artificial Intelligence Research, 25:159-185.
  13. Schneier, B. (2007). Applied cryptography: protocols, algorithms, and source code in C. A1bazaar.
  14. Shepard, S. (2007). Anonymous Opt-Out and Secure Computation in Data Mining. Master's thesis, Bowling Green State University, Bowling Green, OH, USA.
  15. Stewart, I. (2007). Distributed algorithms for building Hamiltonian cycles in k-ary n-cubes and hypercubes with faulty links. Journal of Interconnection Networks, 8(3):253.
  16. Urabe, S., Wang, J., Kodama, E., and Takata, T. (2007a). A high collusion-resistant approach to distributed privacy-preserving data mining. IPSJ Digital Courier, 3(0):442-455.
  17. Urabe, S., Wong, J., Kodama, E., and Takata, T. (2007b). A high collusion-resistant approach to distributed privacy-preserving data mining. In Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks, page 331. ACTA Press.
  18. Verykios, V. S., Bertino, E., Fovino, I. N., Provenza, L. P., Saygin, Y., and Theodoridis, Y. (2004). State-of-theart in privacy preserving data mining. SIGMOD Rec., 33(1):50-57.
Download


Paper Citation


in Harvard Style

Dong R. and kresman R. (2010). NOTES ON PRIVACY-PRESERVING DISTRIBUTED MINING AND HAMILTONIAN CYCLES . In Proceedings of the 5th International Conference on Software and Data Technologies - Volume 1: ICSOFT, ISBN 978-989-8425-22-5, pages 103-107. DOI: 10.5220/0002922001030107


in Bibtex Style

@conference{icsoft10,
author={Renren Dong and Ray kresman},
title={NOTES ON PRIVACY-PRESERVING DISTRIBUTED MINING AND HAMILTONIAN CYCLES},
booktitle={Proceedings of the 5th International Conference on Software and Data Technologies - Volume 1: ICSOFT,},
year={2010},
pages={103-107},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002922001030107},
isbn={978-989-8425-22-5},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 5th International Conference on Software and Data Technologies - Volume 1: ICSOFT,
TI - NOTES ON PRIVACY-PRESERVING DISTRIBUTED MINING AND HAMILTONIAN CYCLES
SN - 978-989-8425-22-5
AU - Dong R.
AU - kresman R.
PY - 2010
SP - 103
EP - 107
DO - 10.5220/0002922001030107