Filters








44,828 Hits in 4.7 sec

Some Remarks on a Fair Exchange Protocol [chapter]

Jianying Zhou, Robert Deng, Feng Bao
2000 Lecture Notes in Computer Science  
Several protocols for fair exchange have been proposed in recent years. In this paper, we first examine a newly published fair exchange protocol and point out its flaws and weaknesses.  ...  We then put forward a more efficient and secure protocol and give an informal analysis.  ...  Some Remarks The requirements for fair exchange were formulated in [2] : -Effectiveness. If two parties behave correctly, they will receive the expected items without any involvement of the TTP.  ... 
doi:10.1007/978-3-540-46588-1_4 fatcat:bnmsaefmqzdobmwh4s5ammhdqi

Constructing fair-exchange protocols for E-commerce via distributed computation of RSA signatures

Jung Min Park, Edwin K. P. Chong, Howard Jay Siegel
2003 Proceedings of the twenty-second annual symposium on Principles of distributed computing - PODC '03  
A fair-exchange protocol allows two parties to exchange items in a fair way so that either each party gets the other's item, or neither party does.  ...  We describe a novel method of constructing very efficient fair-exchange protocols by distributing the computation of RSA signatures.  ...  Of course, the primary signer and the TTP would have to go through a one-time registration protocol a priori to the exchange protocol. Remark 8.  ... 
doi:10.1145/872035.872060 dblp:conf/podc/ParkCS03 fatcat:f5qedtyvszal3cb4iq6nza6sde

Generic non-repudiation protocols supporting transparent off-line TTP

Guilin Wang, Jianying Zhou, Meng-Chow Kang
2006 Journal of Computer Security  
Then, we present such a fair nonrepudiation protocol to overcome some limitations and shortcomings in previous schemes.  ...  A non-repudiation protocol enables the fair exchange of an electronic message and an irrefutable digital receipt between two mistrusting parties over the Internet.  ...  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

Optimistic Fair Exchange Based on Publicly Verifiable Secret Sharing [chapter]

Gildas Avoine, Serge Vaudenay
2004 Lecture Notes in Computer Science  
In this paper we propose an optimistic two-party fair exchange protocol which does not rely on a centralized trusted third party.  ...  Instead, the fairness of the protocol relies on the honesty of part of the neighbor participants.  ...  Acknowledgment The work presented in this paper was supported (in part) by the National Competence Center in Research on Mobile Information and Communication Systems (NCCR-MICS), a center supported by  ... 
doi:10.1007/978-3-540-27800-9_7 fatcat:dskyiqdwivcbznt3wqbuockace

Efficiency of optimistic fair exchange using trusted devices

Mohammad Torabi Dashti
2012 ACM Transactions on Autonomous and Adaptive Systems  
Efficiency of asynchronous optimistic fair exchange using trusted devices is studied.  ...  It is then proved that exchanging non-idempotent items using trusted devices with a bounded storage capacity requires exactly four messages in the optimistic sub-protocol.  ...  If a TD wants, for some reason, to exchange a voucher for an obsolete one, the TTP should play its usual role.  ... 
doi:10.1145/2168260.2168263 fatcat:l5vgkmyqjnexhbvznkzdth2oke

Computationally-Fair Group and Identity-Based Key-Exchange [chapter]

Andrew C. Yao, Yunlei Zhao
2012 Lecture Notes in Computer Science  
We identify some new attacks on these protocols, showing in particular that these protocols are not computationally fair.  ...  Then, based on the computationally fair Diffie-Hellman keyexchange in [21], we present some fixing approaches, and prove that the fixed protocols are computationally fair.  ...  Then, based on the computationally fair Diffie-Hellman key-exchange in [21] , we present some fixing approaches, and prove that the fixed protocols are computationally fair (in accordance with the definition  ... 
doi:10.1007/978-3-642-29952-0_26 fatcat:z5g5kqydq5blvh225drdfi37gu

Fair exchange in E-commerce

Indrajit Ray, Indrakshi Ray
2002 ACM SIGecom Exchanges  
In this paper we review some of the work done on such fair exchange protocols and identify areas that still need to be addressed.  ...  Protocols which meet any of the two objectives are collectively termed fair exchange protocols.  ...  ACKNOWLEDGMENT The authors would like to take this opportunity to thank the reviewers for their profound remarks and very useful suggestions.  ... 
doi:10.1145/844340.844345 fatcat:zak4p7tyhfbtpi4x2rouwein2q

Analysis and Improvement of Micali's Fair Contract Signing Protocol [chapter]

Feng Bao, Guilin Wang, Jianying Zhou, Huafei Zhu
2004 Lecture Notes in Computer Science  
In PODC 2003, Micali presented a fair electronic exchange protocol for contract signing with an invisible trusted party [17] . The protocol was filed as a US patent No 5666420 in 1997 [16].  ...  In resolving a dispute, the trusted party may face a dilemma situation that no matter what it does, one of the exchanging parties can succeed in cheating.  ...  Acknowledgements: The authors would like to thank anonymous referees for their very helpful suggestions on the improvement of this paper.  ... 
doi:10.1007/978-3-540-27800-9_16 fatcat:dciaql4y25ehtnzfsgl724guly

Breaking and repairing optimistic fair exchange from PODC 2003

Yevgeniy Dodis, Leonid Reyzin
2003 Proceedings of the 2003 ACM workshop on Digital rights management - DRM '03  
In PODC 2003, Park, Chong, Siegel and Ray [22] proposed an optimistic protocol for fair exchange, based on RSA signatures.  ...  Of independent interest, we introduce a unified model for non-interactive fair exchange protocols, which results in a new primitive we call verifiably committed signatures.  ...  Acknowledgments We thank Alexandra Boldyreva, Jung Min Park, and Victor Shoup for useful discussions concerning fair exchange and comments on this paper.  ... 
doi:10.1145/947386.947387 fatcat:rfx66lsy5jawjaroa2nc3zklza

Breaking and repairing optimistic fair exchange from PODC 2003

Yevgeniy Dodis, Leonid Reyzin
2003 Proceedings of the 2003 ACM workshop on Digital rights management - DRM '03  
In PODC 2003, Park, Chong, Siegel and Ray [22] proposed an optimistic protocol for fair exchange, based on RSA signatures.  ...  Of independent interest, we introduce a unified model for non-interactive fair exchange protocols, which results in a new primitive we call verifiably committed signatures.  ...  Acknowledgments We thank Alexandra Boldyreva, Jung Min Park, and Victor Shoup for useful discussions concerning fair exchange and comments on this paper.  ... 
doi:10.1145/947380.947387 dblp:conf/drm/DodisR03 fatcat:axl32ep3abavdgwqb6hpxe7u5i

Optimistic Fair Exchange with Transparent Signature Recovery [chapter]

Olivier Markowitch, Shahrokh Saeednia
2002 Lecture Notes in Computer Science  
We propose a new protocol allowing the exchange of an item against a signature while assuring fairness.  ...  in the protocol only when one of the parties does not follow the designated protocol or some technical problem occurs during the execution of the protocol.  ...  Acknowledgment We are grateful to Michael Waidner for his criticism of the earlier version of our protocol and for many helpful discussions.  ... 
doi:10.1007/3-540-46088-8_26 fatcat:vho55oe7kbdc3cllpucuifhgtu

Generic, Optimistic, and Efficient Schemes for Fair Certified Email Delivery [chapter]

Guilin Wang, Feng Bao, Kenji Imamoto, Kouichi Sakurai
2005 Lecture Notes in Computer Science  
As a value-added service for standard email systems, a certified email scheme allows a sender to deliver a message to a receiver in a fair way in the sense that either the sender obtains a receipt from  ...  Our schemes are not only fair, but also support timeliness in two flavors: one scheme supports weak timeliness but with stateless TTP, while the other guarantees (strong) timeliness though only supports  ...  Conclusion In this paper, we first pointed out some weaknesses in several existing certified email schemes proposed in [9, 14] .  ... 
doi:10.1007/11602897_4 fatcat:74ij6dxivnh2llbf2hsjmrcnbq

A Novel Fair Anonymous Contract Signing Protocol for E-Commerce Applications

H Jayasree
2012 International journal of network security and its applications  
A fair contract signing protocol allows two potentially mis-trusted parities to exchange their commitments (i.e., digital signatures) to an agreed contract over the Internet in a fair way, so that either  ...  Based on the LUCAS signature scheme, a new digital anonymous contract signing protocol is proposed in this paper.  ...  Any agreement between two or more parties involves a contract of some kind example on-line purchases imply a contract that promise to exchange money for some goods or service.  ... 
doi:10.5121/ijnsa.2012.4509 fatcat:okwvb635cngzfdbwzvo4rk2lgm

A Certified Email Protocol Using Key Chains

J. Cederquist, M. Torabi Dashti, S. Mauw
2007 21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)  
The proposed protocol thereby outperforms the existing schemes that achieve strong fairness.  ...  This paper introduces an asynchronous optimistic certified email protocol, with stateless recipients, that relies on key chains to considerably reduce the storage requirements of the trusted third party  ...  Acknowledgment: We are grateful to Ricardo Corin for his contributions on earlier versions of the paper, in particular for the idea of using (single) hash chains to reduce the TTP's storage requirements  ... 
doi:10.1109/ainaw.2007.10 dblp:conf/aina/CederquistDM07 fatcat:pd6a2ka3dvhmbdflw4hwxn22fu

An Optimistic Fair Exchange E-commerce Protocol for Complex Transactions

Cătălin V. Bîrjovanu, Mirela Bîrjovanu
2018 Proceedings of the 15th International Joint Conference on e-Business and Telecommunications  
Our protocol uses as building block the fair exchange internet payment protocol (FEIPS) for physical products that considers only one customer and one merchant.  ...  Even if there are many multi-party fair exchange protocols with applications in buying digital goods, digital signature of contracts and certified e-mail, no one can be used to solve our problem: complex  ...  To achieve fair exchange, the proposed protocols are based on a Trusted Third Party (TTP) that can be inline, online or offline.  ... 
doi:10.5220/0006853502770288 dblp:conf/icete/BirjoveanuB18a fatcat:v3o2334nuzbqdmf6xaaic4gmmi
« Previous Showing results 1 — 15 out of 44,828 results