A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
A Game-Based Verification of Non-repudiation and Fair Exchange Protocols
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
In this paper, we report on a recent work for the verification of non-repudiation protocols. ...
We propose a verification method based on the idea that non-repudiation protocols are best modeled as games. ...
The authors would like to thank Giorgio Delzanno, Olivier Markowitch and Thierry Massart for carefully reading previous versions of this paper, as well as the members of the group "Vérification" of ULB ...
doi:10.1007/3-540-44685-0_37
fatcat:5h6xtmxuxvgknadcnsgglfg3uq
Fairness in Non-Repudiation Protocols
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We indicate two problems with the specifications of fairness that are currently used for the verification of non-repudiation and other fair-exchange protocols. ...
Moreover, we establish a hierarchy of various definitions of fairness, and indicate the consequences for existing work. ...
This work was supported by the FNR (National Research Fund) Luxembourg under projects S-GAMES, C08/IS/03 and GMASec -PHD/09/082. ...
doi:10.1007/978-3-642-29963-6_10
fatcat:c4p3n7nluvhbnl4vs3z6iklft4
A Formal Analysis of Fairness and Non-repudiation in the RSA-CEGD Protocol
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
This is a relatively complex scheme based on verifiable and recoverable encrypted signatures (VRES) to guarantee properties such as strong fairness and non-repudiation, among others. ...
The study performed within this framework reveals the lack of non-repudiation in RSA-CEGD and points out some other weaknesses. ...
Section 3 introduces a formalization of the two features of this protocol considered in this work: strong fairness and non-repudiation. ...
doi:10.1007/11424925_136
fatcat:row53vlnvjfgtnhjyrqv4faezq
Provable Fair Document Exchange Protocol with Transaction Privacy for E-Commerce
2015
Symmetry
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Security and performance analyses indicate that the proposed protocol not only provides strong fairness, non-repudiation of origin, non-repudiation of receipt, and message confidentiality, but also enhances ...
Transaction privacy has attracted a lot of attention in the e-commerce. This study proposes an efficient and provable fair document exchange protocol with transaction privacy. ...
This research was partially supported by the Ministry of Science and Technology, Taiwan, under contract No.: 103-2221-E-032-037 and 97-2221-E-032-019. ...
doi:10.3390/sym7020464
fatcat:juqqkzwxsffgnlrow53ibqeizi
Automatic Methods for Analyzing Non-Repudiation Protocols with an Active Intruder
[article]
2007
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
In this purpose, we show how to partially represent non-repudiation as a combination of authentications on the Fair Zhou-Gollmann protocol. ...
After discussing its limits, we define a new method based on the handling of the knowledge of protocol participants. ...
and Raskin [9] who have used a game based model, Armando et al ...
arXiv:0710.3305v2
fatcat:w6gj67eb6jawvezxoffoboupse
Automatic Methods for Analyzing Non-repudiation Protocols with an Active Intruder
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this purpose, we show how to partially represent non-repudiation as a combination of authentications on the Fair Zhou-Gollmann protocol. ...
After discussing the limitations of this method, we define a new one, based on the handling of the knowledge of protocol participants. ...
[15] with a game-based model, Armando et al ...
doi:10.1007/978-3-642-01465-9_13
fatcat:amx7s6mzavax3eqo6m7i4x3uci
Verification of A Key Chain Based TTP Transparent CEM Protocol
2011
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Recently, we have developed a CEM protocol with a transparent TTP [15], based on the protocol of Cederquist et al. [9] that applies key chains to reduce TTP's storage requirement. ...
A Key Chain Based TTP Transparent CEM Protocol Our protocol is developed on basis of the protocol [9], to support TTP transparency. Key chains are used to reduce TTP's storage requirement. ...
As a special class of fair exchange protocols [20] , a CEM protocol is supposed to guarantee fairness with respect to non-repudiable evidences. ...
doi:10.1016/j.entcs.2011.07.006
fatcat:pqdih62qpzgy3hqzkgnvqlhsry
Risk Balance in Optimistic Non-repudiation Protocols
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We investigate how the behaviors of malicious trusted parties affect participants of optimistic non-repudiation protocols. We introduce a notion of risk balance for exchange protocols. ...
As a case study, we investigate the consequences of malicious behaviors of trusted parties in the context of two fair non-repudiation protocols, proposed by Gürgens, Rudolph and Vogt (2005) . ...
A non-repudiation protocol is fair iff these evidences are exchanged in a fair manner. ...
doi:10.1007/978-3-642-29420-4_17
fatcat:lziwxqcsk5ck3bd5gtztlkabya
An Evenhanded Certified Email System for Contract Signing
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Certified email is a system which enables a sender to prove a receiver's receipt of email. Such a system can be used for applications related to electronic commerce on the Internet. ...
We point out that no traditional certified email systems have been designed for such a case, thus one of the participants can be at a disadvantage. ...
Similarly, the receiver's authentication and non-repudiation of receipt are available by the verification of ER. ...
doi:10.1007/11602897_1
fatcat:6o522foeyvfmres3jiay4xxuim
On the Quest for Impartiality: Design and Analysis of a Fair Non-repudiation Protocol
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We design and analyze a simple optimistic fair non-repudiation protocol. ...
Our protocol is considerably simpler and more efficient than current proposals, due mainly to the avoidance of using session labels. We model-check both safety and liveness properties. ...
We thank Ana Almeida Matos, Sandro Etalle, Wan Fokkink, Pieter Hartel, Steve Kremer and the anonymous reviewers for helpful comments. ...
doi:10.1007/11602897_3
fatcat:3g5gwuwtj5bh7jqci2s76oit74
Generic non-repudiation protocols supporting transparent off-line TTP
2006
Journal of Computer Security
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
A non-repudiation protocol enables the fair exchange of an electronic message and an irrefutable digital receipt between two mistrusting parties over the Internet. ...
Then, we present such a fair nonrepudiation protocol to overcome some limitations and shortcomings in previous schemes. ...
Acknowledgements The author would like to thank all anonymous referees, on behalf of IWAP 2005 and Journal of Computer Security, for their very helpful and detailed comments on the protocol, as well as ...
doi:10.3233/jcs-2006-14504
fatcat:dmaz2qryrffnfimoyv6d5grise
On Fairness in Exchange Protocols
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
We propose a structured and generalized definition of fairness and of the security of exchange protocols. ...
The aim of this paper is to give an overview of the most classical definitions of fairness in exchange protocols. ...
succeeded. 6 Classical non-repudiation needs are non-repudiation of origin of a message and nonrepudiation of receipt of a message. ...
doi:10.1007/3-540-36552-4_31
fatcat:nee2ohkvkfdkjbdzzsyqr7kcau
Security Analysis of (Un-) Fair Non-repudiation Protocols
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
non-repudiation protocol and on two more recent optimistic fair non-repudiation protocols. ...
An approach to protocol analysis using asynchronous product automata (APA) and the simple homomorphism verification tool (SHVT) is demonstrated on several variants of the well known Zhou-Gollmann fair ...
Recently, a new approach modelling non-repudiation protocols as games has been proposed by Kremer and Raskin [11] . ...
doi:10.1007/978-3-540-40981-6_10
fatcat:2j2ylca5yneibmkynbkxt3ukyu
An Efficient and Secure Event Signature (EASES) Protocol for Peer-to-Peer Massively Multiplayer Online Games
[chapter]
2007
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Most messages need only two hash operations to achieve non-repudiation and event agreement. ...
The computation, memory, and bandwidth consumptions of EASES are low, which makes it applicable to P2P-based MMOGs. ...
This protocol has the non-repudiation property inherited from traditional signature schemes. ...
doi:10.1007/978-3-540-72606-7_89
fatcat:o34vrzfs7batdgnr64yjyzjnvi
An efficient and secure event signature (EASES) protocol for peer-to-peer massively multiplayer online games
2008
Computer Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Most messages need only two hash operations to achieve non-repudiation and event agreement. ...
The computation, memory, and bandwidth consumptions of EASES are low, which makes it applicable to P2P-based MMOGs. ...
This protocol has the non-repudiation property inherited from traditional signature schemes. ...
doi:10.1016/j.comnet.2008.03.004
fatcat:kky2phdazfcjpo4yspy5yya4la
« Previous
Showing results 1 — 15 out of 865 results