Design of a mix network using connectivity index - A novel privacy enhancement approach

Proceedings - 2014 IEEE 28th International Conference on Advanced Information Networking and Applications Workshops, IEEE WAINA 2014

Volumn , Issue , 2014, Pages 512-517

  Ma, Rajan ^a   Rath, Hemant Kuamr ^b   Balamuralidhar, P ^a  

^a TATA CONSULTANCY SERVICES   (India)

^b TCS Innovation Lab   (India)

Author keywords

Anonymity; Connectivity Index; Mix; Mix Network; Privacy

Indexed keywords

DATA PRIVACY; MIXING;

ANONYMITY; COMMUNICATION PRIVACY; CONNECTIVITY INDICES; EMPIRICAL TECHNIQUES; GRAPH THEORETIC APPROACH; MIX NETWORKS; PRIVACY-ENHANCING TECHNIQUES; REAL TIME REQUIREMENT;

GRAPH THEORY;

EID: 84904503811     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WAINA.2014.86     Document Type: Conference Paper

References (16)

1. L. Sweeny, k-Anonymity: A model for protecting privacy, International Journal of Uncertainty, Fuzziness, and Knowledge Based Systems, 10(5) (2002), 557-570.
2. Kuan Lun Huang, Salil S. Kanhere and Wen Hu. Preserving privacy in participatory sensing systems. Journal of Computer Communications, Elsevier, 33, (2010), 1266-1280.
3. David Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2) (1981), 84-88.
4. David Chaum. The dining cryptographers problem: unconditional sender and recipient untraceability. Journal of Cryptology, 1(1), 1988, 65-75.
5. M. K. Reiter and A. D. Rubin. Crowds: Anonymity for Web Transactions. Communications of the ACM, 42(2), (1999), 32-48.
6. C. Diaz, S. Seys, J. Claessens and B. Preneel. Towards measuring anonymity. Proceedings of Privacy Enhancing Technologies Workshop, R. Dingledine and P. Syverson, Eds, Springer-Verlag, LNCS 2482, 2002.
7. A. Serjantov and G. Danezis, Towards an information theoretic metric for anonymity, in Proceedings of Privacy Enhancing Technologies Workshop (PET 2002), R. Dingledine and P. Syverson, Eds. Springer-Verlag, LNCS 2482, 2002.
8. Yuxin Deng, Jun. Pang and Peng Wu. Measuring anonymity with relative entropy. Theodosis Dimitrakos, Fabio Martinelli, Peter Y. A. Ryan, and Steve A. Schneider, editors, Formal Aspects in Security and Trust, Springer, LNCS 4691, (2006), 65-79.
9. Matthew Edman, Fikret Sivrikaya and Bülent Yener A combinatorial approach to measuring anonymity. Intelligence and Security Informatics, IEEE, (2007), 356-363.
10. L. G. Valiant. The complexity of computing the permanent. Theoret. Comput. Sci, (8) (1979), 189-201.
11. M. Randic. Characterization of molecular branching. J. Am. Chem. Soc, 97, (1975), 6609-6615.
12. Bollobàs, P. Erdós, Graphs of extremal weights, Ars Combin, 50, 1998, 225-233.
13. M. A. Rajan, M. Girish Chandra, Lokanatha. C. Reddy, S. Prakash Hiremath, A Study of Connectivity Index of Graph Relevant to Adhoc Networks, IJCSNS, Vol 7, 11, 2007, 198-203.
14. O. Araujo and J. A. dela Pena. The connectivity Index of a weighted graph. Lian. Alg. Appl, 283, (1998), 171-177.
15. X. Li, I. Gutman, Mathematical Aspects of Randić-Type Molecular Structure Descriptors, Mathematical Chemistry Monographs, 1, Kragujevac, 2006. MATCH Commum. Math. Comput. Chem., 51, 2004, 155-166.
16. M. A. Rajan, M. Girish Chandra, Lokanatha. C. Reddy, S. Prakash Hiremath, Topological and Energy Analysis of K-Connected MANETS: A Semi-Analytical Approach, IJCSNS, Vol 8, 2, 2008, 199-207.