Efficient and privacy-preserving profile matching protocols in opportunistic networks
In opportunistic networks,users can take the advantage of parallel opportunistic contacts with other mobile users and find the appropriate helpers to forward the messages or share the contents.Most of the existing profile-matching protocols were designed on the basis of homomorphic cryptosystem and...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2015-12-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2015325/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539575967645696 |
|---|---|
| author | Yong-kai LI Shu-bo LIU Zhao-huan YANG Meng-jun LIU |
| author_facet | Yong-kai LI Shu-bo LIU Zhao-huan YANG Meng-jun LIU |
| author_sort | Yong-kai LI |
| collection | DOAJ |
| description | In opportunistic networks,users can take the advantage of parallel opportunistic contacts with other mobile users and find the appropriate helpers to forward the messages or share the contents.Most of the existing profile-matching protocols were designed on the basis of homomorphic cryptosystem and were not quite efficient in encryption and decryption.Three efficient and privacy-preserving profile matching protocols were proposed to deal with different privacy requirements in opportunistic networks,which do not use any homomorphic encryption.The proposed protocols were proved to be privacy-preserving and correct.The performances of the protocols are thoroughly analyzed and evaluated via real smartphone experiments,and the results show that the proposed protocols can decrease encryption and decryption time by at least an order of magnitude than the Paillier cryptosystem based protocol. |
| format | Article |
| id | doaj-art-56182d81cdc6441da5d1fcab344bb6ca |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2015-12-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-56182d81cdc6441da5d1fcab344bb6ca2025-01-14T06:54:11ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2015-12-013616317159697309Efficient and privacy-preserving profile matching protocols in opportunistic networksYong-kai LIShu-bo LIUZhao-huan YANGMeng-jun LIUIn opportunistic networks,users can take the advantage of parallel opportunistic contacts with other mobile users and find the appropriate helpers to forward the messages or share the contents.Most of the existing profile-matching protocols were designed on the basis of homomorphic cryptosystem and were not quite efficient in encryption and decryption.Three efficient and privacy-preserving profile matching protocols were proposed to deal with different privacy requirements in opportunistic networks,which do not use any homomorphic encryption.The proposed protocols were proved to be privacy-preserving and correct.The performances of the protocols are thoroughly analyzed and evaluated via real smartphone experiments,and the results show that the proposed protocols can decrease encryption and decryption time by at least an order of magnitude than the Paillier cryptosystem based protocol.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2015325/opportunistic networkhelp-node findingprivacy-preserving protocolprofile matching |
| spellingShingle | Yong-kai LI Shu-bo LIU Zhao-huan YANG Meng-jun LIU Efficient and privacy-preserving profile matching protocols in opportunistic networks Tongxin xuebao opportunistic network help-node finding privacy-preserving protocol profile matching |
| title | Efficient and privacy-preserving profile matching protocols in opportunistic networks |
| title_full | Efficient and privacy-preserving profile matching protocols in opportunistic networks |
| title_fullStr | Efficient and privacy-preserving profile matching protocols in opportunistic networks |
| title_full_unstemmed | Efficient and privacy-preserving profile matching protocols in opportunistic networks |
| title_short | Efficient and privacy-preserving profile matching protocols in opportunistic networks |
| title_sort | efficient and privacy preserving profile matching protocols in opportunistic networks |
| topic | opportunistic network help-node finding privacy-preserving protocol profile matching |
| url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2015325/ |
| work_keys_str_mv | AT yongkaili efficientandprivacypreservingprofilematchingprotocolsinopportunisticnetworks AT shuboliu efficientandprivacypreservingprofilematchingprotocolsinopportunisticnetworks AT zhaohuanyang efficientandprivacypreservingprofilematchingprotocolsinopportunisticnetworks AT mengjunliu efficientandprivacypreservingprofilematchingprotocolsinopportunisticnetworks |