Sciweavers

150 search results - page 13 / 30
» Fair Secure Two-Party Computation
Sort
View
FOCS
2010
IEEE
13 years 5 months ago
On the Computational Complexity of Coin Flipping
Coin flipping is one of the most fundamental tasks in cryptographic protocol design. Informally, a coin flipping protocol should guarantee both (1) Completeness: an honest executi...
Hemanta K. Maji, Manoj Prabhakaran, Amit Sahai
EDCC
2005
Springer
14 years 1 months ago
Gracefully Degrading Fair Exchange with Security Modules
The fair exchange problem is key to trading electronic items in systems of mutually untrusted parties. In modern variants of such systems, each party is equipped with a security mo...
Gildas Avoine, Felix C. Gärtner, Rachid Guerr...
CSIE
2009
IEEE
14 years 2 months ago
An Enhanced-Security Fair E-payment Protocol
Customers are usually passive in an electronic commerce transaction. Based on a new two times concurrent signature, this article presents a fair electronic payment (E-payment) pro...
Wei Fan, Huaying Shu, Elizabeth Fife, Qiang Yan
TCC
2009
Springer
131views Cryptology» more  TCC 2009»
14 years 8 months ago
Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security
It is well known that general secure function evaluation (SFE) with information-theoretical (IT) security is infeasible in presence of a corrupted majority in the standard model. ...
Robin Künzler, Jörn Müller-Quade, D...
EUROCRYPT
2004
Springer
14 years 27 days ago
Public-Key Steganography
Informally, a public-key steganography protocol allows two parties, who have never met or exchanged a secret, to send hidden messages over a public channel so that an adversary can...
Luis von Ahn, Nicholas J. Hopper