多样化的可控匿名通信系统

随着网络通信技术的发展,Tor匿名通信系统在得到广泛应用的同时暴露出匿名性较弱等不安全因素,针对上述问题,基于节点的区域管理策略提出一种多样化的可控匿名通信系统(DC-ACS),DC-ACS中多样化匿名链路建立机制根据用户需求选择相应区域的节点完成匿名通信链路的建立,同时基于行为信任的监控机制实现对用户恶意匿名行为的控制,并且保证了发送者和接收者对匿名链路入口节点和出口节点的匿名性。通过与Tor匿名通信系统的比较,DC-ACS在具有匿名性的同时,具有更高的安全性和抗攻击的能力,解决了Tor匿名通信系统所存在的安全隐患。     

一种适于匿名通信系统的主动探测机制

匿名通信系统需要系统成员共同参与信息转发,恶意成员和不可靠成员将导致系统的匿名性能下降。在比特承诺方案的基础上,提出了一种适于匿名通信系统的主动探测机制,理论分析表明该机制能有效地匿名探测成员是否在线或假冒,同时通过认证机制确保数据在传输过程中免遭中间篡改攻击。     

身份匿名认证技术在通信网络中的应用探究

身份匿名认证技术在通信网络中应用不仅能够保证节点真实身份对外的保密性,而且对保证通信网络的安全性也具有重要的意义,同时还能够有效实现节点接入基站的匿名性认证。下面本研究首先分析了身份匿名认证机制,然后详细分析身份匿名认证技术的性能及安全性,最后通过仿真实验验证了此技术在通信网络中应用的安全性。     

一种P2P匿名控制身份鉴别机制

为解决一般的身份鉴别机制不适用于具有匿名通信要求的P2P网络系统模型的难题。通过对Diffle-Hellman密钥协商协议进行改进,并结合采用RSA数字签名协议,以及零知识证明GQ协议,提出了一种新的基于服务令牌对P2P匿名通信系统中的通信双方进行身份鉴别的机制。该机制在保证P2P匿名通信系统各种普遍特征的前提下,通过在P2P匿名通信系统中引入可信第三方节点,针对P2P匿名通信系统中各通信节点进行匿名控制和行为管理,同时既可抵御各种常见网络攻击的威胁,又有效实现了P2P匿名通信系统的身份鉴别,从而有效提高了P2P匿名通信系统的安全性,加强了此种系统的管理能力。     

一种不可信环境下的匿名位置辅助路由激励机制

不可信环境下的路由性能问题,是移动自组织网(mobile ad-hoc networks,MANET)匿名路由协议面临的主要问题之一.本文为在不可信环境下通过对自私节点进行高效的协作激励,提高匿名路由协议的性能,提出了一种基于哈希链的匿名位置辅助路由激励机制.该机制利用哈希链在计算上的高效性和安全上的不可逆性,达成了对匿名数据转发节点的即时激励;通过基于支付代价的路由选择机制,优化了现有位置辅助路由机制的路由发现过程.匿名性分析证明,该机制能保证参与路由节点的匿名性.效率评价表明,在数据传输总量较大时,该机制对路由性能的影响很小,且该机制在较小规模的网络中有更好的性能.     

一种运用重路由技术的匿名通信系统改进模型研究

当前已有不少基于重路由的匿名通信系统,但现有的匿名通信系统大部分在获得匿名的同时却牺牲了效率。为设计既安全又高效的匿名通信系统,提出基于重路由技术的匿名通信系统改进模型,对匿名系统的匿名度进行探究。模型根据敌手攻击能力的不同,提出两种改进方式:对于敌手攻击能力为1的情形,提出单一节点和多节点的信息熵偏差模型,该模型能够用于不同系统之间匿名性的比较,客观、合理地给出各个节点的权重;对于敌手攻击能力为0.95的情形,引入模糊熵的概念与非线性规划模型,运用模糊熵与概率熵相结合,充分利用模糊随机变量整合所有不确定性,理论分析表明,改进后的重路由算法均能有效保证匿名性能。基于给定的匿名系统信息发送概率,设计实例求解系统的匿名性并做比较分析,实验结果表明,改进后的匿名系统度量模型具有较好的可靠性与优越性。     

匿名技术的研究进展

对匿名技术的研究情况进行了综述。统一给出了关联性、匿名性、假名等概念,探讨了Crowds、洋葱路由、Mix nets等匿名通信的实现机制,介绍了有关的研究进展,指出了匿名性度量、环签名和群签名等匿名签名算法、匿名应用中信赖的建立等技术中需要进一步研究的问题。     

一种签名长度固定的基于身份的环签名方案

环签名作为一种匿名通信技术,可以使签名人具有匿名性。在以往提出的环签名方案中,签名长度与环成员个数成正比,这是环签名的一个公开问题。该文使用双线性对,并基于累加器技术,提出了一种签名长度固定的基于身份的环签名方案,并证明了其安全性。方案既能保证消息发送者的匿名性,又可使得到的签名长度与环成员个数无关,解决了环签名的公开问题。     

一种基于DAA的强匿名性门限签名方案

针对目前大多数门限签名方案不能实现签名成员匿名或匿名效果比弱的问题,该文提出了一种带有子密钥分发中心的强匿名性(n, t)门限签名方案。方案主要基于可信计算组织在其v1.2标准中采用的直接匿名认证(Direct Anonymous Attestation, DAA)方案,以及零知识证明和Feldman门限秘密共享等技术实现。相较已有方案,该方案即使在签名验证者和子密钥分发中心串通的情况下,也能够实现子签名的不可追踪性,也即可确保子签名成员的强匿名性。分析显示,方案除具有强匿名性外还具备签名子密钥不可伪造、子签名可验证以及一定的鲁棒性等特征。该方案在匿名表决等一些对匿名性要求较高的场合中有着重大的应用价值。     

基于比特承诺的可撤销匿名电子检举系统

一个安全的电子检举系统必须满足检举人身份匿名性的要求,保证检举人的隐私,同时在必要的情况下,检举系统也能够提供匿名的撤销。Qiu等提出了一种基于群签名的可撤销匿名的电子检举系统,提供了可撤销的匿名检举,并满足一序列安全性要求,但基于群签名的方案对于大量群成员存在着无法避免的效率问题。文中基于比特承诺协议,提出了一种可撤销匿名的检举方案。该方案在提供了举报过程中对于举报者身份的匿名性的同时,对于可能的恶意举报,在电子检举中心（EIC）和可信第三方（TTP）的协作下,能够撤销匿名,追查责任人。该方案可适用于不同规模的使用人群。     

Rumor Riding: An Anonymity Approach for Decentralized Peer to Peer Systems

The anonymizing peer to peer (P2P) system is frequently incurred additional expense in order to efficiency transfer and various systems execute to disguise the uniqueness privacy considerations issues for their users. Although, an anonymity technique mostly existing path base peer before transmits, it has pre-create an anonymous path. An information as well as maintenance transparency of path is a lot high. In this paper it has been proposed mutual anonymity rumor riding (RR) protocol for decentralization environment P2P systems. The very heavy load path construction carries by RR system using random walk mechanism for free initiate peers. We evaluate with before RSA based and also anonymity approach based on AES, RR get extra benefit of lower cryptographic overhead mostly to get anonymity using asymmetric cryptographic algorithm. We illustrate design and effectiveness during the simulations by trace driven. RR is very effect and efficient than previous protocols the experimental and analytical result shows us.     

A quantitative analysis of anonymous communications

This paper quantitatively analyzes anonymous communication systems (ACS) with regard to anonymity properties. Various ACS have been designed & implemented. However, there are few formal & quantitative analyzes on how these systems perform. System developers argue the security goals which their systems can achieve. Such results are vague & not persuasive. This paper uses a probabilistic method to investigate the anonymity behavior of ACS. In particular, this paper studies the probability that the true identity of a sender can be discovered in an ACS, given that some nodes have been compromised. It is through this analysis that design guidelines can be identified for systems aimed at providing communication anonymity. For example, contrary to what one would intuitively expect, these analytic results show that the probability that the true identity of a sender can be discovered might not always decrease as the length of communication path increases.     

Co-operation Enforcing Reputation-Based Detection Techniques and Frameworks for Handling Selfish Node Behaviour in MANETs: A Review

In Mobile Ad hoc Network, co-operation between mobile nodes is inevitable for enabling reliable network connectivity due to the absence of pre-deployed infrastructure. In such a network, mobile nodes spend significant amount of energy for detecting routes and forwarding packets in order to enforce co-operation. The energy drain of mobile nodes due to the above fact induces them to refuse forwarding of packets for their neighbouring nodes in order to participate in the network. The mobile nodes that forward their own packets but drop the packets received from neighbours are known as selfish nodes. Detecting selfish nodes is one of the most challenging issues that need to be addressed for enforcing co-operation. The core objective of this research work is to essentially identify and highlights various reputation-based selfish node mitigation approaches available in the literature with their merits and limitations. This paper presents context-aware reputation-based selfish node mitigation approaches that are classified into three categories viz., History-based reputation mechanism, Condition probability-based reputation mechanism and Futuristic probability-based reputation mechanism. This paper further presents a review on a number of selfish node mitigation frameworks and also aims in emphasizing the role of statistical reliability co-efficient that could aid in effective and efficient mitigation of selfish nodes.     

An efficient anonymous communication protocol for wireless sensor networks

Anonymous communication is very important for many wireless sensor networks, because it can be used to hide the identity of important nodes, such as the base station and a source node. In sensor networks, anonymous communication includes several important aspects, such as source anonymity, communication relationship anonymity, and base station anonymity. Existing sensor network anonymous schemes either cannot achieve all the anonymities or have large computation, storage, and communication overheads. In this paper, we propose an efficient anonymous communication protocol for sensor networks that can achieve all the anonymities while having small overheads on computation, storage, and communication. We compare our anonymous communication protocol with several existing schemes, and the results show that our protocol provides strong anonymity protection and has low overheads. Copyright © 2011 John Wiley & Sons, Ltd.     

基于信誉值维护的机会网络自私节点检测机制

机会网络中自私节点的存在严重影响路由转发的性能。为在路由时避开此类节点、消除其对网络性能的影响,提出了一种基于信誉值维护的自私节点检测机制,通过两跳ACK消息来监测节点行为,利用监测信息计算节点的信誉值,并将其作为判断节点是否自私的依据。在多种路由算法上加载该检测机制进行仿真实验,结果表明该检测机制可准确识别机会网络中的自私节点,提高消息投递的成功率,并能有效控制消息副本数和网络开销。     

Trust Based Intrusion Detection Technique to Detect Selfish Nodes in Mobile Ad Hoc Networks

The applications and protocols conceived for mobile ad hoc networks rely on the assumption of cooperation amongst the mobile nodes because of lacking infrastructure. All nodes have to spend their precious resources (e.g. battery power, memory, computational power, and network bandwidth) for routing and packet forwarding operations for other nodes, in a cooperative way in the network. However, there are some nodes that may intentionally turn themselves to behave selfishly in order to conserve their valuable resources. The selfish behaviour of such nodes drastically reduces the desired degree of cooperation amongst the mobile nodes. Over the course of time, the non-cooperative activities of, such selfish nodes would paralyze the normal functioning of the whole network. Therefore, these types of nodes should be detected and isolated from the network, as soon as they begin to exhibit their selfish behaviour. In this paper, a dynamic trust based intrusion detection technique is presented to detect and isolate the selfish nodes from the network, where the direct trust degree based on direct communication interactions and indirect (recommended) trust degree based on the neighbours’ recommendations are taking into account to accurately judge the selfishness nature of the nodes. The results obtained throughout the simulation experiments clearly show the feasibility and effectiveness of the proposed intrusion detection technique.     

Assessing the influence of selfishness on the system performance of gossip based vehicular networks

In delay tolerant vehicular networks, gossip is an efficient forwarding scheme, which significantly reduces the message transmission overhead while maintaining a relatively high transmission rate in the high mobility vehicular environment. This mechanism requires vehicles as the network nodes to forward messages according to the system-defined gossip probability in a cooperative and selfless way among all the vehicles in the system. However, in the real word vehicular networks, most of the vehicular nodes exhibit selfish and non-collaboration behaviors to reduce the gossip probability in order to save their own energy and other limited resources in the vehicular nodes. In this paper, we study how node selfishness influences the performance of energy-constrained gossip forwarding based vehicular networks. We consider two typical forms of selfishness in the realistic vehicular networks: individual selfishness and social selfishness, and study the networking performance by focusing on the average message transmission delay and mean transmission cost. First, we model the message transmission process with selfish behaviors in the gossip forwarding based delay tolerant vehicular networks using a continuous time Markov chain. Based on this useful model, we derive closed-form formulae for average message transmission delay and mean transmission cost. Then, we give extensive numerical results to analyze the impact of selfishness on system performance of the vehicular networks. The results show that gossip forwarding in delay tolerant vehicular networks is robust to selfish behaviors since even when they increase the message transmission delay, there is a gain on the message transmission cost.