机会网络中基于社会属性的按需密钥管理方案

doi:10.3969/j.issn.1000-436x.2012.12.012

Abstract

Abstract:

An on-demand key management scheme was proposed based on social attributes,which could conform to the characteristics of intermittent connectivity,high mobility and self-organized management in opportunistic networks.By utilizing the identity-based threshold signature scheme,the authentication of nodes’social attributes was realized.Due to the specialty of the opportunistic routing protocols,nodes selectiv ly issued the identity certificates for each other to establish the Web of trust based on the matching of social attributes.Consequently,the performance of certificate graph was efficiently optimized comparing to the traditional met .Meanwhile,thanks to checking the social attribute evidences,the invalid certificate chains caused by malicious nodes were avoid to be built.Simulation result shows that,the scheme can provide high success ratio for reconstruction of certificate chains and high user reachability through low network costs in opportunistic networks.

Key words: opportunistic networks, key management, identity-based cryptography, threshold cryptography, social attribute, certificate graph

Xi CHEN,Guang-song LI,You-liang TIAN,Jian-feng MA. On-demand key management based on social attribute for opportunistic networks[J]. Journal on Communications, 2012, 33(12): 93-99.

Figures/Tables 4

References 25

[1]	PELUSI L , PASSARELLA A , CONTI M . Opportunistic networking:data forwarding in disconnected mobile ad hoc networks[J]. IEEE Communications Magazine, 2006,44(11): 134-141.
[2]	CONTI M , GIORDANO S , MAY M ,et al. From opportunistic networks to opportunistic computing[J]. Communications Magazine,IEEE, 2010,48: 126-139.
[3]	CONTI M , KUMAR M . Opportunities in opportunistic computing[J]. Computer, 2010,43(1): 42-50.
[4]	SCOTT J , HUI P , CROWCROFT J ,et al. Haggle:A networking architecture designed around mobile users[A]. Proc of the Third Annual IFIP Conference on Wireless On-Demand Network Systems and Services (WONS)[C]. 2006.
[5]	HUI P , CHAINTREAU A , SCOTT J ,et al. Pocket switched networks and human mobility in conference environments[A]. Proc of ACM SIGCOMM Workshop on Delay-Tolerant Networking[C]. 2005. 244-251.
[6]	ZHANG Z . Routing in intermittently connected mobile ad hoc networks and delay tolerant networks:overview and challe ges[J]. IEEE Communications Surveys ＆Tutorials, 2006,8(1): 24-37.
[7]	SHAMIR A . Identity-based cryptosystems and signature schemes[A]. Proc of the CRYPTO 84 on Advances in Cryptology[C]. New York.Springer-Verlag, 1984. 47-53.
[8]	BONEH D , FRANKLIN M K . Identity-based encryption from the Weil pairing[A]. Proc of the 21st Annual International Cryptology Conference on Advances in Cryptology[C]. London: Springer-Verlag, 2001. 213-229.
[9]	SHAMIR A . How to share a secret[J]. Communications of the ACM, 1979,22(11): 612-613.
[10]	FELDMAN P . A practical scheme for non-interactive verifiable secret sharing[A]. Proc of the 28th Annual Symposium on Foundations of Computer Science[C]. 1987. 427-438.
[11]	HUBAUX J P , BUTTYAN L , CAPKUN S . The quest for security in mobile ad hoc networks[A]. Proc of the 2nd ACM International Symposium on Mobile Ad Hoc Networking＆Computing[C]. New York,USA, 2001. 146-155.
[12]	CAPKUN S , BUTTYAN L , HUBAUX J P . Self-organized public-key management for mobile ad hoc networks[J]. IEEE Transactions on Mobile Computing, 2003,2(1): 52-64.
[13]	NGUYEN H A , GIORDANO S , PUIATTI A . Probabilistic routing protocol for intermittently connected mobile ad hoc network (PROPICMAN)[A]. Proc of the IEEE International Symposium on World of Wireless,Mobile and Multimedia Networks(WoWMoM)[C]. 2007. 1-6.
[14]	BOLDRINI C , CONTI M , JACOPINI J ,et al. HiBOp:a history based routing protocol for opportunistic networks[A]. Proc of the IEEE International Symposium on World of Wireless Mobile and ultimedia Networks(WoWMoM)[C]. 2007. 1-12.
[15]	VERMA A , SRIVASTAVA A . Integrated routing protocol for opportunistic networks[J]. International Journal of Advanced Computer Science and Applications, 2011,2(3): 85-92.
[16]	SETH A , KESHAV S . Practical security for disconnected nodes[A]. Proc of the First Workshop on Secure Network Protocols (NPSec)[C]. 2005. 31-36.
[17]	ASOKAN N , KOSTIAINEN K , GINZBOORG P ,et al. applicability of identity-based cryptography for disruption-tolerant networking[A]. Proc of the 1st International MobiSys Workshop on Mobile Opportunistic Networking[C]. New York, 2007. 52-56.
[18]	ZHOU L , HAAS Z . Securing ad hoc networks[J]. IEEE Networks, 1999,13(6): 24-30.
[19]	KONG J , ZERFOS P , LUO H ,et al. Providing robust and ubiquitous security support for mobile ad-hoc networks[A]. Proc of the 9th International Conference on Network Protocols[C]. 2001. 251-260.
[20]	YI S , KRAVETS R . Composite key management for ad hoc networks[A]. Proc of the 1th International Conference on Mobile and Ubiquitous Systems:Networking and Services[C]. Urbana,USA, 2004. 52-61.
[21]	BAEK J , ZHENG Y . Identity-based threshold signature scheme from the bilinear pairings[A]. Proc of the International Conference on Information Technology:Coding and Computing (ITCC'04)[C]. 2004. 1-124.
[22]	KER?NEN A , OTT J , K?RKK?INEN T . The ONE simulator for DTN protocol evaluation[A]. Proc of the 2nd International Conference on Simulation Tools and Techniques[C]. 2009. 2834-2838.
[23]	EKMAN F , KER?NEN A , KARVO J ,et al. Working Day movement model[A]. Proc of the 1st ACM SIGMOBILE Workshop on Mobility models[C]. New York, 2008.
[24]	HUBAUX J P , BUTTYAN L , CAPKUN S . Small worlds in security systems:an analysis of the PGP certificate graph[A]. Proc of the ACM New Security Paradigms Workshop[C]. New York,USA, 2002. 28-35.
[25]	MILGRAM S . The small world problem[J]. Psychology Today, 1967,2(1): 60-67.

Metrics

Recommended 0

No Suggested Reading articles found!

方案	平均最短路径	最大通信负载
按需密钥管理	5.81	25
自组织密钥管理	6.23	36

On-demand key management based on social attribute for opportunistic networks

RichHTML

PDF

Knowledge

Cited

Abstract

Cite this article

share this article

Figures/Tables 4

References 25

Related Articles 15

Metrics

Recommended 0

[1]	Wei JIN, Fenghua LI, Mingjie YU, Yunchuan GUO, Ziyan ZHOU, Liang FANG. HDFS-oriented cryptographic key resource control mechanism [J]. Journal on Communications, 2022, 43(9): 27-41.
[2]	Zuobin YING, Yuanping SI, Jianfeng MA, Ximeng LIU. Blockchain-based distributed EHR fine-grained traceability scheme [J]. Journal on Communications, 2021, 42(5): 205-215.
[3]	Miaomiao TIAN, Jing CHEN, Hong ZHONG. Identity-based incremental signature scheme from lattices [J]. Journal on Communications, 2021, 42(1): 108-117.
[4]	LI Xuejun,ZHANG Dan,LI Hui. Efficient revocable attribute-based encryption scheme [J]. Journal on Communications, 2019, 40(6): 32-39.
[5]	Miaomiao TIAN,Chuang GAO,Jie CHEN. Identity-based cloud storage integrity checking from lattices [J]. Journal on Communications, 2019, 40(4): 128-139.
[6]	Wei JIN,Mingjie YU,Fenghua LI,Zhengkun YANG,Kui GENG. High-performance and high-concurrency encryption scheme for Hadoop platform [J]. Journal on Communications, 2019, 40(12): 29-40.
[7]	Xiao-yong GUO,An-min FU,Bo-yu KUANG,Wei-jia DING. Secure deduplication and integrity audit system based on convergent encryption for cloud storage [J]. Journal on Communications, 2017, 38(Z2): 156-163.
[8]	Jian-sheng YAO,Chun-guang MA,Qi YUAN. Utility-based barter trade incentive scheme in opportunistic network [J]. Journal on Communications, 2016, 37(9): 102-110.
[9]	Jin-bo XIONG,Feng-hua LI,Yan-chao WANG,Jian-feng MA,Zhi-qiang YAO. Research progress on cloud data assured deletion based on cryptography [J]. Journal on Communications, 2016, 37(8): 167-184.
[10]	Zhi REN,Yong-yin TAN,Ji-bi LI,Qian-bin CHEN. Reliable selfish node detection algorithm for opportunistic networks [J]. Journal on Communications, 2016, 37(3): 1-6.
[11]	Zhi REN,Jian-wei SUO,Wen-peng LIU,Hong-jiang LEI,Qian-bin CHEN. High-throughput and low-overhead probabilistic routing based on multi-player bargaining game for opportunistic networks [J]. Journal on Communications, 2015, 36(6): 41-48.
[12]	Da-peng WU,Peng-wen LOU,Qiao-shou LIU,Yu XIONG,Ru-yan WANG. Coding redundancy controlled data forwarding mechanism in opportunistic networks [J]. Journal on Communications, 2015, 36(3): 63-74.
[13]	UDa-peng W,ONGXiao-long K,HANGHong-pei Z,IUQiao-shou L,IONGYu X,ANGRu-yan W. Social attributes aware data forwarding strategy in intermittently connected wireless networks [J]. Journal on Communications, 2015, 36(1): 38-47.
[14]	Xiao-rui ZHONG,Chun-guang MA. Dynamic accumulators-based authenticated group key management scheme for heterogeneous wireless sensor network [J]. Journal on Communications, 2014, 35(3): 124-134.
[15]	. Dynamic accumulators-based authenticated group key management scheme for heterogeneous wireless sensor network [J]. Journal on Communications, 2014, 35(3): 14-134.