According to user's requirements on the proxy performance
cost and safety in proxy discovery
and the pri-vacy-preserving issue during the process of the demand private matching
a new private matching algorithm was pre-sented based on Paillier homomorphic encryption
comprehensively considered the attributes of user and agents and their priority.It included four steps:building the similarity function based on Euclidean distance
carrying on the private matching by encryption algorithm
calculating the similarity and screening the proxy chain.Proposed scheme introduced semi trusted primary proxy from the global level
which is to manage all the sub proxy's business type and the connection status
and do the main computational overhead.At the same time
Euclidean distance and Paillier homomorphic encryp-tion algorithm were combined to support the multivariate attributes with priority to match
which can effectively protect the privacy of user and sub proxy.Finally
security analysis and evaluation results show the effectiveness and safety of proposed scheme.
关键词
Keywords
references
ZHENG Y , LI M , LOU W , et al . Location based handshake and private proximity test with location tags [J ] . IEEE Transactions on Dependable and Secure Computing , 2015 , 1 .
SUN J , ZHANG R , ZHANG Y , et al . Privacy-preserving spatiotemporal matching [C ] // 32th IEEE International Conference on Computer Communications . c 2013 : 800 - 808 .
LU R , LIN X , SHEN X , et al . SPOC:a secure and privacy-preserving op-portunistic computing framework for mobile-healthcare emergency [J ] . IEEE Transactions on Parallel and Distributed Systems , 2013 , 24 ( 3 ): 614 - 623 .
AGRAWAL R , EVFIMIEVSKI A , SRIKANT R . Information sharing across private databases [C ] // 32th IEEE International Conference on Computer Communications . 30th ACM SIGMOD International Con-ference on Management of Data , c 2003 : 86 - 97 .
VAIDYA J , CLIFTON C . SPOC:a secure and privacy-preserving op-portunistic computing framework for mobile-healthcare emergency [J ] . IEEE Transactions on Parallel and Distributed Systems , 2005 , 1 ( 13 ): 593 - 622 .
NIU B , ZHU X , ZHANG T , et al . P-match:priority-aware friend discovery for proximity-based mobile social networks [C ] // 10th IEEE International Conference on Mobile Ad-Hoc and Sensor Systems . c 2013 : 351 - 355 .
LI R , WU C . An unconditionally secure protocol for multi-party set intersection [M ] // 5th Springer Applied Cryptography and Network Se-curity . c 2007 : 226 - 236 .
KERSCHBAUM F . Outsourced private set intersection using homo-morphicencryption [C ] // 7th ACM Symposium on Information,Com-puter and Communications Security . c 2012 : 85 - 86 .
LI M , YU S , CAO N , et al . Privacy-preserving distributed profile matching in proximity-based mobile social networks [J ] . IEEE Trans-actions on Wireless Communications , 2013 , 12 ( 5 ): 2024 - 2033 .
ZHANG R , ZHANG J , ZHANG Y , et al . Privacy-preserving profile matching for proximity-based mobile social networking [J ] . IEEE Trans-actions on Wireless Communications , 2013 , 31 ( 9 ): 656 - 668 .
THAPA A , LI M , SALINAS S , et al . Asymmetric social proximity based private matching protocols for online social networks [J ] . IEEE Transactions on Parallel and Distributed Systems , 2015 , 26 ( 6 ): 1547 - 1559 .
CHU W T CHANG F C . A privacy-preserving bipartite graph match-ing framework for multimedia analysis and retrieval [C ] // 5th ACM In-ternational Conference on Multimedia Retrieval . c 2015 : 243 - 250 .
JECKMANS A TANG Q HARTEL P . Poster:privacy-preserving profile similarity computation in online social networks [C ] // 18th ACM Conference on Computer and Communications Security . c 2011 : 793 - 796 .
WANG B LI B LI H . Gmatch:secure and privacy-preserving group matching in social networks [C ] // 55th IEEE Global Communications Conference . c 2012 : 726 - 731 .
WANG B LI B LI H , et al . Achieving secure friend discovery in social strength-aware PMSNs [C ] // 34th IEEE Military Communications Conference . c 2015 : 947 - 953 .
PAILLIER P . Public-key cryptosystems based on composite degree residuosity classes [J ] . Springer Cryptology-EUROCRYPT , 1999 , 547 ( 1 ): 223 - 238 .
RANE S SUN W VETRO A . Privacy-preserving approximation of L1 distance for multimedia applications [C ] // Multimedia and Expo (ICME) . c 2010 : 492 - 497 .
ZHANG R ZHANG R SUN J , et al . Fine-grained private matching for proximity-based mobile social networking [C ] // INFOCOM . c 2012 : 1969 - 1977 .