Frothy Privacy-Preserving and Safe Fax Procedure for Cross Ad Hoc Wireless Networks

	International Journal of P2P Network Trends and Technology (IJPTT)
	© 2016 by IJPTT Journal
	Volume - 6 Issue - 1
	Year of Publication : 2016
	Authors : S.Jagadeesan, C.Ramya
	DOI :  10.14445/22492615/IJPTT-V23P402

Citation

S.Jagadeesan, C.Ramya "Frothy Privacy-Preserving and Safe Fax Procedure for Cross Ad Hoc Wireless Networks". International Journal of P2P Network Trends and Technology (IJPTT), V6(1):20-30 Jan - Feb 2016, ISSN:2249-2615, www.ijpttjournal.org, Published by Seventh Sense Research Group.

Abstract

We planfrothyprocedure for gettingfax and preserving users’ anonymity and location privacy in cross ad hoc networks. Symmetric-keycryptography plus and expense system are used to safe route find and data transmission. To reduce the overhead, the expense can be safed without submitting or processing expense proofs (receipts). To preserve users’ anonymity with low overhead, we develop efficient pseudonym generation and trapdoor skills that do not use the resource-consuming asymmetric-key cryptography. Pseudonyms do not require large storage area or frequently contacting a central unit for refilling. Our trapdoor technique uses only frothy hashing plus. This is important because trapdoors may be processed by a large number of nodes. Developing low-overhead safe and privacypreserving procedure is a real challenge due to the inherent contradictions: 1) getting the procedure requires each node to use one real identity, but a permanent identity should not be used for privacy preservation; and 2) the low overhead requirement contradicts with the large overhead frequently needed for preserving privacy and getting the fax. Our analysis and simulation results demonstrate that our procedure can preserve privacy and safe the fax with low overhead.

References

[1] M. Mahmoud and X. Shen, ‘‘FESCIM: Fair, Efficient, Safe Cooperation Incentive Mechanism for Cross Ad Hoc Networks,’’ IEEE Trans. Mobile Computer, vol. 11, no. 5, pp. 753-766, May 2012.
[2] M. Mahmoud and X. Shen, ‘‘Frothy Privacy-Preserving Routing and Incentive Procedure for Cross Ad Hoc Wireless Networks,’’ in Proc. IEEE INFOCOM’11-Int’l Workshop Security Computers, Networking Comm. (SCNC), Shanghai, China, Apr. 2011, pp. 1006-1011.
[3] M. Mahmoud and X. Shen, ‘‘Anonymous and Real Routing in Multi-Hop Cellular Networks,’’ in Proc. IEEE Int’l Conf. Comm. (IEEE ICC’09), Dresden, Germany, June 2009, pp. 839-844.
[4] N. Salem, L. Buttyan, J. Hubaux, and M. Jakobsson, ‘‘Node Cooperation in Cross Ad Hoc Networks,’’ IEEE Trans. on Mobile Computing, vol. 5, no. 4, pp. 365-376, Apr. 2006.
[5] M. Mahmoud and X. Shen, ‘‘ESIP: Safe Incentive Procedure with Limited Use of Public-Key Cryptography for Multi-Hop Wireless Networks,’’ IEEE Trans. on Mobile Computing, vol. 10, no. 7 , pp. 997-1010, July 2011.
[6] M. Mahmoud and X. Shen, ‘‘PIS: A Practical Incentive System for Multihop Wireless Networks,’’ IEEE Trans. on Vehicle Technology, vol. 59, no. 8, pp. 4012-4025, Oct. 2010.
[7] M. Mahmoud and X. Shen, ‘‘Stimulating Cooperation in MultiHop Wireless Networks Using Cheating Detection System,’’ in Proc. IEEE Conf. Information Comm. (IEEE INFOCOM’10), San Diego, CA, USA, Mar. 2010, pp. 776- 784.
[8] S. Capkun, J.P. Hubaux, and M. Jakobsson, ‘‘Safe and PrivacyPreserving Fax in Cross Ad Hoc Networks,’’ EPFLDI- ICA, Laussane, Switzerland, Tech. Rep. IC/2004/10, 2004.
[9] J. Kong, X. Hong, and M. Gerla, ‘‘An Identity-Free and OnDemand Routing Scheme Against Anonymity Threats in Mobile Ad Hoc Networks,’’ IEEE Trans. on Mobile Computing, vol. 6 , no. 8, pp. 888-902, Aug. 2007.
[10] M. Mahmoud and X. Shen, ‘‘MYRPA: An Incentive System with Reduced Receipts for Multi-Hop Wireless Networks,’’ in Proc. IEEE Vehicular Technology Conf. (IEEE VTC’10- Fall), Ottawa, ON, Canada, Sept. 2010, pp. 1-5.
[11] M. Mahmoud and X. Shen, ‘‘Safe and Efficient Source Location Privacy-Preserving Scheme for Wireless Sensor Networks,’’ in Proc. IEEE Int’l Conf. Comm. (IEEE ICC’12), Ottawa, Canada, June 10-15, 2012.
[12] K. Ren, S. Yu, W. Lou, and Y. Zhang, ‘‘PEACE: A Novel PrivacyEnhanced Yet Accountable Security Framework for Metropolitan Wireless Mesh Networks,’’ IEEE Trans. on Parallel Distributed Systems, vol. 21, no. 2, pp. 203-215, Feb. 2010.
[13] K. Ren and W. Lou, ‘‘A Sophisticated Privacy-Enhanced Yet Accountable Security Framework for Wireless Mesh Networks,’’ in Proc. IEEE ICDCS, Beijing, China, June 2008, pp. 286-294.
[14] M. Mahmoud and X. Shen, ‘‘Cloud-Based Scheme for Protecting Source Location Privacy Against Hotspot- Locating Attack in Wireless Sensor Networks,’’ IEEE Trans. on Parallel Distributed Systems, vol. 23, no. 10, pp. 1805- 1818, Oct. 2012.
[15] Y. Zhang, W. Liu, W. Lou, and Y. Fang, ‘‘Getting Mobile Ad Hoc Networks with Certificateless Public Keys,’’ IEEE Trans. on Dependable Safe Computing, vol. 3, no. 4, pp. 386- 399, Oct./Dec. 2006.
[16] S. Yi, P. Naldurg, and R. Kravets, ‘‘Security-Aware Ad Hoc Routing for Wireless Networks,’’ in Proc. 2nd ACM Symp. MobiHoc Networking Computing, Long Beach, CA, USA, Oct. 2001, pp. 299-302.
[17] Y.-C. Hu, A. Perrig, and D. Johnson, ‘‘Ariadne: A Safe OnDemand Routing Procedure for Ad Hoc Networks,’’ in Proc. ACM Conf. MobiCom Computing and Networking, 2002, pp. 12-23.
[18] M. Mahmoud, M. Barua, and X. Shen, ‘‘SATS: Safe DataForwarding Scheme for Delay-Tolerant Wireless Networks,’’ in Proc. IEEE Global Comm. Conf. (IEEE GLOBECOM’11), Houston, TX, USA, Dec. 2011, pp. 1-5.
[19] A.J. Menezes, P. van Oorschot, and S. Vanstone, Handbook of Applied Cryptography. Boca Raton, FL, USA: CRC Press, 1996.
[20] C. DNaz, S. Seys, J. Claessens, and B. Preneel, ‘‘Towards Measuring Anonymity,’’ in Proc. Privacy Enhancing Technologies Workshop(PET’02),LNCS2482,R.DingledineandP.Syverson, Eds., Apr. 2002, pp. 54-68.
[21] J. Kong and X. Hong, ‘‘ANODR: Anonymous on Demand Routing with Untraceable Routes for Mobile Ad-Hoc Networks,’’ in Proc. MobiHoc, 2003, pp. 291-302.
[22] W. Dai, Crypto++ Library 5.6.0. [Online]. Available: http://www. cryptopp.com/.
[23] Recommendation for Key ManagementVPart 1: General (Revised), NationalInstitute ofStandards and Technology ( NIST),Washington, DC, USA, 2007, Special Publication 800-57 200.
[24] Boukerche, K. El-Khatib, L. Korba, and L. Xu, ‘‘A Safe Distributed Anonymous Routing Procedure for Ad Hoc Wireless Networks,’’ J. Comput. Commun., vol. 28, no. 10, pp. 1193-1203 , 2005.

Keywords
Our analysis and simulation results demonstrate that our procedure can preserve privacy and safe the fax with low overhead.