We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 November 2024
Call for Paper
December Edition
IJCA solicits high quality original research papers for the upcoming December edition of the journal. The last date of research paper submission is 20 November 2024

Submit your paper
Know more
The week's pick
Responsive image
An Efficient Restoration Method for the Faint Dot Matrix Images

Ao Zhu Peng Cao
Random Articles
Reseach Article

Secure Profile Matching for Portable Public Networks

by M. Ramanjulu, M. Veeresh Babu
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 107 - Number 16
Year of Publication: 2014
Authors: M. Ramanjulu, M. Veeresh Babu
10.5120/18832-0331

M. Ramanjulu, M. Veeresh Babu . Secure Profile Matching for Portable Public Networks. International Journal of Computer Applications. 107, 16 ( December 2014), 1-4. DOI=10.5120/18832-0331

@article{ 10.5120/18832-0331,
author = { M. Ramanjulu, M. Veeresh Babu },
title = { Secure Profile Matching for Portable Public Networks },
journal = { International Journal of Computer Applications },
issue_date = { December 2014 },
volume = { 107 },
number = { 16 },
month = { December },
year = { 2014 },
issn = { 0975-8887 },
pages = { 1-4 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume107/number16/18832-0331/ },
doi = { 10.5120/18832-0331 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:41:11.394360+05:30
%A M. Ramanjulu
%A M. Veeresh Babu
%T Secure Profile Matching for Portable Public Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 107
%N 16
%P 1-4
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In portable public networks creation of the new connection is important service. Where an existing client can discover related users bounded by objects nearness of him/her. In Portable public networks we can provide connection to the best profile matching users only. In general all the peoples frequently fill the information for profile before login in any portable public network. In this paper the existing user can see all the profiles by using search option. Here the problem is the existing user can see the profiles of the unknown users and hack the information. In this paper we proposed the security to the user's profiles by using with malicious model. Here matching profiles will be display but non matching profiles will not display. The problem is even we search the known person profile that profile will not match to yours profile then we cannot see the profile. So to overcome the problem by sending a request to the known user, the user will accept the request then the profile will display.

References
  1. Giles Hogben, ENISA (2007),ENISA Position Paper No. 1 "Security Issues and Recommendations for Online Social Networks"
  2. Elie Raad, Richard Chbeir, and Albert Dipanda," User Profile Matching in Social Networks" in Byourgogne University Dijon, France.
  3. Ralph Gross and Alessandro Acquisti,"Information Revelation and Privacy in Online Social Networks"
  4. Rui Zhang _ , Yanchao Zhang _ , Jinyuan (Stella) Suny, and Guanhua Yanzn, "Fine-grainedPrivate Matching for Proximity-basedMobile Social Networking".
  5. Muyuan Li, Zhaoyu Gao, Suguo Du, Haojin Zhu, Mianxiong Dong, KaoruOta,"PriMatch: Fairness-aware Secure Friend Discovery Protocol in Mobile Social Network".
  6. Q. Ye, H. Wang, and J. Pieprzyk, "Distributed private matching and set perations," in ISPEC'08, 2008.
  7. E. D. Cristofaro and G. Tsudik, "Practical private set intersection protocols with linear complexity," in Financial Cryptography and Data Security '10, 2010.
  8. L. Kissner and D. Song, "Privacy-preserving set operations," in CRYPTO '05, LNCS. Springer, 2005.
  9. A. C. Yao, "Protocols for secure computations," in SFCS82,1982.
  10. D. Dachman-Soled, T. Malkin, M. Raykova, and M. Yung, "Efficient robust private set intersection," in ACNS '09, 2009.
  11. G. S. Narayanan, T. Aishwarya, A. Agrawal, A. Patra, A. Choudhary, and C. P. Rangan, "Multi party distributed private matching, set disjointness and cardinality of set intersection with information theoretic security," in CANS '09. Springer - Verlag, Dec. 2009.
  12. C. Hazay and Y. Lindell, "Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries," in TCC'08, 2008.
  13. S. Jarecki and X. Liu, "Efficient oblivious pseudorandom function with applications to adaptive ot and secure computation of set intersection," in TCC '09. Berlin, Heidelberg: Springer-Verlag, 2009.
  14. W. Dong, V. Dave, L. Qiu, and Y. Zhang, "Secure friend discovery in mobile social networks," in IEEE INFOCOM '11,Apr 2011.
  15. E. De Cristofaro, M. Manulis, and B. Poettering, "Private discovery of common social contacts," in Applied Cryptography and Network Security, Springer, 2011.
Index Terms

Computer Science
Information Sciences

Keywords

Bluetooth Portable Public Networks HBC SMC.

Powered by PhDFocusTM