Results 1 - 10 of 210

A randomized protocol for signing contracts

by Michael Ben-Or, Oded Goldreich, Silvio Micali, Ronald L. Rivest , 1990
"... Two parties, A and B, want to sign a contract C over a communication network. To do so, they must “simultaneously” exchange their commitments to C. Since simultaneous exchange is usually impossible in practice, protocols are needed to approximate simultaneity by exchanging partial commitments in pie ..."
Abstract - Cited by 599 (11 self) - Add to MetaCart
Two parties, A and B, want to sign a contract C over a communication network. To do so, they must “simultaneously” exchange their commitments to C. Since simultaneous exchange is usually impossible in practice, protocols are needed to approximate simultaneity by exchanging partial commitments

Optimistic fair exchange of digital signatures

by N. Asokan, Victor Shoup, Michael Waidner - IEEE Journal on Selected Areas in Communications , 1998
"... Abstract. We present a new protocol that allows two players to ex-change digital signatures over the Internet in a fair way, so that either each player gets the other’s signature, or neither player does. The ob-vious application is where the signatures represent items of value, for example, an elect ..."
Abstract - Cited by 290 (10 self) - Add to MetaCart
Abstract. We present a new protocol that allows two players to ex-change digital signatures over the Internet in a fair way, so that either each player gets the other’s signature, or neither player does. The ob-vious application is where the signatures represent items of value, for example

Efficiently Making Secure Two-Party Computation Fair

by An Kılınc ̧
"... Secure two-party computation cannot be fair in general against malicious adversaries, unless a trusted third party (TTP) is involved, or gradual-release type of costly protocols with super-constant rounds are employed. Existing optimistic fair two-party computation protocols with constant rounds are ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
Secure two-party computation cannot be fair in general against malicious adversaries, unless a trusted third party (TTP) is involved, or gradual-release type of costly protocols with super-constant rounds are employed. Existing optimistic fair two-party computation protocols with constant rounds

An efficient two-party identity-based key exchange protocol

by Yuh-min Tseng - Informatica: International Journal , 2007
"... Abstract. A key exchange (or agreement) protocol is designed to allow two entities establishing a session key to encrypt the communication data over an open network. In 1990, Gunther proposed an identity-based key exchange protocol based on the difficulty of computing a discrete logarithm problem. A ..."
Abstract - Cited by 4 (2 self) - Add to MetaCart
Abstract. A key exchange (or agreement) protocol is designed to allow two entities establishing a session key to encrypt the communication data over an open network. In 1990, Gunther proposed an identity-based key exchange protocol based on the difficulty of computing a discrete logarithm problem

An Efficient Two-Party Identity-Based Key Exchange Protocol based on ECDLP

by Jayaprakash Kar, Banshidhar Majhi , 2009
"... This paper presents an efficient identity-based key exchange protocol based on the difficulty of computing a Elliptic Curve Discrete Logarithm Problem. As compared with the previously proposed protocols, it has better performance in terms of the computational cost and the communication steps. Key ex ..."
Abstract - Add to MetaCart
This paper presents an efficient identity-based key exchange protocol based on the difficulty of computing a Elliptic Curve Discrete Logarithm Problem. As compared with the previously proposed protocols, it has better performance in terms of the computational cost and the communication steps. Key

Usable Optimistic Fair Exchange

by Alptekin Küpçü, Anna Lysyanskaya
"... Fairly exchanging digital content is an everyday problem. It has been shown that fair exchange cannot be done without a trusted third party (called the Arbiter). Yet, even with a trusted party, it is still non-trivial to come up with an efficient solution, especially one that can be used in a p2p fi ..."
Abstract - Cited by 11 (7 self) - Add to MetaCart
unless a dispute occurs. While the previous solutions employ costly cryptographic primitives for every file or block exchanged, our protocol employs them only once per peer, therefore achieving O(n) efficiency improvement when n blocks are exchanged between two peers. The rest of our protocol uses very

Fair Exchange with a Semi-Trusted Third Party (Extended Abstract)

by Matthew K. Franklin, Michael K. Reiter - 4TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY , 1997
"... We present new protocols for two parties to exchange documents with fairness, i.e., such that no party can gain an advantage by quitting prematurely or otherwise misbehaving. We use a third party that is "semi-trusted", in the sense that it may misbehave on its own but will not conspire wi ..."
Abstract - Cited by 102 (2 self) - Add to MetaCart
We present new protocols for two parties to exchange documents with fairness, i.e., such that no party can gain an advantage by quitting prematurely or otherwise misbehaving. We use a third party that is "semi-trusted", in the sense that it may misbehave on its own but will not conspire

Fair exchange in e-commerce

by Indrajit Ray, Indrakshi Ray - ACM SIGecom Exchange , 2002
"... Many business transactions over the Internet involve the exchange of digital products between two parties – electronic mails, digital audio and video, electronic contract signing and digital signatures, to name a few. Often these transactions occur between players that do not trust each other. To fa ..."
Abstract - Cited by 23 (0 self) - Add to MetaCart
during protocol execution using which an honest party can prove his case. Protocols which meet any of the two objectives are collectively termed fair exchange protocols. In this paper we review some of the work done on such fair exchange protocols and identify areas that still need to be addressed.

Exploring Fair Exchange Protocols Using Specification Animation

by Colin Boyd, Peter Kearney - In The Third International Workshop on Information Security - ISW2000, Lecture Notes in Computer Science
"... Fair exchange protocols are a mechanism to ensure that items held by two parties are exchanged without one party gaining an advantage. Several such protocols have been proposed in recent years. ..."
Abstract - Cited by 12 (0 self) - Add to MetaCart
Fair exchange protocols are a mechanism to ensure that items held by two parties are exchanged without one party gaining an advantage. Several such protocols have been proposed in recent years.

An Implementation of Secure Two-Party Computation for Smartphones with Application to Privacy-Preserving Interest-Cast

by Gianpiero Costantino, Fabio Martinelli, Paolo Santi, Dario Amoruso
"... Abstract—In this paper, we present an implementation of the FairPlay framework for secure two-party function computation on Android smartphones, which we call MobileFairPlay. Mobile-FairPlay allows high-level programming of several secure two-party protocols, including protocols for the Millionaire ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract—In this paper, we present an implementation of the FairPlay framework for secure two-party function computation on Android smartphones, which we call MobileFairPlay. Mobile-FairPlay allows high-level programming of several secure two-party protocols, including protocols for the Millionaire
Results 1 - 10 of 210