Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014, Article ID 637985, 12 pages
http://dx.doi.org/10.1155/2014/637985
Research Article

An Authenticated Privacy-Preserving Mobile Matchmaking Protocol Based on Social Connections with Friendship Ownership

Department of Electrical Engineering, School of Electrical and Computer Engineering, College of Engineering, Chang Gung University, 259 Wen-Hwa 1st Road, Kwei-Shan, Tao-Yuan 333, Taiwan

Received 28 May 2013; Revised 29 October 2013; Accepted 30 October 2013; Published 16 February 2014

Academic Editor: Wang Xing-yuan

Copyright © 2014 Shin-Yan Chiou and Chi-Shiu Luo. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. M. Rabin, “How to exchange secrets by oblivious transfer,” Tech. Rep. TR-81, Harvard Aiken Computation Laboratory, 1981. View at Google Scholar
  2. A. Shamir, “Identity-based cryptosystems and signature schemes,” in Advances in Cryptology, pp. 47–53, Springer, Berlin, Germany, 1985. View at Publisher · View at Google Scholar · View at MathSciNet
  3. J. Camenisch, M. Kohlweiss, A. Rial, and C. Sheedy, “Blind and anonymous identity-based encryption and authorised private searches on public key encrypted data,” in Public Key Cryptography—PKC 2009, pp. 196–214, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. H. Lin, S. S. M. Chow, D. Xing, Y. Fang, and Z. Cao, “Privacy-preserving friend search over online social networks,” Cryptology EPrint Archive 2011/445, 2011, http://eprint.iacr.org/. View at Google Scholar
  5. J. Sun, X. Zhu, and Y. Fang, “A privacy-preserving scheme for online social networks with efficient revocation,” in Proceedings of the IEEE Conference on Computer Communications (INFOCOM '10), pp. 1–9, March 2010. View at Publisher · View at Google Scholar · View at Scopus
  6. A. Pietiläinen, E. Oliver, J. LeBrun, G. Varghese, and C. Diot, “Mobiclique: middleware formobile social networking,” in Proceedings of the 2nd ACM Workshop on Online Socialnetworks, pp. 49–54, ACM, 2009. View at Publisher · View at Google Scholar
  7. Q. Xie and U. Hengartner, “Privacy-preserving matchmaking for mobile social networking secure against malicious users,” in Proceedings of the 9th Annual International Conference on Privacy, Security and Trust (PST '11), pp. 252–259, IEEE, July 2011. View at Publisher · View at Google Scholar · View at Scopus
  8. L. A. Cutillo, R. Molva, and T. Strufe, “Privacy preserving social networking through decentralization,” in Proceedins of the 6th International Conference on Wireless On-demand Network Systems and Services (WONS '09), pp. 145–152, IEEE, February 2009. View at Publisher · View at Google Scholar · View at Scopus
  9. X. Wang, D. Zhang, and X. Guo, “Authentication and recovery of images using standard deviation,” Journal of Electronic Imaging, vol. 22, no. 3, Article ID 033012, 2013. View at Google Scholar
  10. N. M. G. Al-Saidi, M. R. Md. Said, and W. A. M. Othman, “Password authentication based on fractal coding scheme,” Journal of Applied Mathematics, vol. 2012, Article ID 340861, 16 pages, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. S. G. Yoo, K. Y. Park, and J. Kim, “A security-performance-balanced user authentication scheme for wireless sensor networks,” International Journal of Distributed Sensor Networks, vol. 2012, Article ID 382810, 11 pages, 2012. View at Publisher · View at Google Scholar
  12. D. Xiao, X. Liao, and S. Deng, “A novel key agreement protocol based on chaotic maps,” Information Sciences, vol. 177, no. 4, pp. 1136–1142, 2007. View at Publisher · View at Google Scholar · View at MathSciNet
  13. S. Han, “Security of a key agreement protocol based on chaotic maps,” Chaos, Solitons & Fractals, vol. 38, no. 3, pp. 764–768, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. E. Chang and S. Han, “Using passphrase to construct key agreement. cbs-is,” Tech. Rep., Curtin University of Technology, 2006. View at Google Scholar
  15. S. Han and E. Chang, “Chaotic map based key agreement with/out clock synchronization,” Chaos, Solitons & Fractals, vol. 39, no. 3, pp. 1283–1289, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  16. X.-Y. Wang and J.-F. Zhao, “Cryptanalysis on a parallel keyed hash function based on chaotic neural network,” Neurocomputing, vol. 73, no. 16–18, pp. 3224–3228, 2010. View at Publisher · View at Google Scholar · View at Scopus
  17. W. Diffie and M. E. Hellman, “New directions in cryptography,” IEEE Transactions on Information Theory, vol. 22, no. 6, pp. 644–654, 1976. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  18. C. Wang and J. Luo, “An efficient key-policy attribute-based encryption scheme with constant ciphertext length,” Mathematical Problems in Engineering, vol. 2013, Article ID 810969, 7 pages, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  19. X. Wang and J. Zhao, “An improved key agreement protocol based on chaos,” Communications in Nonlinear Science and Numerical Simulation, vol. 15, no. 12, pp. 4052–4057, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  20. X.-Y. Wang and Y.-F. Gao, “A switch-modulated method for chaos digital secure communication based on user-defined protocol,” Communications in Nonlinear Science and Numerical Simulation, vol. 15, no. 1, pp. 99–104, 2010. View at Publisher · View at Google Scholar · View at Scopus
  21. X. Wang, B. Xu, and C. Luo, “An asynchronous communication system based on the hyperchaotic system of 6th-order cellular neural network,” Optics Communications, vol. 285, pp. 5041–5045, 2012. View at Google Scholar
  22. M.-J. Wang, X.-Y. Wang, and B.-N. Pei, “A new digital communication scheme based on chaotic modulation,” Nonlinear Dynamics, vol. 67, no. 2, pp. 1097–1104, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  23. H. Liu, X. Wang, and Q. Zhu, “Asynchronous anti-noise hyper chaotic secure communication system based on dynamic delay and state variables switching,” Physics Letters A, vol. 375, no. 30-31, pp. 2828–2835, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  24. S. Y. Chiou, “Secure method for biometric-based recognition with integrated cryptographic functions,” BioMed Research International, vol. 2013, Article ID 623815, 12 pages, 2013. View at Publisher · View at Google Scholar
  25. Y. Niu and X. Wang, “An anonymous key agreement protocol based on chaotic maps,” Communications in Nonlinear Science and Numerical Simulation, vol. 16, no. 4, pp. 1986–1992, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  26. S.-Y. Chiou, “Authenticated blind issuing of symmetric keys for mobile access control system without trusted parties,” Mathematical Problems in Engineering, vol. 2013, Article ID 858579, 11 pages, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  27. Meet Gatsby, “2011 meet gatsby,” March 2011, http://meetgatsby.com/.
  28. Loopt, “loopt,” March 2011, http://en.wikipedia.org/wiki/Loopt.
  29. M. Li, N. Cao, S. Yu, and W. Lou, “FindU: privacy-preserving personal profile matching in mobile social networks,” in Proceedings of the IEEE International Conference on Computer Communications (INFOCOM '11), pp. 2435–2443, IEEE, April 2011. View at Publisher · View at Google Scholar · View at Scopus
  30. R. Agrawal, A. Evfimievski, and R. Srikant, “Information sharing across private databases,” in Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 86–97, ACM, San Diego, Calif, USA, June 2003. View at Scopus
  31. Y. Wang, T. T. Zhang, H. Z. Li, L. P. He, and J. Peng, “Efficient privacy preserving matchmaking for mobile social networking against malicious users,” in Proceedings of the IEEE 11th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom '12), pp. 609–615, IEEE, 2012.
  32. S. Y. Chiou and Y. H. Huang, “Mobile common friends discovery with friendship ownership and replay-attack resistance,” Wireless Networks, vol. 19, no. 8, pp. 1839–1850, 2013. View at Publisher · View at Google Scholar
  33. S.-Y. Chiou, S.-Y. Chang, and H.-M. Sun, “Common friends discovery with privacy and authenticity,” in Proceedings of the 5th International Conference on Information Assurance and Security (IAS '09), vol. 1, pp. 337–340, IEEE, September 2009. View at Publisher · View at Google Scholar · View at Scopus
  34. Wikipedia, “Wi-Fi Direct,” 2012, http://en.wikipedia.org/wiki/Wi-FiDirect/.
  35. Bluetooth specification, “Bluetooth specification,” 2012,http://www.bluetooth.com/.
  36. C. Bisdikian, “An overview of the Bluetooth wireless technology,” IEEE Communications Magazine, vol. 39, no. 12, pp. 86–94, 2001. View at Publisher · View at Google Scholar · View at Scopus
  37. Specification, “Infrared Data Association (IrDA) Std,” 1998.
  38. M. J. Freedman, K. Nissim, and B. Pinkas, “Efficient private matching and set intersection,” in Advances in Cryptology, Lecture Notes in Computer Science, pp. 1–19, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  39. Y. Li, J. D. Tygar, and J. M. Hellerstein, Computer Security in the 21st Century, chapter 3, Springer, New York, NY, USA, 2005.
  40. Wikipedia, “Replay attack,” October 2012, http://en.wikipedia.org/wiki/Replay_attack/.
  41. P. Paillier, “Public-key cryptosystems based on composite degree residuosity classes,” in Advances in Cryptology, vol. 1592 of Lecture Notes in Computer Science, pp. 223–238, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  42. L. Kissner and D. Song, “Privacy-preserving set operations,” in Advances in Cryptology, vol. 3621 of Lecture Notes in Computer Science, pp. 241–257, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  43. R. L. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” Communications of the Association for Computing Machinery, vol. 21, no. 2, pp. 120–126, 1978. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  44. N. Koblitz, A. Menezes, and S. Vanstone, “The state of elliptic curve cryptography,” Designs, Codes and Cryptography, vol. 19, no. 2-3, pp. 173–193, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  45. N. Standard, “Federal Information Processing Standards Publication 180-1,” US Department of Commerce, National Institute of Standards and Technology 131.
  46. R. Rivest, RFC1321: The MD5 Message-Digest Algorithm, RFC Editor United States.
  47. K. Scarfone and J. Padgette, Guide To bluetooth Security, NIST Special Publication, 2008.