This paper proposes an improved non-repudiation protocol after pointing out two attacks on an existing non-repudiation protocol.To analyze the improved protocol,it also proposes an extension of Kailar logic.Using the ...This paper proposes an improved non-repudiation protocol after pointing out two attacks on an existing non-repudiation protocol.To analyze the improved protocol,it also proposes an extension of Kailar logic.Using the extended Kailar logic,the security analysis of the improved prototocol has been presented.展开更多
With development of electronic com-merce,non-repudiation protocol as the basal component of non-repudiation service has done more and more important functions.Comparing with lots of work on two-party non-repudiation,t...With development of electronic com-merce,non-repudiation protocol as the basal component of non-repudiation service has done more and more important functions.Comparing with lots of work on two-party non-repudiation,there are less work on multi-party non-repudiation protocol.Multi-party protocol is more complex and facing more challenge of collusion attack.In this paper we give a kind of multi-party non-repudiation protocol based on off-line TTP with consistent evidence.Consistent evidence is a property that can not only simplify the process of disputation resolving,but also make the service more friendly to users,which means that whether or not TTP involves,evidences participants obtained are consistent.In the meanwhile we analyze the collusion attack that multi-party protocol facing,our protocol can prevent collusion attack.展开更多
To safeguard the interests of transacting parties,non-repudiation mechanisms need to assure fairness and timeliness.The non-repudiation service currently implemented usually does not consider the requirement of fairne...To safeguard the interests of transacting parties,non-repudiation mechanisms need to assure fairness and timeliness.The non-repudiation service currently implemented usually does not consider the requirement of fairness and the fair non-repudiation protocols to date can not be suitably applied in real environment due to its complex interaction.This paper discusses the transaction-oriented non-repudiation requirement for Web services transaction,analyzes the constraints of the traditional model for the available fair non-repudiation protocols and designs a new Online-TTP fair non-repudiation protocol.The new protocol provides a fair non-repudiation solution to secure Web services transactions and can be embedded into a single Web service call.The protocol adopts evidence chained to decreasing the overhead of evidence verification and management and alleviates the overhead of certificate revocation checking and time-stamp generation for signatures.The protocol has strong fairness,timeliness,efficiency and practicability.展开更多
E-commerce protocols for the electronic purchase of goods are difficult to design and implement due to their complexity and high security demands. Fairness of such protocols in literature highly depends on an addition...E-commerce protocols for the electronic purchase of goods are difficult to design and implement due to their complexity and high security demands. Fairness of such protocols in literature highly depends on an additional TTP（trusted third party）. However, it is difficult to find such a TTP in some situations. In addition, fairness for customers has been neither fully considered nor well satisfied in existing electronic purchasing protocols. In this paper, a new protocol FEP （fair electronic purchase） without a special TTP but an online bank is presented based on a concurrent digital signature scheme. The FEP protocol guarantees fair electronic purchase of goods via electronic payment between consumers, merchants and their online banks. The protocol is practical and the analysis based on the game logics shows that it achieves the properties of viability, fairness, and timeliness.展开更多
Fair exchange protocols play a critical role in enabling two distrustful entities to conduct electronic data exchanges in a fair and secure manner.These protocols are widely used in electronic payment systems and elec...Fair exchange protocols play a critical role in enabling two distrustful entities to conduct electronic data exchanges in a fair and secure manner.These protocols are widely used in electronic payment systems and electronic contract signing,ensuring the reliability and security of network transactions.In order to address the limitations of current research methods and enhance the analytical capabilities for fair exchange protocols,this paper proposes a formal model for analyzing such protocols.The proposed model begins with a thorough analysis of fair exchange protocols,followed by the formal definition of fairness.This definition accurately captures the inherent requirements of fair exchange protocols.Building upon event logic,the model incorporates the time factor into predicates and introduces knowledge set axioms.This enhancement empowers the improved logic to effectively describe the state and knowledge of protocol participants at different time points,facilitating reasoning about their acquired knowledge.To maximize the intruder’s capabilities,channel errors are translated into the behaviors of the intruder.The participants are further categorized into honest participants and malicious participants,enabling a comprehensive evaluation of the intruder’s potential impact.By employing a typical fair exchange protocol as an illustrative example,this paper demonstrates the detailed steps of utilizing the proposed model for protocol analysis.The entire process of protocol execution under attack scenarios is presented,shedding light on the underlying reasons for the attacks and proposing corresponding countermeasures.The developedmodel enhances the ability to reason about and evaluate the security properties of fair exchange protocols,thereby contributing to the advancement of secure network transactions.展开更多
An explicit congestion notification (ECN)-based distributed transport protocol,ARROW-WTCP (AcceleRate tRansmission towards Optimal Window size TCP for Wireless network),was proposed.The ARROW-WTCP enables feasible dep...An explicit congestion notification (ECN)-based distributed transport protocol,ARROW-WTCP (AcceleRate tRansmission towards Optimal Window size TCP for Wireless network),was proposed.The ARROW-WTCP enables feasible deployment of ARROW-TCP from wired to wireless networks by providing a joint design of source and router algorithms.The protocol obtains the actual capacity of the wireless channel by calculating the queue variation in base station (BS) and adjusts the congestion window by using the feedback from its bottleneck link.The simulation results show that the ARROW-WTCP achieves strong stability,max-min fairness in dynamic networks,fast convergence to efficiency without introducing much excess traffic,and almost full link utilization in the steady state.It outperforms the XCP-B (eXplicit Control Protocol Blind),the wireless version of XCP,in terms of stability,fairness,convergence and utilization in wireless networks.展开更多
Many traditional applications can be refined thanks to the development of blockchain technology. One of these services is non-repudiation, in which participants in a communication process cannot deny their involvement...Many traditional applications can be refined thanks to the development of blockchain technology. One of these services is non-repudiation, in which participants in a communication process cannot deny their involvement.Due to the vulnerabilities of the non-repudiation protocols, one of the parties involved in the communication can often avoid non-repudiation rules and obtain the expected information to the detriment of the interests of the other party, resulting in adverse effects. This paper studies the fairness guarantee quantitatively through probabilistic model checking. E-fairness is measured by modeling the protocol in probabilistic timed automata and verifying the appropriate property specified in the probabilistic computation tree logic. Furthermore, our analysis proposes insight for choosing suitable values for different parameters associated with the protocol so that a certain degree of fairness can be obtained. Therefore, the reverse question—for a certain degree of fairness ε, how can the protocol parameters be specified to ensure fairness—is answered.展开更多
As more business is conduced over the Internet, the fair exchange problem assumes increasing importance. However, the problem of multi-party fair exchange has not been studied as widely as the more fundamental problem...As more business is conduced over the Internet, the fair exchange problem assumes increasing importance. However, the problem of multi-party fair exchange has not been studied as widely as the more fundamental problem of 2-party fair exchange. Recently, Franklin arid Tsudik proposed two protocols for n-party multi-item exchange on FC'98, SUCEX-1 and SUCES-2. This paper first gives an attack on the proposed protocol SUCEX-1, then presents two protocols for multi-item exchange, one is an improved protocol of SUCEX-1, another is the extension of protocol SUCEX-2.展开更多
Wireless Sensor Networks (WSNs) have inherent and unique characteristics rather than traditional networks. They have many different constraints, such as computational power, storage capacity, energy supply and etc;of ...Wireless Sensor Networks (WSNs) have inherent and unique characteristics rather than traditional networks. They have many different constraints, such as computational power, storage capacity, energy supply and etc;of course the most important issue is their energy constraint. Energy aware routing protocol is very important in WSN, but routing protocol which only considers energy has not efficient performance. Therefore considering other parameters beside energy efficiency is crucial for protocols efficiency. Depending on sensor network application, different parameters can be considered for its protocols. Congestion management can affect routing protocol performance. Congestion occurrence in network nodes leads to increasing packet loss and energy consumption. Another parameter which affects routing protocol efficiency is providing fairness in nodes energy consumption. When fairness is not considered in routing process, network will be partitioned very soon and then the network performance will be decreased. In this paper a Tree based Energy and Congestion Aware Routing Protocol (TECARP) is proposed. The proposed protocol is an energy efficient routing protocol which tries to manage congestion and to provide fairness in network. Simulation results shown in this paper imply that the TECARP has achieved its goals.展开更多
Fairness is of crucial importance for the exchange protocols via Internet . Non-repudiation therefore becomes one of the vital premises, which are essential in the exchange of sensitive and important messages. This pa...Fairness is of crucial importance for the exchange protocols via Internet . Non-repudiation therefore becomes one of the vital premises, which are essential in the exchange of sensitive and important messages. This paper is to propose a new exchange protocol, termed ＂EAR＂ Exchange Protocol as it consists of three sub-protocols ： Exchange sub-protocol, Abort sub-protocol and Recovery sub-protocol. It is to be argued that the incorporation of these three sub-protocols may effectively enables EAR to assure non-repudiation, strong fairness, timeliness, confidentiality and the minimized involvement of the Trusted Third Party （TTP）.展开更多
The dynamic characteristics of eplicit control protocol (XCP) were investigated with single bottleneck on the microscopic time-scale. Analysis and simulation results show that the bandwidth utilization of an XCP bottl...The dynamic characteristics of eplicit control protocol (XCP) were investigated with single bottleneck on the microscopic time-scale. Analysis and simulation results show that the bandwidth utilization of an XCP bottleneck link converges to 1 at exponential rate, persistent congestion cannot occur at the bottleneck link, and throughput of an arbitrary subset of XCP flows at the bottleneck link converges to its fair share in exponential rate. The XCP has high bandwidth utilization and good fairness properties.展开更多
Fairness and stability guarantee among TCP flows is very stubborn in wireless ad hoc networks. There is not a MAC protocol that can fulfill this acquirement until now. In this paper, we firstly reveal the in-depth cau...Fairness and stability guarantee among TCP flows is very stubborn in wireless ad hoc networks. There is not a MAC protocol that can fulfill this acquirement until now. In this paper, we firstly reveal the in-depth causes of the severe TCP unfairness and instability problems in IEEE 802.11-based multihop networks. Then we utilize the collision detection mechanism of the IEEE 802.11 protocol which is often ignored by most of the people to design a novel collision detection mechanism-based MAC (CDMB-MAC) scheme to solve the short-term and long-term fairness and stability issues while providing a good aggregate throughput in many topologies.展开更多
A new approach is proposed for analyzing non-repudiation and fairness of e-commerce protocols. The authentication e-mail protocol CMP1 is modeled as finite state machine and analyzed in two vital aspects- non-repudiat...A new approach is proposed for analyzing non-repudiation and fairness of e-commerce protocols. The authentication e-mail protocol CMP1 is modeled as finite state machine and analyzed in two vital aspects- non-repudiation and fairness using SME. As a result, the CMP1 protocol is not fair and we have improved it. This result shows that it is effective to analyze and check the new features of e-commerce protocols using SMV model checker.展开更多
基金Supported by the National Natural Science Foundation of China(90104005)the Doctoral Science Foundation of Ministry of Edu cation(20020486046)
文摘This paper proposes an improved non-repudiation protocol after pointing out two attacks on an existing non-repudiation protocol.To analyze the improved protocol,it also proposes an extension of Kailar logic.Using the extended Kailar logic,the security analysis of the improved prototocol has been presented.
基金National High Technology Research and Development Program(863 program)(2007AA01217903)Important Direction for the Project Chinese Academy of Sciences(KGCX2-YW-125)
文摘With development of electronic com-merce,non-repudiation protocol as the basal component of non-repudiation service has done more and more important functions.Comparing with lots of work on two-party non-repudiation,there are less work on multi-party non-repudiation protocol.Multi-party protocol is more complex and facing more challenge of collusion attack.In this paper we give a kind of multi-party non-repudiation protocol based on off-line TTP with consistent evidence.Consistent evidence is a property that can not only simplify the process of disputation resolving,but also make the service more friendly to users,which means that whether or not TTP involves,evidences participants obtained are consistent.In the meanwhile we analyze the collusion attack that multi-party protocol facing,our protocol can prevent collusion attack.
基金Supported by the National High Technology Research and Development Program of China (863 Program) (2006AA01Z405)
文摘To safeguard the interests of transacting parties,non-repudiation mechanisms need to assure fairness and timeliness.The non-repudiation service currently implemented usually does not consider the requirement of fairness and the fair non-repudiation protocols to date can not be suitably applied in real environment due to its complex interaction.This paper discusses the transaction-oriented non-repudiation requirement for Web services transaction,analyzes the constraints of the traditional model for the available fair non-repudiation protocols and designs a new Online-TTP fair non-repudiation protocol.The new protocol provides a fair non-repudiation solution to secure Web services transactions and can be embedded into a single Web service call.The protocol adopts evidence chained to decreasing the overhead of evidence verification and management and alleviates the overhead of certificate revocation checking and time-stamp generation for signatures.The protocol has strong fairness,timeliness,efficiency and practicability.
基金the National High Technology Research and Development Program of China (2007AA01Z471)
文摘E-commerce protocols for the electronic purchase of goods are difficult to design and implement due to their complexity and high security demands. Fairness of such protocols in literature highly depends on an additional TTP（trusted third party）. However, it is difficult to find such a TTP in some situations. In addition, fairness for customers has been neither fully considered nor well satisfied in existing electronic purchasing protocols. In this paper, a new protocol FEP （fair electronic purchase） without a special TTP but an online bank is presented based on a concurrent digital signature scheme. The FEP protocol guarantees fair electronic purchase of goods via electronic payment between consumers, merchants and their online banks. The protocol is practical and the analysis based on the game logics shows that it achieves the properties of viability, fairness, and timeliness.
基金the National Natural Science Foundation of China(Nos.61562026,61962020)Academic and Technical Leaders of Major Disciplines in Jiangxi Province(No.20172BCB22015)+1 种基金Special Fund Project for Postgraduate Innovation in Jiangxi Province(No.YC2020-B1141)Jiangxi Provincial Natural Science Foundation(No.20224ACB202006).
文摘Fair exchange protocols play a critical role in enabling two distrustful entities to conduct electronic data exchanges in a fair and secure manner.These protocols are widely used in electronic payment systems and electronic contract signing,ensuring the reliability and security of network transactions.In order to address the limitations of current research methods and enhance the analytical capabilities for fair exchange protocols,this paper proposes a formal model for analyzing such protocols.The proposed model begins with a thorough analysis of fair exchange protocols,followed by the formal definition of fairness.This definition accurately captures the inherent requirements of fair exchange protocols.Building upon event logic,the model incorporates the time factor into predicates and introduces knowledge set axioms.This enhancement empowers the improved logic to effectively describe the state and knowledge of protocol participants at different time points,facilitating reasoning about their acquired knowledge.To maximize the intruder’s capabilities,channel errors are translated into the behaviors of the intruder.The participants are further categorized into honest participants and malicious participants,enabling a comprehensive evaluation of the intruder’s potential impact.By employing a typical fair exchange protocol as an illustrative example,this paper demonstrates the detailed steps of utilizing the proposed model for protocol analysis.The entire process of protocol execution under attack scenarios is presented,shedding light on the underlying reasons for the attacks and proposing corresponding countermeasures.The developedmodel enhances the ability to reason about and evaluate the security properties of fair exchange protocols,thereby contributing to the advancement of secure network transactions.
基金Projects(60873265,60903222) supported by the National Natural Science Foundation of China Project(IRT0661) supported by the Program for Changjiang Scholars and Innovative Research Team in University of China
文摘An explicit congestion notification (ECN)-based distributed transport protocol,ARROW-WTCP (AcceleRate tRansmission towards Optimal Window size TCP for Wireless network),was proposed.The ARROW-WTCP enables feasible deployment of ARROW-TCP from wired to wireless networks by providing a joint design of source and router algorithms.The protocol obtains the actual capacity of the wireless channel by calculating the queue variation in base station (BS) and adjusts the congestion window by using the feedback from its bottleneck link.The simulation results show that the ARROW-WTCP achieves strong stability,max-min fairness in dynamic networks,fast convergence to efficiency without introducing much excess traffic,and almost full link utilization in the steady state.It outperforms the XCP-B (eXplicit Control Protocol Blind),the wireless version of XCP,in terms of stability,fairness,convergence and utilization in wireless networks.
文摘Many traditional applications can be refined thanks to the development of blockchain technology. One of these services is non-repudiation, in which participants in a communication process cannot deny their involvement.Due to the vulnerabilities of the non-repudiation protocols, one of the parties involved in the communication can often avoid non-repudiation rules and obtain the expected information to the detriment of the interests of the other party, resulting in adverse effects. This paper studies the fairness guarantee quantitatively through probabilistic model checking. E-fairness is measured by modeling the protocol in probabilistic timed automata and verifying the appropriate property specified in the probabilistic computation tree logic. Furthermore, our analysis proposes insight for choosing suitable values for different parameters associated with the protocol so that a certain degree of fairness can be obtained. Therefore, the reverse question—for a certain degree of fairness ε, how can the protocol parameters be specified to ensure fairness—is answered.
基金Supported by the National Natural Science Foundation of China(No.60173032,No.69973031)
文摘As more business is conduced over the Internet, the fair exchange problem assumes increasing importance. However, the problem of multi-party fair exchange has not been studied as widely as the more fundamental problem of 2-party fair exchange. Recently, Franklin arid Tsudik proposed two protocols for n-party multi-item exchange on FC'98, SUCEX-1 and SUCES-2. This paper first gives an attack on the proposed protocol SUCEX-1, then presents two protocols for multi-item exchange, one is an improved protocol of SUCEX-1, another is the extension of protocol SUCEX-2.
文摘Wireless Sensor Networks (WSNs) have inherent and unique characteristics rather than traditional networks. They have many different constraints, such as computational power, storage capacity, energy supply and etc;of course the most important issue is their energy constraint. Energy aware routing protocol is very important in WSN, but routing protocol which only considers energy has not efficient performance. Therefore considering other parameters beside energy efficiency is crucial for protocols efficiency. Depending on sensor network application, different parameters can be considered for its protocols. Congestion management can affect routing protocol performance. Congestion occurrence in network nodes leads to increasing packet loss and energy consumption. Another parameter which affects routing protocol efficiency is providing fairness in nodes energy consumption. When fairness is not considered in routing process, network will be partitioned very soon and then the network performance will be decreased. In this paper a Tree based Energy and Congestion Aware Routing Protocol (TECARP) is proposed. The proposed protocol is an energy efficient routing protocol which tries to manage congestion and to provide fairness in network. Simulation results shown in this paper imply that the TECARP has achieved its goals.
基金The workis sponsored by National Natural Science Foundation of China (60173037 ,70271050) National"863"High Technology Projects of China(2004AA775053) , Natural Science Foundation of Jiangsu Province and the Pre-research Project Funded by Natural Science Foundation of Jiangsu Province (BK2004218) ,High Technology Research Project of Jiangsu Province(BG2004004) and key Laboratory of Information Technology Processing of Jiangsu Province(kjs05001) .
文摘Fairness is of crucial importance for the exchange protocols via Internet . Non-repudiation therefore becomes one of the vital premises, which are essential in the exchange of sensitive and important messages. This paper is to propose a new exchange protocol, termed ＂EAR＂ Exchange Protocol as it consists of three sub-protocols ： Exchange sub-protocol, Abort sub-protocol and Recovery sub-protocol. It is to be argued that the incorporation of these three sub-protocols may effectively enables EAR to assure non-repudiation, strong fairness, timeliness, confidentiality and the minimized involvement of the Trusted Third Party （TTP）.
基金The National Natural Science Foundation of China (No. 60503049)
文摘The dynamic characteristics of eplicit control protocol (XCP) were investigated with single bottleneck on the microscopic time-scale. Analysis and simulation results show that the bandwidth utilization of an XCP bottleneck link converges to 1 at exponential rate, persistent congestion cannot occur at the bottleneck link, and throughput of an arbitrary subset of XCP flows at the bottleneck link converges to its fair share in exponential rate. The XCP has high bandwidth utilization and good fairness properties.
文摘Fairness and stability guarantee among TCP flows is very stubborn in wireless ad hoc networks. There is not a MAC protocol that can fulfill this acquirement until now. In this paper, we firstly reveal the in-depth causes of the severe TCP unfairness and instability problems in IEEE 802.11-based multihop networks. Then we utilize the collision detection mechanism of the IEEE 802.11 protocol which is often ignored by most of the people to design a novel collision detection mechanism-based MAC (CDMB-MAC) scheme to solve the short-term and long-term fairness and stability issues while providing a good aggregate throughput in many topologies.
基金Supported by the Natural Science Foundation of Guizhou Province(No.20050119)the Natural Science Foundation of Guizhou Education(No.2004219)
文摘A new approach is proposed for analyzing non-repudiation and fairness of e-commerce protocols. The authentication e-mail protocol CMP1 is modeled as finite state machine and analyzed in two vital aspects- non-repudiation and fairness using SME. As a result, the CMP1 protocol is not fair and we have improved it. This result shows that it is effective to analyze and check the new features of e-commerce protocols using SMV model checker.
