ACM Home Page
Please provide us with feedback. Feedback
Mobile traffic sensor network versus motion-MIX: tracing and protecting mobile wireless nodes
Full text PdfPdf (375 KB)
Source Workshop on Security of ad hoc and Sensor Networks archive
Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks table of contents
Alexandria, VA, USA
SESSION: Sensor networks (work in progress) table of contents
Pages: 97 - 106  
Year of Publication: 2005
ISBN:1-59593-227-5
Authors
Jiejun Kong  University of California, Los Angeles, CA
Dapeng Wu  University of Florida, Gainesville, FL
Xiaoyan Hong  University of Alabama, Tuscaloosa, AL
Mario Gerla  University of California, Los Angeles, CA
Sponsors
ACM: Association for Computing Machinery
SIGSAC: ACM Special Interest Group on Security, Audit, and Control
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 104,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1102219.1102237
What is a DOI?

ABSTRACT

In this paper we focus on passive attacks that threaten the privacy of mobile wireless networks. We define the concept of "venue privacy attack" (VPA) to illustrate the emerging anonymity attacks to trace mobile wireless nodes. Then we propose "motion-MIX" as the countermeasure to defend against various venue privacy attacks. We study the necessary conditions to implement motion-MIXes. These conditions include identity-free routing, one-time packet content and various other concerns in the network protocol stack. Then we use a new asymptotic security model to verify motion-MIX's effectiveness against venue privacy attacks. In a scalable ad hoc network, we prove that the probability of security breach is negligible (aka. sub-polynomial) with respect to the polynomial-bounded network scale (i.e., number of node in the network). This notion is conforming to the existing security notions in computational cryptography, where the polynomial-bounded metric is key length.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
A. R. Beresford. Location Privacy in Ubiquitous Computing. PhD thesis, University of Cambridge, November 2004.
 
3
 
4
 
5
 
6
 
7
8
9
 
10
 
11
N. Cressie. Statistics for Spatial Data. John Wiley and Sons, 1993.
 
12
W. Dai. PipeNet 1.1. http://www.eskimo.com/~weidai/pipenet.txt, 1996.
 
13
 
14
C. Díaz, S. Seys, J. Claessens, and B. Preneel. Towards measuring anonymity. In R. Dingledine and P. Syverson, editors, Proceedings of Privacy Enhancing Technologies Workshop (PET 2002), Lecture Notes in Computer Science 2482, pages 54--68, 2002.
15
16
 
17
M. Gruteser and D. Grunwald. Anonymous Usage of Location-Based Services Through Spatial and Temporal Cloaking. In MobiSys03, 2003.
 
18
Y.-C. Hu and H. J. Wang. A Framework for Location Privacy in Wireless Networks. In ACM SIGCOMM Asia Workshop, 2005.
 
19
L. Huang, K. Matsuura, H. Yamane, and K. Sezaki. Enhancing Wireless Location Privacy Using Silent Period. In IEEE WCNC, 2005.
 
20
L. Huang, H. Yamane, K. Matsuura, and K. Sezaki. Towards Modeling Wireless Location Privacy. In Workshop on Privacy Enhancing Technologies (PET), 2005.
 
21
P. G. Ifju, S. M. Ettinger, D. Jenkins, Y. Lian, W. Shyy, and M. Waszak. Flexible-wing-based Micro Air Vehicles. In 40th AIAA Aerospace Sciences Meeting, 2002.
 
22
 
23
J. Kong. Formal Notions of Anonymity for Peer-to-peer Networks. Technical Report Report 2005/132, IACR Cryptology ePrint Archive, May 2005. Also CSD-TR050014, Department of Computer Science, UCLA.
24
25
 
26
27
28
 
29
C. E. Perkins, E. M. Royer, and S. Das. Ad-hoc On Demand Distance Vector (AODV) Routing. http://www.ietf.org/rfc/rfc3561.txt, July 2003.
 
30
 
31
 
32
33
 
34
M. G. Reed, P. F. Syverson, and D. M. Goldschlag. Anonymous Connections and Onion Routing. IEEE Journal on Selected Areas in Communications, 16(4), 1998.
35
36
37
 
38
A. Serjantov and G. Danezis. Towards an Information Theoretic Metric for Anonymity. In R. Dingledine and P. Syverson, editors, Proceedings of Privacy Enhancing Technologies Workshop (PET 2002), Lecture Notes in Computer Science 2482, pages 41--53, 2002.
 
39
A. Serjantov and R. E. Newman. On the Anonymity of Timed Pool Mixes. In Workshop on Privacy and Anonymity Issues in Networked and Distributed Systems, pages 427--434, 2003.
 
40
C. E. Shannon. Communication Theory of Secrecy Systems. Bell System Technical Journal, 28(4):656--715, 1949.
41
 
42
43
 
44
M. Wright, M. Adler, B. N. Levine, and C. Shields. An Analysis of the Degradation of Anonymous Protocols. In Network and Distributed Security Symposium - NDSS '02, 2002.
45
 
46
Y. Zhang, W. Liu, and W. Lou. Anonymous Communications in Mobile Ad Hoc Networks. In IEEE INFOCOM, 2005.


Collaborative Colleagues:
Jiejun Kong: colleagues
Dapeng Wu: colleagues
Xiaoyan Hong: colleagues
Mario Gerla: colleagues