信息网络的三个共性特征相关问题研究
摘要
本文在对因特网(Internet)、移动自组网(Mobile Ad-hoc Network)、车载自组网(Vehicular Ad-hoc Network)、软件网络(Software Network)和电子商务网络(E-Commerce Network)等不同信息网络亟待解决的部分技术问题进行横向分析的基础上,挖掘出隐藏在这些相关或不相关问题背后的三个共性特征:传播性、演化性和信任性,并展开相关问题的纵向研究。主要贡献和创新点包括:
1.在传播性方面,提出了三个模型。即:研究了拥塞在因特网中、故障在软件网络中和蠕虫在车载自组网中的传播过程,依据三种网络的个性和传播现象的共性提出了体现拥塞作用的因特网故障传播模型、基于容错能力和故障强度的软件网络故障传播模型和考虑了移动模式、通信信道、媒质访问控制等环节的车载自组网蠕虫传播模型,并分析了不同网络拓扑结构和模型参数与传播能力的关系。
2.在演化性方面,提出了两个模型。即:研究了因特网路由器级拓扑结构和电子商务个体信任关系网络的演化过程,引入属性概念,表征路由器具有的资源和商品买家的特征,并分别基于该概念提出了路由器级拓扑演化模型和电子商务个体信任网络演化模型,并分析了各模型参数对拓扑演化的影响。
3.在信任性方面,提出了三个模型。即:研究了移动自组网中的路由协议、因特网中的接入控制和分布式网络中的多秘密共享等信任性相关问题。提出了兼顾通信可靠性和路径长度的主观信任路由模型、提高信任性的网络接入控制与修复模型和简洁高效的分布式网络可验证多秘密共享模型。
Although every information network behaves quite differently from each other in many aspects, such as data traffic, node property, and connect relations, and meantime they suffer from diverse technical problems, one will find some common features behind those related or unrelated problems existed in different information networks when reviewing them from a new perspective. These common features drive technologies to be updated endlessly and drive puzzles to be solved constantly. When the existence of these common features is recognized and the mechanisms leading to these common features are understand, it is expected to get some inspirations from other solutions of the similar problems in other information networks. It is helpful to comprehend the reasons resulted in technical problems more clearly. Following this idea, this study focuses on Internet, mobile ad-hoc network, vehicular ad-hoc network, software network, e-commerce network, and other information networks with different applying domains. After analyzing some related problems existed in these networks such as route, robust, topology modeling, and security, three common features are concluded, furthermore, some researches on the problems related with these common features are carried out.
Many propagation behaviors can be seen as obeying a certain rule, such as congestion spreading in Internet, failures extending in software network, and worms disseminating in vehicular ad-hoc networks. The scientific researchers from different domains including mathematics, physics, and computer science are seeking to describe such propagation, uncover the factors affecting such propagation, and find a reasonable controlling method on such propagation. This research is important for understanding propagation behaviors and controlling methods on congestion, failures, and worms spreading in different information networks. The finding of characteristics of complex networks provides a new theoretic tool and technical method to investigate propagation behaviors. Many empirical studies show many social networks and technical networks have small-world (big clustering coefficient and small characteristic path length) and scale-free (degree obeys power-law distribution) characteristics. This work focuses on researching on congestion in Internet, failures in software network, and worms in vehicular ad-hoc networks, and builds their propagation models, respectively.
Many evolution processes are dominated by a certain rule, such as Internet extending constantly, e-commerce network changing continuously, so these processes are predicted in a extent not random (random is just a appearance )。Only those network structures with some special pattens can hold on for a long time in order to spontaneously evolve to a new pattern (one of a group of special patterns) when receiving outside force. The complexity of network structure intensifies the non-linear affections between nodes, resulting in the research on the evolution of network structure converting from particle, simplicity, and determination to holistic, complexity, and uncertainty. Modeling the evolution of network structures can capture the dynamics of network development, understand the effects of every micro factor on changes of network structures, and help human grasp network functions and dynamics characteristics. Therefore, this work pays attentions to the evolutions of the router-level topology of Internet and trust network between individuals of e-commerce network.
Many problems in mobile ad-hoc networks and Internet are closely related with trust such as route, security distribution, and access control. Their goals are to build a network environment with high trust degree. Until now, their trust is not guaranteed completely yet due to the openness and anonymity of popular Internet and rising MANET. Generally, the protocols of link layer and network layer assume that every node is trusted, however, this assumption does not hold in many situations where attackers are easy to destroy network through disturbing protocol regulations. The lack of a kind of satisfied trust has heavily blocked the further development of Internet and mobile ad-hoc network, and has affected the recognition extent of applications. This work concentrates on trust problems including routing and multi-secret sharing in MANET and access control in Internet.
The main contributions and novelties of this work are summarized as follows:
(i) In the propagation aspect, Internet: a congestion function and the concept of“delay time”are introduced. And a new evaluation function of network efficiency is given. Based on Statnet and Webgraph topologies the effects of network structure and size, delay time, processing ability and traffic generation speed on congestion propagation are investigated. Also congestion propagation process composed of three phases and some factors affecting transition phenomenon are uncovered. Software network: a topological model in which directional edges and the corresponding weight values are used to represent calling relationships and close degree among functions is proposed. By introducing the function fault-tolerant capability and the software fault intensity, a software fault propagation model is designed to explore interactions between fault propagation dynamics and software parameters. Vehicular ad-hoc network: the theoretic spreading results under urban scenario with equilibrium traffic are analyzed through modeling mobility pattern, communication channel, medium access control, worm propagation, and others. The extensive Monte Carlo simulations uncovered the impacts of the transmission range, the minimum velocity and the maximum velocity, and the vehicle density on epidemic spreading of such worms in vehicular ad-hoc networks. Further, the wireless worm propagation in the same scenario with dynamic traffic is simulated by using network simulation software, the correlation between theoretic results and practical outcome is discussed, the reasons resulting in local differences are also analyzed, and finally, the interconnection of affected rate and other network parameters is pointed out.
(ii) In evolution aspect, Internet: the concept of“attraction degree”is introduced. And the idea that the growth of Internet topology is attributed to interaction between internal factors and external factors of node is pointed out. A new modeling algorithm for Internet router-level topology is proposed by considering the influence of both node property evolution and geography limit. E-commence network: by introducing the concept of attribute similarity, an attribute matching mechanism is designed. Based on attribute matching mechanism a feasible bring-and-buy scheme in E-Commerce is proposed, which is expected to give guidelines about how the aid’s decision-making process is designed to improve users’perceptions of usefulness and trustworthiness of on-line decision aids.
(iii) In trust aspect, MANET: on one hand, different from most the past routing algorithms only considering the shortest path first, or evaluating the trust level solely on the forwarding behavior, or depending on recommendation-based trust mechanism, we propose a novel subjective trust routing model under consideration to both communication reliability and path length. Inspired by the establishment pattern of trust relations in human life, we introduce the concept of attribute similarity to inherently bind neighbor selection, trust evaluation, packet forwarding, and other routing processes. Based on the similarity degree, we put forward a new forwarding behavior without needing handshake process and decrease the transmission delay, so a subjective trust routing is achieved. We give a recommended method to calculate the similarity degree between attributes. On the other hand, a new verifiable multi-secret sharing model based on Shamir secret sharing is proposed and realized. Internet: a framework of hierarchy trusted access and remediation model based on the grade division were put forward, and the partition rules of trusted attributes, the methods of grade division as well as the work flow of remediation model were explained in detail. Moreover, the potential applications and the access procedure of terminals were discussed.
1.在传播性方面,提出了三个模型。即:研究了拥塞在因特网中、故障在软件网络中和蠕虫在车载自组网中的传播过程,依据三种网络的个性和传播现象的共性提出了体现拥塞作用的因特网故障传播模型、基于容错能力和故障强度的软件网络故障传播模型和考虑了移动模式、通信信道、媒质访问控制等环节的车载自组网蠕虫传播模型,并分析了不同网络拓扑结构和模型参数与传播能力的关系。
2.在演化性方面,提出了两个模型。即:研究了因特网路由器级拓扑结构和电子商务个体信任关系网络的演化过程,引入属性概念,表征路由器具有的资源和商品买家的特征,并分别基于该概念提出了路由器级拓扑演化模型和电子商务个体信任网络演化模型,并分析了各模型参数对拓扑演化的影响。
3.在信任性方面,提出了三个模型。即:研究了移动自组网中的路由协议、因特网中的接入控制和分布式网络中的多秘密共享等信任性相关问题。提出了兼顾通信可靠性和路径长度的主观信任路由模型、提高信任性的网络接入控制与修复模型和简洁高效的分布式网络可验证多秘密共享模型。
Although every information network behaves quite differently from each other in many aspects, such as data traffic, node property, and connect relations, and meantime they suffer from diverse technical problems, one will find some common features behind those related or unrelated problems existed in different information networks when reviewing them from a new perspective. These common features drive technologies to be updated endlessly and drive puzzles to be solved constantly. When the existence of these common features is recognized and the mechanisms leading to these common features are understand, it is expected to get some inspirations from other solutions of the similar problems in other information networks. It is helpful to comprehend the reasons resulted in technical problems more clearly. Following this idea, this study focuses on Internet, mobile ad-hoc network, vehicular ad-hoc network, software network, e-commerce network, and other information networks with different applying domains. After analyzing some related problems existed in these networks such as route, robust, topology modeling, and security, three common features are concluded, furthermore, some researches on the problems related with these common features are carried out.
Many propagation behaviors can be seen as obeying a certain rule, such as congestion spreading in Internet, failures extending in software network, and worms disseminating in vehicular ad-hoc networks. The scientific researchers from different domains including mathematics, physics, and computer science are seeking to describe such propagation, uncover the factors affecting such propagation, and find a reasonable controlling method on such propagation. This research is important for understanding propagation behaviors and controlling methods on congestion, failures, and worms spreading in different information networks. The finding of characteristics of complex networks provides a new theoretic tool and technical method to investigate propagation behaviors. Many empirical studies show many social networks and technical networks have small-world (big clustering coefficient and small characteristic path length) and scale-free (degree obeys power-law distribution) characteristics. This work focuses on researching on congestion in Internet, failures in software network, and worms in vehicular ad-hoc networks, and builds their propagation models, respectively.
Many evolution processes are dominated by a certain rule, such as Internet extending constantly, e-commerce network changing continuously, so these processes are predicted in a extent not random (random is just a appearance )。Only those network structures with some special pattens can hold on for a long time in order to spontaneously evolve to a new pattern (one of a group of special patterns) when receiving outside force. The complexity of network structure intensifies the non-linear affections between nodes, resulting in the research on the evolution of network structure converting from particle, simplicity, and determination to holistic, complexity, and uncertainty. Modeling the evolution of network structures can capture the dynamics of network development, understand the effects of every micro factor on changes of network structures, and help human grasp network functions and dynamics characteristics. Therefore, this work pays attentions to the evolutions of the router-level topology of Internet and trust network between individuals of e-commerce network.
Many problems in mobile ad-hoc networks and Internet are closely related with trust such as route, security distribution, and access control. Their goals are to build a network environment with high trust degree. Until now, their trust is not guaranteed completely yet due to the openness and anonymity of popular Internet and rising MANET. Generally, the protocols of link layer and network layer assume that every node is trusted, however, this assumption does not hold in many situations where attackers are easy to destroy network through disturbing protocol regulations. The lack of a kind of satisfied trust has heavily blocked the further development of Internet and mobile ad-hoc network, and has affected the recognition extent of applications. This work concentrates on trust problems including routing and multi-secret sharing in MANET and access control in Internet.
The main contributions and novelties of this work are summarized as follows:
(i) In the propagation aspect, Internet: a congestion function and the concept of“delay time”are introduced. And a new evaluation function of network efficiency is given. Based on Statnet and Webgraph topologies the effects of network structure and size, delay time, processing ability and traffic generation speed on congestion propagation are investigated. Also congestion propagation process composed of three phases and some factors affecting transition phenomenon are uncovered. Software network: a topological model in which directional edges and the corresponding weight values are used to represent calling relationships and close degree among functions is proposed. By introducing the function fault-tolerant capability and the software fault intensity, a software fault propagation model is designed to explore interactions between fault propagation dynamics and software parameters. Vehicular ad-hoc network: the theoretic spreading results under urban scenario with equilibrium traffic are analyzed through modeling mobility pattern, communication channel, medium access control, worm propagation, and others. The extensive Monte Carlo simulations uncovered the impacts of the transmission range, the minimum velocity and the maximum velocity, and the vehicle density on epidemic spreading of such worms in vehicular ad-hoc networks. Further, the wireless worm propagation in the same scenario with dynamic traffic is simulated by using network simulation software, the correlation between theoretic results and practical outcome is discussed, the reasons resulting in local differences are also analyzed, and finally, the interconnection of affected rate and other network parameters is pointed out.
(ii) In evolution aspect, Internet: the concept of“attraction degree”is introduced. And the idea that the growth of Internet topology is attributed to interaction between internal factors and external factors of node is pointed out. A new modeling algorithm for Internet router-level topology is proposed by considering the influence of both node property evolution and geography limit. E-commence network: by introducing the concept of attribute similarity, an attribute matching mechanism is designed. Based on attribute matching mechanism a feasible bring-and-buy scheme in E-Commerce is proposed, which is expected to give guidelines about how the aid’s decision-making process is designed to improve users’perceptions of usefulness and trustworthiness of on-line decision aids.
(iii) In trust aspect, MANET: on one hand, different from most the past routing algorithms only considering the shortest path first, or evaluating the trust level solely on the forwarding behavior, or depending on recommendation-based trust mechanism, we propose a novel subjective trust routing model under consideration to both communication reliability and path length. Inspired by the establishment pattern of trust relations in human life, we introduce the concept of attribute similarity to inherently bind neighbor selection, trust evaluation, packet forwarding, and other routing processes. Based on the similarity degree, we put forward a new forwarding behavior without needing handshake process and decrease the transmission delay, so a subjective trust routing is achieved. We give a recommended method to calculate the similarity degree between attributes. On the other hand, a new verifiable multi-secret sharing model based on Shamir secret sharing is proposed and realized. Internet: a framework of hierarchy trusted access and remediation model based on the grade division were put forward, and the partition rules of trusted attributes, the methods of grade division as well as the work flow of remediation model were explained in detail. Moreover, the potential applications and the access procedure of terminals were discussed.
引文
[1] Faloutsos M, Faloutsos P, Faloutsos C. On power-law relationships of the Internet topology[J]. ACM SIGCOMM Computer Communication Review, 1999, 29(4): 251-262.
[2] Siganos G, Faloutsos M, Faloutsos P, Faloutsos C. Power-Laws and the AS-level internet topology[J]. IEEE/ACM Trans on Networking, 2003, 11(4): 514-524.
[3] Jiang Y, Fang BX, Hu MZ, He RQ. An Example of Analyzing the Characteristics of a Large Scale ISP Topology Measured from Multiple Vantage Points[J]. Journal of Software, 2005, 16(5): 846-856. (姜誉,方滨兴,胡铭曾,何仁清.大型ISP网络拓扑多点测量及其特征分析实例[J].软件学报,2005,16(5): 846-856.)
[4] Albert R, Jeong H, Barabási AL. The Internet’s Achilles’heel: Error and attack tolerance of complex networks[J]. Nature, 2000, 406: 378-382.
[5] Cohen R, Erez K, ben-Avraham D, Havlin S. Breakdown of the Internet under Intentional Attack[J]. Physics Review Letters, 2001, 86(16): 3682-3685.
[6] David BC, Carl SY. Infection dynamics on the Internet[J]. Computers & Security, 2005, 24(4): 280-286.
[7] Wu JJ, Gao ZY, Sun HJ. Effects of the cascading failures on scale-free traffic networks[J]. Physica A, 2007, 378(2): 505-511.
[8] Jacobson V, Karels MJ. Congestion Avoidance and Control[J]. ACM Computer Communications Review, 1988, 18(4): 314-329.
[9] Watts DJ. A simple model of global cascades on random networks[J]. Proceedings of the National Academy of Sciences of USA, 2002, 99(9): 5766-5771.
[10] Motter AE, Lai Y-C. Cascade-based attacks on complex networks[J]. Physical Review E, 2002, 66(6): 065102.
[11] Motter AE. Cascade Control and Defense in Complex Networks[J]. Physics Review Letter, 2004, 93(9): 098701.
[12] Gallos LK, Cohen R, Argyrakis P, Bunde A, Havlin S. Stability and Topology of Scale-Free Networks under Attack and Defense Strategies[J]. Physics Review Letter, 2005, 94: 188701.
[13] Wang J, Liu YH, Zhu JQ, Mi LM. Simple cascading failures model of Internet[J]. Journal of University of Shanghai for Science and Technology, 2008, 30(3): 215-220.(王健,刘衍珩,朱建启,糜利敏.一种简单的Internet级联故障模型[J].上海理工大学学报, 2008, 30(3): 215-220.)
[14] Brandes U. A faster algorithm for betweenness centrality[J]. Journal of Mathematical Sociology, 2001, 25(2): 163-177.
[15] Bollobás B. Random Graphs[M]. 2nd ed., London: Academic Press, 1985.
[16] Barabási AL, Albert R. Emergence of scaling in random networks[J]. Science, 1999, 286(5439): 509-511.
[17] Shen B, Gao ZY. Dynamical properties of transportation on complex networks[J]. Physica A, 2008, 387(5-6): 1352-1360.
[18] Zheng JF, Gao ZY, Zhao XM. Modeling cascading failures in congested complex networks[J]. Physica A, 2007, 385(2): 700-706.
[19] Ohira T, Sawatari R. Phase transition in computer network traffic model[J]. Physical Review E, 1998, 58(1): 193-195.
[20] Latora V, Marchiori M. Efficient Behavior of Small-World Networks[J]. Physics Review Letter, 2001, 87(19): 198701.
[21] Wu JJ, Sun HJ, Gao ZY. Cascading failures on weighted urban traffic equilibrium network[J]. Physica A, 2007, 386(1): 407-413.
[22] Tadi? B, Rodgers GJ, Thurner S, Transport on Complex Networks: Flow, Jamming and Optimization[J]. International Journal of Bifurcation and Chaos, 2007, 17(7): 2363-2385.
[23] Cholvi V. Dissemination of information in complex networks with congestion[J]. Physica A, 1 July 2006, 366: 571-577.
[24] Kim D-H, Motter AE. Resource allocation pattern in infrastructure networks[J]. Journal of Physics A: Mathematical and Theoretical., 2008, 41(22): 224019.
[25] Wang J, Liu YH, Jiao Y, Hu HY. Cascading Dynamics in Congested Complex Networks[J]. European Physical Journal B. 2009, 67(1):95-100.
[26] Valverde S, Cancho RF, SoléRV. Scale free networks from optimal design[J]. Europhysics Letters, 2002, 60(4): 512-517.
[27] Alessandro PS. de Moura, Lai Y-C, Motter AE. Signatures of small-world and scale-free properties in large computer programs[J]. Physical Review E, 2003, 68(1): 017102.
[28] He KQ, Peng R, Liu J, He F, Liang P, Li B. Design methodology of networked software evolution growth based on software pattern[J]. Journal of Systems Science and Complexity, 2006, 19(2): 157-181.
[29] Jenkins S, Kirk SR. Software architecture graphs as complex networks: A novel partitioning scheme to measure stability and evolution[J]. Information Sciences, 2007, 177(12): 2587-2601.
[30] Antiqueira L, Oliveira Jr ON, Costa L da F, Nunes VG das M. A complex network approach to text summarization[J]. Information Sciences, 2009, 179(5): 584-599.
[31] Cai KY, Yin BB. Software execution processes as an evolving complex network[J]. Information Sciences, 2009, 179(12): 1903-1928.
[32] Li DY, Han YN, Hu J. Complex Network Thinking in Software Engineering[C]. International Conference on Computer Science and Software Engineering, Dec. 12-14, 2008, Wuhan, China, pp.264-268.
[33] Myers CR. Software systems as complex networks: structure, function, and evolvability of software collaboration graphs[J]. Physical Review E, 2003, 68(4): 046116.
[34] Tsipenyuk K, Chess B, McGraw G. Seven Pernicious Kingdoms: A Taxonomy of Software Security Errors[J]. IEEE Security & Privacy, 2006, 3(6): 81-84.
[35] SNLC[DB/OL]. Available at http://en.pudn.com/downloads194/sourcecode/compiler/detail914984_en.html
[36] Kleinberg J. The Wireless Epidemic[J]. Nature, 2007, 449(7160): 287-288.
[37] Tanachaiwiwat S, Helmy A. Encounter-based worms: Analysis and defense[J]. Ad Hoc Networks, 2009, 7(7): 1414-1430.
[38] Xiong YP, Sun LM, Niu JW, Liu Y. Opportunistic Networks[J]. Journal of Software, 2009, 20(1): 124-137. (熊永平,孙利民,牛建伟,刘燕.机会网络[J].软件学报, 2009, 20(1): 124-137.)
[39] Coull SE., Szymanski BK. On the development of an internetwork-centric defense for scanning worms[J]. Computers & Security 2009, 28(7): 637-647.
[40] Stephenson B, Sikdar B. A Quasi-Species Model for the Propagation and Containment of Polymorphic Worms[J]. IEEE Transactions on Computers 2009, 58(9): 1289-1296.
[41] Wang J, Liu YH, Tian DX, Wei D. Internet Worm Early Detection and Response Mechanism[J]. Journal of China Universities of Posts and Telecommunications, 2007, 14(3): 79-84. (王健,刘衍珩,田大新,魏达. Internet蠕虫早期检测与响应机制[J].中国邮电高校学报(英文版). 2007, 14(3): 79-84.)
[42] Rhodesa CJ, Nekovee M. The opportunistic transmission of wireless worms between mobile devices[J]. Physica A, 2008, 387(27): 6837-6844.
[43] Hu H, Myers S, Colizza V, Vespignani A. WiFi Epidemiology: Can Your Neighbors' Router Make Yours Sick?[J]. Proceedings of the National Academy of Sciences, 2009, 106(5): 1318-1323.
[44] Lexus Computers Infected Via Bluetooth [DB/OL]. http://it.slashdot.org/it/05/01/26/188224.shtml?tid=220&tid=172&tid=193&tid=190&tid=218, 2005-01-26.
[45] Pu Wang, Marta C. González, César A Hidalgo, Albert-LászlóBarabási. Understanding the Spreading Patterns of Mobile Phone Viruses[J]. Science, 2009, 324(5930): 1071-1076.
[46] Khayam S, Radha H. Analyzing the Spread of Active Worms over VANET[C]. Proceedings of ACM international workshop on vehicular ad hoc networks, Philadelphia, PA, USA. Oct. 1, 2004, pp. 86–87.
[47] Nekovee M. Modeling the Spread of Worm Epidemics in Vehicular Ad Hoc Networks[C]. Proceedings of IEEE Vehicular Technology Conference, Montréal, Canada, Sep. 25-28, 2006, pp. 841-845.
[48] Cheng L, Shakya R. Worm Spreading and Patching in Inter-vehicle Communications[J]. International Journal of Communication Networks and Information Security. 2010, 2(1): 50-53.
[49] Treiber M, Hennecke A, Helbing D. Congested traffic states in empirical observations and microscopic simulations[J]. Physical Review E, 2000, 62(2): 1805-1824.
[50] Rappaport T. Wireless Communications, Principle and Parctice [M]. Englewood Cliffs, NJ: Prentice-Hall, 2000.
[51] Wang J, Liu YH, Jiao Y. A New Cascading Failure Model with Delay Time in Congested Complex Networks[J]. Journal of Systems Science and Systems Engineering.2009, 18(3): 369-381.
[52] VanetMobiSim[DB/OL]. Available at http://vanet.eurecom.fr.
[53] Nekovee M. Worm epidemics in wireless ad hoc networks[J]. New Journal of Physics. 2007, 9(June): 189.
[54] Tian B, Towsley D.On distinguishing between Internet power law topology generators[C]. Proceedings of the IEEE INFOCOM 2002, Vol 2.New York:IEEE, 2002, pp. 638-647.
[55] Zhang Y, Zhang HL, Fang BX. A survey on Internet topology modeling[J]. Journal of software, 2004, 15(8): 1220-1226. (张宇,张宏莉,方滨兴. Internet拓扑建模综述[J].软件学报, 2004,15(8): 1220-1226)
[56] Waxman BM. Routing of multipoint connections[J]. IEEE Journal on Selected Areas in Communications, 1988, 6(9): 1617-1622.
[57] Doar MB. A better model for generating test networks[C]. Proceedings of IEEE Global Internet, London:IEEE, 1996, pp. 86-93.
[58] Calvert KI, Doar MB, Zegura EW. Modeling Internet topology[J]. IEEE Communication Magazine, 1997, 35(6): 160-163.
[59] Winick J, Jamin S. Inet-3.0 Internet topology generator [R]. Technical Report, CSE-TR-456-02, Ann Arbor: University of Michigan, 2002.
[60] Albert R, Barabási AL. Topology of Evolving Networks: Local Events and Universality[J]. Physical Review Letters, 2000, 85(24):5234.
[61] Bar S, Gonen M, Wool A. An Incremental Super-Linear Preferential Internet Topology Model[C]. Proceedings of the 5th Annual Passive and Active Measurement Workshop. LNCS 3015, 2004, pp. 53-62.
[62] Tangmunarunkit H, Govindan R, Jamin S, Shenker S, Willinger W. Network topology generators: Degree-based vs. structural[J]. ACM SIGCOMM Computer Communication Review, 2002: 147-159.
[63] Li L, Alderson D, Willinger W, Doyle J. A first-principles approach to understanding the internet's router-level topology[J]. ACM SIGCOMM Computer Communication Review, 2004, 34(4):3-14.
[64] Fabrikant A, Koutsoupias E, Papadimitriou C. Heuristically optimized trade-offs: A new paradigm for power law in the Internet[C]. Proceedings of the 29th International Colloquium on Automata, Languages and Programming. 2002, pp. 110-122.
[65] Alvarez-Hamelin J, Schabanel N. An Internet graph model based on trade-off optimization[J]. European Physical Journal. 2004, 38:231-237.
[66] Siganos G, Faloutsos M, Faloutsos P, Faloutsos C. Power laws and the AS-level Internet topology [J]. IEEE/ACM Trans. On Networking, 2003, 11(4):514-524.
[67] D Alderson, L Li, W Willinger, J Doyle. Understanding Internet Topology: Principles, Models, and Validation [J]. IEEE/ACM Trans. On Networking, 2005, 13(6):1205-1218.
[68] Jiang Y, Fang BX, Hu ZM, He RQ. An Example of Analyzing the Characteristics of a Large Scale ISP Topology Measured from Multiple Vantage Points[J]. Journal of software, 2005, 16(5): 846-856. (姜誉,方滨兴,胡铭曾,何人清.大型ISP网络拓扑多点测量及其特征分析实例[J].软件学报, 2005, 16(5): 846-856)
[69] Spring N, Mahajan R, Wetherall D, Anderson T. Measuring ISP topologies with rocketfuel[J]. IEEE/ACM Trans. On Networking, 2004, 2(12): 2-16.
[70] Magoni D. Tearing Down the Internet[J]. IEEE Journal on Selected Areas in Communications, 2003, 6(21): 949-960.
[71] Golbeck J. Weaving a web of trust[J]. Science, 2008, 321(5896): 1640-1641.
[72] Mui L, Mohtashemi M, Halberstadt A. A computational model of trust and reputation[C]. Proceedings of the 35th Hawaii International conference on system sciences, Big Island, HI, USA, Jan. 2002, pp. 188-196.
[73] Golbeck J, Parsia B, Hendler J. Trust networks on the semantic web[C]. Proceedings of Cooperative Intelligent Agents, Helsinki, Finland, Aug. 27-29, 2003, pp. 238-249.
[74] Guha R, Kumar R, Raghavan P, Tomkins A. Propagation of trust and distrust[C]. Proceedings of World Wide Web Conference, New York, USA, May 17-22, 2004, pp. 403-412.
[75] Byrne D, Griffitt W, Stefaniak D. Attraction and Similarity of Personality Characteristics[J]. Journal of Personality and Social Psychology, 1967, 5(1): 82-90.
[76] Reibstein DJ. What attracts customers to online stores, and what keeps them coming back? [J]. Journal of the Academy of Marketing Science 2002, 30(4): 465-473.
[77] Senecal S, Nantel J. The influence of online product recommendations on consumers’online choices[J]. Journal of Retailing 2004, 80(1): 159-169.
[78] Komiak SYX, Benbasat I. The Effects of Personalization and Familiarity on Trust and Adoption of Recommendation Agents[J]. MIS Quarterly 2006, 30(4): 941-960.
[79] Quercia D, Hailes S, Capra L. TRULLO-local trust bootstrapping for ubiquitous devices[C]. Proceedings of IEEE Mobiquitous, Philadelphia, PA, USA, Aug. 6-10, 2007, pp. 1-9.
[80] Quercia D, Hailes S, Capra L. Lightweight distributed trust propagation[C]. Proceedings of 7th IEEE International Conference on Data Mining, Omaha, Nebraska, USA, Oct. 28-31, 2007, pp. 282-291.
[81] Ba S, Whinston AB, Zhang H. Building trust in online auction markets through an economic incentive mechanism[J]. Decision Support Systems, 2002, 35(3): 273–286.
[82] Kollock P. The production of trust in online markets[C]. In E. J. Lawler amd M. Macy, S. Thyne, and H. A. Walker, editors, Advances in Group Processes, volume 16, pp. 99–123. JAI Press, 1999.
[83] Snyder JM. Online auction fraud: Are the auction houses doing all they should or could to stop online fraud[J]. Federal Communications Law Journal, 2000, 52: 453–472.
[84] Yu B, Singh MP. A social mechanism of reputation management in electronic communities[C]. Proceedings of 4th International Workshop on Cooperative Information Agents, Boston, USA, Jul. 4 - 7, 2000, pp. 154–165.
[85] Kamvar SD, Schlosser MT, Garcia-Molina H. The eigentrust algorithm for reputation management in P2P networks[C]. Proceedings of the 12th International World Wide Web Conference, May 20-24, 2003, Budapest, HUNGARY, pp. 640–651.
[86] Nass C, Moon Y, Green N. Are computers gender-neutral? Gender stereotypic responses to computers[J]. Journal of Applied Social Psychology, 1997, 27(10): 864–876.
[87] Moon Y. Don’t blame the computer: When self-disclosure moderates the self-serving bias[J]. Journal of Consumer Psychology, 2003, 13(1&2): 125–137.
[88] Hess T, Fuller M, Mathew J. Involvement and decision-making performance with a decision aid: The influence of social multimedia, gender, and playfulness[J]. Journal of Management Information Systems, 2006, 22(3): 15–54.
[89] Al-Natour S, Benbasat I, Cenfetelli R. The role of similarity in ecommerce interactions: The case of online shopping assistants[J]. J. of the Association for Information Systems, 2006, 7(12): 821-861.
[90] Al-Natour S, Benbasat I, Cenfetelli R. The Effects of Process and Outcome Similarity on Users' Evaluations of Decision Aids[J]. Decision Sciences, 2008, 39(2): 175-211.
[91] Aksoy L, Bloom PN. Impact of ordered alternative lists on decision quality. The role of perceived similarity[C]. Proceedings of the Society for Consumer Research Winter Conference, Scottsdale, AZ, 2001.
[92] Lichtenthal JD, Tellefsen T. Toward a theory of business buyer-seller similarity[J]. Journal of Personal Selling and Sales Management, 2001, 21(1): 1–14.
[93] Levin DZ, Cross R, Abrams LC. Why should I trust you? Predictors of interpersonal trust in a knowledge transfer context[J]. Journal of Applied Psychology, 2006, 84(1): 123-136.
[94] Massa P, Avesani P. Trust-aware Recommender Systems[C]. Proceedings of ACM Recommender Systems Conference, Minneapolis, Minnesota, USA, Oct. 19-20, 2007, pp. 17-24.
[95] Ramana K S, Chari A A, Kasiviswanth N. Trust Based Security Routing in Mobile Adhoc Networks[J], International Journal on Computer Science and Engineering, 2010, 2(2): 259-263.
[96] Wang XD, Huo GC, Sun HY, et al. An Opportunistic Routing for MANET Based on Partial Network Coding[J]. Acta Electronica Sinica, 2010, 38(8): 1736-1740.(王晓东,霍广城,孙海燕,等.移动自组网中基于部分网络编码的机会主义路由[J].电子学报, 2010, 38(8): 1736-1740)
[97] Wang GD, Wang G. An Energy-Aware and Beaconless Geographic Routing for Mobile Ad Hoc Network[J]. Acta Electronica Sinica, 2010, 38(7): 1547-1551. (王国栋,王钢. MANET中一种具有能量意识的无信标地理路由算法[J].电子学报, 2010, 38(7): 1547-1551)
[98] Raya M, Hubaux J-P.Securing Vehicular Ad Hoc Networks[J], Journal of Computer Security, 2007, 15(1): 39-68.
[99] Adibi S, Agnew GB. Multilayer flavoured dynamic source routing in mobile ad-hoc networks[J], IET Communications, 2008, 2(5): 690-707.
[100] Johnson D, Maltz D. Dynamic source routing in ad hoc wireless networks[M]. In Imielinski T. and Korth H., editors, Mobile Computing, chapter 5, 153-181.Kluwer Academic Publishers, 1996.
[101] Perkins C, Belding-Royer E, Das S. Ad-hoc On-demand Distance Vector (AODV) Routing[S], IETF RFC 3561, July 2003.
[102] Peng SC, Jia WJ, Wang GJ, Wu J, Guo MY. Trusted Routing Based on Dynamic Trust Mechanism in Mobile Ad-Hoc Networks[J]. IEICE TRANSACTIONS on Information and Systems, 2010, E93-D (3): 510-517.
[103] Pirzada AA, McDonald C. Establishing trust in pure ad-hoc networks[C]. Proceedings of Australasian conference on Computer science, January 2004, Vol.56, pp.47-54.
[104] Anantvalee T, Wu J. Reputation-Based System for Encouraging the Cooperation of Nodes in Mobile Ad Hoc Networks[C]. Proceedings of IEEE International Conference on the Communications, June 2007, pp.3383-3388.
[105] Peng SC, Jia WJ, Wang GJ. Voting-Based Clustering Algorithm with Subjective Trust and Stability in Mobile Ad-Hoc Networks[C]. Proceedings of IEEE/IFIP International Conference on Embedded and Ubiquitous Computing, December 2008, Vol.2, pp.3-9.
[106] Luo J, Liu X, Zhang Y, Ye D, Xu Z. Fuzzy Trust Recommendation Based on Collaborative Filtering for Mobile Ad-hoc Networks[C]. Proceedings of IEEE Conference on Local Computer Networks, October 2008, pp.305-311.
[107] Li J, Li R, Kato J. Future Trust Management Framework for Mobile Ad Hoc Networks[J], IEEE Communications Magazine, 2008, 46(4): 108-114.
[108] Marti S, Giuli TJ, Lai K, Baker M. Mitigating routing misbehavior in mobile ad hoc networks[C]. Proceedings of International Conference on Mobile Computing and Networking, August 2000, pp.255-265.
[109] Buchegger S, Boudec Le J-Y. Performance Analysis of the CONFIDANT Protocol: Cooperation of Nodes - Fairness in Dynamic Ad-hoc Networks[C]. Proceedings of ACM International Symposium on Mobile Ad Hoc Networking and Computing, June 2002, pp.226-236.
[110] Winjum E, Spilling P, Kure ?. Trust metric routing to regulate routing cooperation in mobile wireless ad hoc networks[C]. Proceedings of European Wireless, April 2005, pp.399-406.
[111] Pirzada AA, Datta A, McDonald C. Incorporating trust and reputation in the DSR protocol for dependable routing[J], Computer Communications, 2006, 29(15): 2806-2821.
[112] Chen T, Mehani O, Boreli R. Trusted Routing for VANET[C]. Proceedings of International Conference on Intelligent Transport Systems Telecommunications, October 2009, pp.647-652.
[113] Yu M, Leung KK. A Trustworthiness-Based QoS Routing Protocol for Wireless Ad Hoc Networks[J]. IEEE Transactions on Wireless Communications, 2009, 8(4): 1888-1898.
[114] Abusalah L, Khokhar A, Guizani M. Trust Aware Routing in Mobile Ad Hoc Networks[C]. Proceedings of the Global Telecommunications Conference, 27 November - 1 December 2006.
[115] Misra R, Mandal CR. Performance comparison of AODV/DSR on-demand routing protocols for ad hoc networks in constrained situation[C]. Proceedings of IEEE International Conference on Personal Wireless Communications, January 2005, pp.86-89.
[116] Choudhury S, Roy SD, Singh SA. Trust Management in Ad Hoc Network for Secure DSR Routing[M]. In Tarek Sobh, Khaled Elleithy, Ausif Mahmood and Mohammad A.Karim, Editors, Novel Algorithms and Techniques in Telecommunications, Automation and Industrial Electronics, Springer Netherlands, 2008, pp.496-500.
[117] Luo J, Ni X, Yong J. A trust degree based access control in grid environments[J], Information Science, 2009, 179(15): 2618-2628.
[118] Azzedin F, Maheswaran M. Evolving and managing trust in grid computing systems[C]. Proceedings of IEEE Canadian Conference on Electrical and Computer Engineering, May 2002, pp.1424-1429.
[119] Byrne D, Griffitt W, Stefaniak D. Attraction and Similarity of Personality Characteristics[J]. Journal of Personality and Social Psychology, 1967, 5(1): 82-90.
[120] Mundinger J, Le Boudec J.-Y. Analysis of a Reputation System for Mobile Ad-Hoc Networks with Liars[J]. Performance Evaluation, 2008, 65(3-4): 212–226.
[121] Mark C. Trusted Computing– closing that lingering doubt. Network Security[J], 2006, 2006(6): 13-15.
[122] Siewiorek DP, Yang ZX, Chillarege R, et al. Industry trends and research in dependable computing[J]. Chinese journal of computers, 2007, 30(10): 1645-1661.
[123] Balacheff B, Chen L, Pearson S, et al. Trusted Computing Platforms: TCPA Technology in Context[M]. Prentice Hall PTR, Upper Saddle River, NJ, USA, 2002.
[124] Peinado M, Chen Y, England P, et al. NGSCB: A Trusted Open System[C]. Proceedings of Information Security and Privacy Sydney, Australia. Springer, 2004, pp. 86-97.
[125] Seshadri A, Luk M, Perrig A, et al. Externally Verifiable Code Execution[J]. Communications of the ACM, 2006, 49(9): 45-49.
[126] Gasmi Y, Sadeghi AR, Stewin P, et al. Beyond Secure Channels[C]. Proceedings of the 2007 ACM workshop on Scalable trusted computing. Alexandria, Virginia, USA. ACM, New York NY USA, 2007, pp. 30-40.
[127] Chen L, Zhang HG, Zhang LQ, et al. A New Information Measurement Scheme Based on TPM for Trusted Network Access[C]. Proceedings of International Conference on Computational Intelligence and Security Workshops. Harbin, China. IEEE, NW Washington, DC USA, 2007, pp. 506-509.
[128] Luo AA, Lin C, Chen Z, et al. TNC-compatible NAC System implemented on Network Processor[C]. Proceedings of IEEE Conference on Local Computer Networks. Clontarf Castle, Dublin, Ireland. IEEE, NW Washington, DC USA, 2007, pp. 1069-1075.
[129] Vasiliadis DC, Rizos GE, Steriou E, et al. A trusted network model using the lightweight directory access protocol[C]. Proceedings of WSEAS International Conference on Applied Informatics and Communications. Athens, Greece. WSEAS, Stevens Point Wisconsin USA, 2007, pp. 252-256.
[130] Schellekens D, Wyseur B, Preneel B. Remote Attestation on Legacy Operating Systems With Trusted Platform Modules[J]. Electronic Notes in Theoretical Computer Science, 2008, 197(1): 59-72.
[131] Hassan J, Sirisena H, Landfeldt B. Trust-based Fast Authentication for Multiowner Wireless Networks[J]. IEEE Transactions on Mobile Computing, 2008, 7(2):247-261.
[132] Liu W, Yang L, Dai H, Hou B. A New Network Access Control Method and Performance Analysis of Authentication Session[J]. Chinese journal of computers, 2007, 30(10): 1806-1812. (刘伟,杨林,戴浩,侯滨.一种新的网络接入控制方法及其认证会话性能分析.计算机学报[J], 2007, 30(10): 1806-1812)
[133] Tian LQ, Lin C. A kind of game-theoretic control mechanism of user behavior trust based on prediction in trustworthy network[J]. Chinese journal of computers, 2007, 30(11): 1930-1938. (田力勤,林闯.可信网络中的一种基于行为信任预测的博弈控制机制[J].计算机学报, 2007, 30(11): 1930-1938)
[134] Wu YJ, Liang HL, Zhao C. A multi-level security model with least privilege support for trusted subject[J]. Journal of software, 2007, 18(3): 730-738. (武延军,梁洪亮,赵琛.一个支持可信主体特权最小化的多级安全模型[J].软件学报, 2007, 18(3): 730-738)
[135] Zhang XF, Xu F, Shen CX. Research on multilevel security model based on trustworthy state and its application[J]. Acta electronica sinica, 2007, 35(8): 1511-1515. (张晓菲,许访,沈昌祥.基于可信状态的多级安全模型及其应用研究[J].电子学报, 2007, 35(8): 1511-1515)
[136] Forsberg D, Ohba Y, Patil B, Tschofenig H, Yegin A. Protocol for Carrying Authentication for Network Access (PANA)[S]. 2007-09-30.
[137] Calhoun P, Loughney J, Guttman E, Zorn G, Arkko J. Diameter Base Protocol[S]. RFC3588, 2003.
[138] Victor IF. Open diameter Software architecture[EB/OL]. http://diameter.sourceforge.net/ diameter-architecture /index.html. 2008-3-10.
[139] Shamir A. How to share a secret[J] Communications of the ACM, 1979, 22(11): 612-613.
[140] Blakley G. Safeguarding cryptographic keys[C]. Proceedings of AFIPS National Computer Conference, AFIPS Press, New York, 1979, pp. 313-317.
[141] Liu ML, Zhang ZF. Secret Sharing Schemes and Secure Multiparty Computation[M]. Publishing House of Electronics Industry, 2008. (刘木兰,张志芳.密钥共享体制和安全多方计算[M].电子工业出版社, 2008)
[142] Blundo C, De Santis A, Di Crescenzo G, Giorgio Gaggia A, Vaccaro U. Multi-secret sharing schemes[M]. Advances in Cryptology– CRYPTO’94, Y.G.Desmedt,ed.,Lecture Noters in Comuputer Science 839, 1994, pp. 150-163.
[143] Jackson W-A, Martin KM, O’Keefe CM. On sharing many secrets[C]. Proceedings of Asiacrypt, 1994, pp. 42-54.
[144] He J, Dawson E. Multistage secret sharing based on one-way function[J]. Electronics Letters, 1994, 30(19): 1591-1592.
[145] Harn L. Comment: Multistage secret sharing based on one-way function[J]. Electronics Letters, 1995, 31(4): 262.
[146] Chang T-Y, HWang M-S, Yang W-P. A new multi-stage secret sharing scheme using one-way functiont[J].Operating Systems Review, 2005, 39(1): 48-55.
[147] Chien H-Y, Jan J-K, Tseng Y-M. A practical (t,n) multi-secret sharing scheme[J]. IEICE Transactions on Fundamentals, 2000, E83-A(12): 2762-2765.
[148] Yang C-C, Chang T-Y, Hwang M–S. A (t,n) multi-secret sharing scheme[J]. Applied Mathematics and Computation. 2004, 151(2): 483-490.
[149] Pang L-J, Wang Y-M. A new (t,n) multi-secret sharing scheme based on shamir’s secret sharing[J]. Applied Mathematics and Computation, 2005, 167(2): 840-848.
[150] Zhao J, Zhang J, Zhao R. A practical verifiable multi-secret sharing scheme[J]. Compter standards & interfaces, 2007, 29(1): 138-141.
[151] He J, Li LJ, Li XM. Verifiable Multi-secret Sharing Scheme[J]. Computer Engineering, 2009, 35(9):119-120. (贺军,李丽娟,李喜梅.一种新的可验证多秘密共享方案[J].计算机工程, 2009, 35(9): 119-120)
[152] Dehkordi MH, Mashhadi S. New efficient and practical verifiable multi-secret sharing schemes[J]. Information Sciences, 2008, 178(9): 2262-2274.
[2] Siganos G, Faloutsos M, Faloutsos P, Faloutsos C. Power-Laws and the AS-level internet topology[J]. IEEE/ACM Trans on Networking, 2003, 11(4): 514-524.
[3] Jiang Y, Fang BX, Hu MZ, He RQ. An Example of Analyzing the Characteristics of a Large Scale ISP Topology Measured from Multiple Vantage Points[J]. Journal of Software, 2005, 16(5): 846-856. (姜誉,方滨兴,胡铭曾,何仁清.大型ISP网络拓扑多点测量及其特征分析实例[J].软件学报,2005,16(5): 846-856.)
[4] Albert R, Jeong H, Barabási AL. The Internet’s Achilles’heel: Error and attack tolerance of complex networks[J]. Nature, 2000, 406: 378-382.
[5] Cohen R, Erez K, ben-Avraham D, Havlin S. Breakdown of the Internet under Intentional Attack[J]. Physics Review Letters, 2001, 86(16): 3682-3685.
[6] David BC, Carl SY. Infection dynamics on the Internet[J]. Computers & Security, 2005, 24(4): 280-286.
[7] Wu JJ, Gao ZY, Sun HJ. Effects of the cascading failures on scale-free traffic networks[J]. Physica A, 2007, 378(2): 505-511.
[8] Jacobson V, Karels MJ. Congestion Avoidance and Control[J]. ACM Computer Communications Review, 1988, 18(4): 314-329.
[9] Watts DJ. A simple model of global cascades on random networks[J]. Proceedings of the National Academy of Sciences of USA, 2002, 99(9): 5766-5771.
[10] Motter AE, Lai Y-C. Cascade-based attacks on complex networks[J]. Physical Review E, 2002, 66(6): 065102.
[11] Motter AE. Cascade Control and Defense in Complex Networks[J]. Physics Review Letter, 2004, 93(9): 098701.
[12] Gallos LK, Cohen R, Argyrakis P, Bunde A, Havlin S. Stability and Topology of Scale-Free Networks under Attack and Defense Strategies[J]. Physics Review Letter, 2005, 94: 188701.
[13] Wang J, Liu YH, Zhu JQ, Mi LM. Simple cascading failures model of Internet[J]. Journal of University of Shanghai for Science and Technology, 2008, 30(3): 215-220.(王健,刘衍珩,朱建启,糜利敏.一种简单的Internet级联故障模型[J].上海理工大学学报, 2008, 30(3): 215-220.)
[14] Brandes U. A faster algorithm for betweenness centrality[J]. Journal of Mathematical Sociology, 2001, 25(2): 163-177.
[15] Bollobás B. Random Graphs[M]. 2nd ed., London: Academic Press, 1985.
[16] Barabási AL, Albert R. Emergence of scaling in random networks[J]. Science, 1999, 286(5439): 509-511.
[17] Shen B, Gao ZY. Dynamical properties of transportation on complex networks[J]. Physica A, 2008, 387(5-6): 1352-1360.
[18] Zheng JF, Gao ZY, Zhao XM. Modeling cascading failures in congested complex networks[J]. Physica A, 2007, 385(2): 700-706.
[19] Ohira T, Sawatari R. Phase transition in computer network traffic model[J]. Physical Review E, 1998, 58(1): 193-195.
[20] Latora V, Marchiori M. Efficient Behavior of Small-World Networks[J]. Physics Review Letter, 2001, 87(19): 198701.
[21] Wu JJ, Sun HJ, Gao ZY. Cascading failures on weighted urban traffic equilibrium network[J]. Physica A, 2007, 386(1): 407-413.
[22] Tadi? B, Rodgers GJ, Thurner S, Transport on Complex Networks: Flow, Jamming and Optimization[J]. International Journal of Bifurcation and Chaos, 2007, 17(7): 2363-2385.
[23] Cholvi V. Dissemination of information in complex networks with congestion[J]. Physica A, 1 July 2006, 366: 571-577.
[24] Kim D-H, Motter AE. Resource allocation pattern in infrastructure networks[J]. Journal of Physics A: Mathematical and Theoretical., 2008, 41(22): 224019.
[25] Wang J, Liu YH, Jiao Y, Hu HY. Cascading Dynamics in Congested Complex Networks[J]. European Physical Journal B. 2009, 67(1):95-100.
[26] Valverde S, Cancho RF, SoléRV. Scale free networks from optimal design[J]. Europhysics Letters, 2002, 60(4): 512-517.
[27] Alessandro PS. de Moura, Lai Y-C, Motter AE. Signatures of small-world and scale-free properties in large computer programs[J]. Physical Review E, 2003, 68(1): 017102.
[28] He KQ, Peng R, Liu J, He F, Liang P, Li B. Design methodology of networked software evolution growth based on software pattern[J]. Journal of Systems Science and Complexity, 2006, 19(2): 157-181.
[29] Jenkins S, Kirk SR. Software architecture graphs as complex networks: A novel partitioning scheme to measure stability and evolution[J]. Information Sciences, 2007, 177(12): 2587-2601.
[30] Antiqueira L, Oliveira Jr ON, Costa L da F, Nunes VG das M. A complex network approach to text summarization[J]. Information Sciences, 2009, 179(5): 584-599.
[31] Cai KY, Yin BB. Software execution processes as an evolving complex network[J]. Information Sciences, 2009, 179(12): 1903-1928.
[32] Li DY, Han YN, Hu J. Complex Network Thinking in Software Engineering[C]. International Conference on Computer Science and Software Engineering, Dec. 12-14, 2008, Wuhan, China, pp.264-268.
[33] Myers CR. Software systems as complex networks: structure, function, and evolvability of software collaboration graphs[J]. Physical Review E, 2003, 68(4): 046116.
[34] Tsipenyuk K, Chess B, McGraw G. Seven Pernicious Kingdoms: A Taxonomy of Software Security Errors[J]. IEEE Security & Privacy, 2006, 3(6): 81-84.
[35] SNLC[DB/OL]. Available at http://en.pudn.com/downloads194/sourcecode/compiler/detail914984_en.html
[36] Kleinberg J. The Wireless Epidemic[J]. Nature, 2007, 449(7160): 287-288.
[37] Tanachaiwiwat S, Helmy A. Encounter-based worms: Analysis and defense[J]. Ad Hoc Networks, 2009, 7(7): 1414-1430.
[38] Xiong YP, Sun LM, Niu JW, Liu Y. Opportunistic Networks[J]. Journal of Software, 2009, 20(1): 124-137. (熊永平,孙利民,牛建伟,刘燕.机会网络[J].软件学报, 2009, 20(1): 124-137.)
[39] Coull SE., Szymanski BK. On the development of an internetwork-centric defense for scanning worms[J]. Computers & Security 2009, 28(7): 637-647.
[40] Stephenson B, Sikdar B. A Quasi-Species Model for the Propagation and Containment of Polymorphic Worms[J]. IEEE Transactions on Computers 2009, 58(9): 1289-1296.
[41] Wang J, Liu YH, Tian DX, Wei D. Internet Worm Early Detection and Response Mechanism[J]. Journal of China Universities of Posts and Telecommunications, 2007, 14(3): 79-84. (王健,刘衍珩,田大新,魏达. Internet蠕虫早期检测与响应机制[J].中国邮电高校学报(英文版). 2007, 14(3): 79-84.)
[42] Rhodesa CJ, Nekovee M. The opportunistic transmission of wireless worms between mobile devices[J]. Physica A, 2008, 387(27): 6837-6844.
[43] Hu H, Myers S, Colizza V, Vespignani A. WiFi Epidemiology: Can Your Neighbors' Router Make Yours Sick?[J]. Proceedings of the National Academy of Sciences, 2009, 106(5): 1318-1323.
[44] Lexus Computers Infected Via Bluetooth [DB/OL]. http://it.slashdot.org/it/05/01/26/188224.shtml?tid=220&tid=172&tid=193&tid=190&tid=218, 2005-01-26.
[45] Pu Wang, Marta C. González, César A Hidalgo, Albert-LászlóBarabási. Understanding the Spreading Patterns of Mobile Phone Viruses[J]. Science, 2009, 324(5930): 1071-1076.
[46] Khayam S, Radha H. Analyzing the Spread of Active Worms over VANET[C]. Proceedings of ACM international workshop on vehicular ad hoc networks, Philadelphia, PA, USA. Oct. 1, 2004, pp. 86–87.
[47] Nekovee M. Modeling the Spread of Worm Epidemics in Vehicular Ad Hoc Networks[C]. Proceedings of IEEE Vehicular Technology Conference, Montréal, Canada, Sep. 25-28, 2006, pp. 841-845.
[48] Cheng L, Shakya R. Worm Spreading and Patching in Inter-vehicle Communications[J]. International Journal of Communication Networks and Information Security. 2010, 2(1): 50-53.
[49] Treiber M, Hennecke A, Helbing D. Congested traffic states in empirical observations and microscopic simulations[J]. Physical Review E, 2000, 62(2): 1805-1824.
[50] Rappaport T. Wireless Communications, Principle and Parctice [M]. Englewood Cliffs, NJ: Prentice-Hall, 2000.
[51] Wang J, Liu YH, Jiao Y. A New Cascading Failure Model with Delay Time in Congested Complex Networks[J]. Journal of Systems Science and Systems Engineering.2009, 18(3): 369-381.
[52] VanetMobiSim[DB/OL]. Available at http://vanet.eurecom.fr.
[53] Nekovee M. Worm epidemics in wireless ad hoc networks[J]. New Journal of Physics. 2007, 9(June): 189.
[54] Tian B, Towsley D.On distinguishing between Internet power law topology generators[C]. Proceedings of the IEEE INFOCOM 2002, Vol 2.New York:IEEE, 2002, pp. 638-647.
[55] Zhang Y, Zhang HL, Fang BX. A survey on Internet topology modeling[J]. Journal of software, 2004, 15(8): 1220-1226. (张宇,张宏莉,方滨兴. Internet拓扑建模综述[J].软件学报, 2004,15(8): 1220-1226)
[56] Waxman BM. Routing of multipoint connections[J]. IEEE Journal on Selected Areas in Communications, 1988, 6(9): 1617-1622.
[57] Doar MB. A better model for generating test networks[C]. Proceedings of IEEE Global Internet, London:IEEE, 1996, pp. 86-93.
[58] Calvert KI, Doar MB, Zegura EW. Modeling Internet topology[J]. IEEE Communication Magazine, 1997, 35(6): 160-163.
[59] Winick J, Jamin S. Inet-3.0 Internet topology generator [R]. Technical Report, CSE-TR-456-02, Ann Arbor: University of Michigan, 2002.
[60] Albert R, Barabási AL. Topology of Evolving Networks: Local Events and Universality[J]. Physical Review Letters, 2000, 85(24):5234.
[61] Bar S, Gonen M, Wool A. An Incremental Super-Linear Preferential Internet Topology Model[C]. Proceedings of the 5th Annual Passive and Active Measurement Workshop. LNCS 3015, 2004, pp. 53-62.
[62] Tangmunarunkit H, Govindan R, Jamin S, Shenker S, Willinger W. Network topology generators: Degree-based vs. structural[J]. ACM SIGCOMM Computer Communication Review, 2002: 147-159.
[63] Li L, Alderson D, Willinger W, Doyle J. A first-principles approach to understanding the internet's router-level topology[J]. ACM SIGCOMM Computer Communication Review, 2004, 34(4):3-14.
[64] Fabrikant A, Koutsoupias E, Papadimitriou C. Heuristically optimized trade-offs: A new paradigm for power law in the Internet[C]. Proceedings of the 29th International Colloquium on Automata, Languages and Programming. 2002, pp. 110-122.
[65] Alvarez-Hamelin J, Schabanel N. An Internet graph model based on trade-off optimization[J]. European Physical Journal. 2004, 38:231-237.
[66] Siganos G, Faloutsos M, Faloutsos P, Faloutsos C. Power laws and the AS-level Internet topology [J]. IEEE/ACM Trans. On Networking, 2003, 11(4):514-524.
[67] D Alderson, L Li, W Willinger, J Doyle. Understanding Internet Topology: Principles, Models, and Validation [J]. IEEE/ACM Trans. On Networking, 2005, 13(6):1205-1218.
[68] Jiang Y, Fang BX, Hu ZM, He RQ. An Example of Analyzing the Characteristics of a Large Scale ISP Topology Measured from Multiple Vantage Points[J]. Journal of software, 2005, 16(5): 846-856. (姜誉,方滨兴,胡铭曾,何人清.大型ISP网络拓扑多点测量及其特征分析实例[J].软件学报, 2005, 16(5): 846-856)
[69] Spring N, Mahajan R, Wetherall D, Anderson T. Measuring ISP topologies with rocketfuel[J]. IEEE/ACM Trans. On Networking, 2004, 2(12): 2-16.
[70] Magoni D. Tearing Down the Internet[J]. IEEE Journal on Selected Areas in Communications, 2003, 6(21): 949-960.
[71] Golbeck J. Weaving a web of trust[J]. Science, 2008, 321(5896): 1640-1641.
[72] Mui L, Mohtashemi M, Halberstadt A. A computational model of trust and reputation[C]. Proceedings of the 35th Hawaii International conference on system sciences, Big Island, HI, USA, Jan. 2002, pp. 188-196.
[73] Golbeck J, Parsia B, Hendler J. Trust networks on the semantic web[C]. Proceedings of Cooperative Intelligent Agents, Helsinki, Finland, Aug. 27-29, 2003, pp. 238-249.
[74] Guha R, Kumar R, Raghavan P, Tomkins A. Propagation of trust and distrust[C]. Proceedings of World Wide Web Conference, New York, USA, May 17-22, 2004, pp. 403-412.
[75] Byrne D, Griffitt W, Stefaniak D. Attraction and Similarity of Personality Characteristics[J]. Journal of Personality and Social Psychology, 1967, 5(1): 82-90.
[76] Reibstein DJ. What attracts customers to online stores, and what keeps them coming back? [J]. Journal of the Academy of Marketing Science 2002, 30(4): 465-473.
[77] Senecal S, Nantel J. The influence of online product recommendations on consumers’online choices[J]. Journal of Retailing 2004, 80(1): 159-169.
[78] Komiak SYX, Benbasat I. The Effects of Personalization and Familiarity on Trust and Adoption of Recommendation Agents[J]. MIS Quarterly 2006, 30(4): 941-960.
[79] Quercia D, Hailes S, Capra L. TRULLO-local trust bootstrapping for ubiquitous devices[C]. Proceedings of IEEE Mobiquitous, Philadelphia, PA, USA, Aug. 6-10, 2007, pp. 1-9.
[80] Quercia D, Hailes S, Capra L. Lightweight distributed trust propagation[C]. Proceedings of 7th IEEE International Conference on Data Mining, Omaha, Nebraska, USA, Oct. 28-31, 2007, pp. 282-291.
[81] Ba S, Whinston AB, Zhang H. Building trust in online auction markets through an economic incentive mechanism[J]. Decision Support Systems, 2002, 35(3): 273–286.
[82] Kollock P. The production of trust in online markets[C]. In E. J. Lawler amd M. Macy, S. Thyne, and H. A. Walker, editors, Advances in Group Processes, volume 16, pp. 99–123. JAI Press, 1999.
[83] Snyder JM. Online auction fraud: Are the auction houses doing all they should or could to stop online fraud[J]. Federal Communications Law Journal, 2000, 52: 453–472.
[84] Yu B, Singh MP. A social mechanism of reputation management in electronic communities[C]. Proceedings of 4th International Workshop on Cooperative Information Agents, Boston, USA, Jul. 4 - 7, 2000, pp. 154–165.
[85] Kamvar SD, Schlosser MT, Garcia-Molina H. The eigentrust algorithm for reputation management in P2P networks[C]. Proceedings of the 12th International World Wide Web Conference, May 20-24, 2003, Budapest, HUNGARY, pp. 640–651.
[86] Nass C, Moon Y, Green N. Are computers gender-neutral? Gender stereotypic responses to computers[J]. Journal of Applied Social Psychology, 1997, 27(10): 864–876.
[87] Moon Y. Don’t blame the computer: When self-disclosure moderates the self-serving bias[J]. Journal of Consumer Psychology, 2003, 13(1&2): 125–137.
[88] Hess T, Fuller M, Mathew J. Involvement and decision-making performance with a decision aid: The influence of social multimedia, gender, and playfulness[J]. Journal of Management Information Systems, 2006, 22(3): 15–54.
[89] Al-Natour S, Benbasat I, Cenfetelli R. The role of similarity in ecommerce interactions: The case of online shopping assistants[J]. J. of the Association for Information Systems, 2006, 7(12): 821-861.
[90] Al-Natour S, Benbasat I, Cenfetelli R. The Effects of Process and Outcome Similarity on Users' Evaluations of Decision Aids[J]. Decision Sciences, 2008, 39(2): 175-211.
[91] Aksoy L, Bloom PN. Impact of ordered alternative lists on decision quality. The role of perceived similarity[C]. Proceedings of the Society for Consumer Research Winter Conference, Scottsdale, AZ, 2001.
[92] Lichtenthal JD, Tellefsen T. Toward a theory of business buyer-seller similarity[J]. Journal of Personal Selling and Sales Management, 2001, 21(1): 1–14.
[93] Levin DZ, Cross R, Abrams LC. Why should I trust you? Predictors of interpersonal trust in a knowledge transfer context[J]. Journal of Applied Psychology, 2006, 84(1): 123-136.
[94] Massa P, Avesani P. Trust-aware Recommender Systems[C]. Proceedings of ACM Recommender Systems Conference, Minneapolis, Minnesota, USA, Oct. 19-20, 2007, pp. 17-24.
[95] Ramana K S, Chari A A, Kasiviswanth N. Trust Based Security Routing in Mobile Adhoc Networks[J], International Journal on Computer Science and Engineering, 2010, 2(2): 259-263.
[96] Wang XD, Huo GC, Sun HY, et al. An Opportunistic Routing for MANET Based on Partial Network Coding[J]. Acta Electronica Sinica, 2010, 38(8): 1736-1740.(王晓东,霍广城,孙海燕,等.移动自组网中基于部分网络编码的机会主义路由[J].电子学报, 2010, 38(8): 1736-1740)
[97] Wang GD, Wang G. An Energy-Aware and Beaconless Geographic Routing for Mobile Ad Hoc Network[J]. Acta Electronica Sinica, 2010, 38(7): 1547-1551. (王国栋,王钢. MANET中一种具有能量意识的无信标地理路由算法[J].电子学报, 2010, 38(7): 1547-1551)
[98] Raya M, Hubaux J-P.Securing Vehicular Ad Hoc Networks[J], Journal of Computer Security, 2007, 15(1): 39-68.
[99] Adibi S, Agnew GB. Multilayer flavoured dynamic source routing in mobile ad-hoc networks[J], IET Communications, 2008, 2(5): 690-707.
[100] Johnson D, Maltz D. Dynamic source routing in ad hoc wireless networks[M]. In Imielinski T. and Korth H., editors, Mobile Computing, chapter 5, 153-181.Kluwer Academic Publishers, 1996.
[101] Perkins C, Belding-Royer E, Das S. Ad-hoc On-demand Distance Vector (AODV) Routing[S], IETF RFC 3561, July 2003.
[102] Peng SC, Jia WJ, Wang GJ, Wu J, Guo MY. Trusted Routing Based on Dynamic Trust Mechanism in Mobile Ad-Hoc Networks[J]. IEICE TRANSACTIONS on Information and Systems, 2010, E93-D (3): 510-517.
[103] Pirzada AA, McDonald C. Establishing trust in pure ad-hoc networks[C]. Proceedings of Australasian conference on Computer science, January 2004, Vol.56, pp.47-54.
[104] Anantvalee T, Wu J. Reputation-Based System for Encouraging the Cooperation of Nodes in Mobile Ad Hoc Networks[C]. Proceedings of IEEE International Conference on the Communications, June 2007, pp.3383-3388.
[105] Peng SC, Jia WJ, Wang GJ. Voting-Based Clustering Algorithm with Subjective Trust and Stability in Mobile Ad-Hoc Networks[C]. Proceedings of IEEE/IFIP International Conference on Embedded and Ubiquitous Computing, December 2008, Vol.2, pp.3-9.
[106] Luo J, Liu X, Zhang Y, Ye D, Xu Z. Fuzzy Trust Recommendation Based on Collaborative Filtering for Mobile Ad-hoc Networks[C]. Proceedings of IEEE Conference on Local Computer Networks, October 2008, pp.305-311.
[107] Li J, Li R, Kato J. Future Trust Management Framework for Mobile Ad Hoc Networks[J], IEEE Communications Magazine, 2008, 46(4): 108-114.
[108] Marti S, Giuli TJ, Lai K, Baker M. Mitigating routing misbehavior in mobile ad hoc networks[C]. Proceedings of International Conference on Mobile Computing and Networking, August 2000, pp.255-265.
[109] Buchegger S, Boudec Le J-Y. Performance Analysis of the CONFIDANT Protocol: Cooperation of Nodes - Fairness in Dynamic Ad-hoc Networks[C]. Proceedings of ACM International Symposium on Mobile Ad Hoc Networking and Computing, June 2002, pp.226-236.
[110] Winjum E, Spilling P, Kure ?. Trust metric routing to regulate routing cooperation in mobile wireless ad hoc networks[C]. Proceedings of European Wireless, April 2005, pp.399-406.
[111] Pirzada AA, Datta A, McDonald C. Incorporating trust and reputation in the DSR protocol for dependable routing[J], Computer Communications, 2006, 29(15): 2806-2821.
[112] Chen T, Mehani O, Boreli R. Trusted Routing for VANET[C]. Proceedings of International Conference on Intelligent Transport Systems Telecommunications, October 2009, pp.647-652.
[113] Yu M, Leung KK. A Trustworthiness-Based QoS Routing Protocol for Wireless Ad Hoc Networks[J]. IEEE Transactions on Wireless Communications, 2009, 8(4): 1888-1898.
[114] Abusalah L, Khokhar A, Guizani M. Trust Aware Routing in Mobile Ad Hoc Networks[C]. Proceedings of the Global Telecommunications Conference, 27 November - 1 December 2006.
[115] Misra R, Mandal CR. Performance comparison of AODV/DSR on-demand routing protocols for ad hoc networks in constrained situation[C]. Proceedings of IEEE International Conference on Personal Wireless Communications, January 2005, pp.86-89.
[116] Choudhury S, Roy SD, Singh SA. Trust Management in Ad Hoc Network for Secure DSR Routing[M]. In Tarek Sobh, Khaled Elleithy, Ausif Mahmood and Mohammad A.Karim, Editors, Novel Algorithms and Techniques in Telecommunications, Automation and Industrial Electronics, Springer Netherlands, 2008, pp.496-500.
[117] Luo J, Ni X, Yong J. A trust degree based access control in grid environments[J], Information Science, 2009, 179(15): 2618-2628.
[118] Azzedin F, Maheswaran M. Evolving and managing trust in grid computing systems[C]. Proceedings of IEEE Canadian Conference on Electrical and Computer Engineering, May 2002, pp.1424-1429.
[119] Byrne D, Griffitt W, Stefaniak D. Attraction and Similarity of Personality Characteristics[J]. Journal of Personality and Social Psychology, 1967, 5(1): 82-90.
[120] Mundinger J, Le Boudec J.-Y. Analysis of a Reputation System for Mobile Ad-Hoc Networks with Liars[J]. Performance Evaluation, 2008, 65(3-4): 212–226.
[121] Mark C. Trusted Computing– closing that lingering doubt. Network Security[J], 2006, 2006(6): 13-15.
[122] Siewiorek DP, Yang ZX, Chillarege R, et al. Industry trends and research in dependable computing[J]. Chinese journal of computers, 2007, 30(10): 1645-1661.
[123] Balacheff B, Chen L, Pearson S, et al. Trusted Computing Platforms: TCPA Technology in Context[M]. Prentice Hall PTR, Upper Saddle River, NJ, USA, 2002.
[124] Peinado M, Chen Y, England P, et al. NGSCB: A Trusted Open System[C]. Proceedings of Information Security and Privacy Sydney, Australia. Springer, 2004, pp. 86-97.
[125] Seshadri A, Luk M, Perrig A, et al. Externally Verifiable Code Execution[J]. Communications of the ACM, 2006, 49(9): 45-49.
[126] Gasmi Y, Sadeghi AR, Stewin P, et al. Beyond Secure Channels[C]. Proceedings of the 2007 ACM workshop on Scalable trusted computing. Alexandria, Virginia, USA. ACM, New York NY USA, 2007, pp. 30-40.
[127] Chen L, Zhang HG, Zhang LQ, et al. A New Information Measurement Scheme Based on TPM for Trusted Network Access[C]. Proceedings of International Conference on Computational Intelligence and Security Workshops. Harbin, China. IEEE, NW Washington, DC USA, 2007, pp. 506-509.
[128] Luo AA, Lin C, Chen Z, et al. TNC-compatible NAC System implemented on Network Processor[C]. Proceedings of IEEE Conference on Local Computer Networks. Clontarf Castle, Dublin, Ireland. IEEE, NW Washington, DC USA, 2007, pp. 1069-1075.
[129] Vasiliadis DC, Rizos GE, Steriou E, et al. A trusted network model using the lightweight directory access protocol[C]. Proceedings of WSEAS International Conference on Applied Informatics and Communications. Athens, Greece. WSEAS, Stevens Point Wisconsin USA, 2007, pp. 252-256.
[130] Schellekens D, Wyseur B, Preneel B. Remote Attestation on Legacy Operating Systems With Trusted Platform Modules[J]. Electronic Notes in Theoretical Computer Science, 2008, 197(1): 59-72.
[131] Hassan J, Sirisena H, Landfeldt B. Trust-based Fast Authentication for Multiowner Wireless Networks[J]. IEEE Transactions on Mobile Computing, 2008, 7(2):247-261.
[132] Liu W, Yang L, Dai H, Hou B. A New Network Access Control Method and Performance Analysis of Authentication Session[J]. Chinese journal of computers, 2007, 30(10): 1806-1812. (刘伟,杨林,戴浩,侯滨.一种新的网络接入控制方法及其认证会话性能分析.计算机学报[J], 2007, 30(10): 1806-1812)
[133] Tian LQ, Lin C. A kind of game-theoretic control mechanism of user behavior trust based on prediction in trustworthy network[J]. Chinese journal of computers, 2007, 30(11): 1930-1938. (田力勤,林闯.可信网络中的一种基于行为信任预测的博弈控制机制[J].计算机学报, 2007, 30(11): 1930-1938)
[134] Wu YJ, Liang HL, Zhao C. A multi-level security model with least privilege support for trusted subject[J]. Journal of software, 2007, 18(3): 730-738. (武延军,梁洪亮,赵琛.一个支持可信主体特权最小化的多级安全模型[J].软件学报, 2007, 18(3): 730-738)
[135] Zhang XF, Xu F, Shen CX. Research on multilevel security model based on trustworthy state and its application[J]. Acta electronica sinica, 2007, 35(8): 1511-1515. (张晓菲,许访,沈昌祥.基于可信状态的多级安全模型及其应用研究[J].电子学报, 2007, 35(8): 1511-1515)
[136] Forsberg D, Ohba Y, Patil B, Tschofenig H, Yegin A. Protocol for Carrying Authentication for Network Access (PANA)[S]. 2007-09-30.
[137] Calhoun P, Loughney J, Guttman E, Zorn G, Arkko J. Diameter Base Protocol[S]. RFC3588, 2003.
[138] Victor IF. Open diameter Software architecture[EB/OL]. http://diameter.sourceforge.net/ diameter-architecture /index.html. 2008-3-10.
[139] Shamir A. How to share a secret[J] Communications of the ACM, 1979, 22(11): 612-613.
[140] Blakley G. Safeguarding cryptographic keys[C]. Proceedings of AFIPS National Computer Conference, AFIPS Press, New York, 1979, pp. 313-317.
[141] Liu ML, Zhang ZF. Secret Sharing Schemes and Secure Multiparty Computation[M]. Publishing House of Electronics Industry, 2008. (刘木兰,张志芳.密钥共享体制和安全多方计算[M].电子工业出版社, 2008)
[142] Blundo C, De Santis A, Di Crescenzo G, Giorgio Gaggia A, Vaccaro U. Multi-secret sharing schemes[M]. Advances in Cryptology– CRYPTO’94, Y.G.Desmedt,ed.,Lecture Noters in Comuputer Science 839, 1994, pp. 150-163.
[143] Jackson W-A, Martin KM, O’Keefe CM. On sharing many secrets[C]. Proceedings of Asiacrypt, 1994, pp. 42-54.
[144] He J, Dawson E. Multistage secret sharing based on one-way function[J]. Electronics Letters, 1994, 30(19): 1591-1592.
[145] Harn L. Comment: Multistage secret sharing based on one-way function[J]. Electronics Letters, 1995, 31(4): 262.
[146] Chang T-Y, HWang M-S, Yang W-P. A new multi-stage secret sharing scheme using one-way functiont[J].Operating Systems Review, 2005, 39(1): 48-55.
[147] Chien H-Y, Jan J-K, Tseng Y-M. A practical (t,n) multi-secret sharing scheme[J]. IEICE Transactions on Fundamentals, 2000, E83-A(12): 2762-2765.
[148] Yang C-C, Chang T-Y, Hwang M–S. A (t,n) multi-secret sharing scheme[J]. Applied Mathematics and Computation. 2004, 151(2): 483-490.
[149] Pang L-J, Wang Y-M. A new (t,n) multi-secret sharing scheme based on shamir’s secret sharing[J]. Applied Mathematics and Computation, 2005, 167(2): 840-848.
[150] Zhao J, Zhang J, Zhao R. A practical verifiable multi-secret sharing scheme[J]. Compter standards & interfaces, 2007, 29(1): 138-141.
[151] He J, Li LJ, Li XM. Verifiable Multi-secret Sharing Scheme[J]. Computer Engineering, 2009, 35(9):119-120. (贺军,李丽娟,李喜梅.一种新的可验证多秘密共享方案[J].计算机工程, 2009, 35(9): 119-120)
[152] Dehkordi MH, Mashhadi S. New efficient and practical verifiable multi-secret sharing schemes[J]. Information Sciences, 2008, 178(9): 2262-2274.