150 search results - page 12 / 30 » Fair Secure Two-Party Computation |
XMLSEC
2003
ACM
14 years 22 days ago
2003
ACM
Reliable and atomic transactions are a key to successful eBusiness interactions. Reliable messaging subsystems, such as IBM’s MQ Series, or broker-based techniques have been tra...
CRYPTO
1990
Springer
13 years 11 months ago
1990
Springer
This paper describes a method for n players, a majority of which may be faulty, to compute correctly, privately, and fairly any computable function f(Xl, ...,x,) where xi is the i...
STACS
2012
Springer
12 years 3 months ago
2012
Springer
Assignment between two parties in a two-sided matching market has been one of the central questions studied in economics, due to its extensive applications, focusing on different...
IACR
2011
12 years 7 months ago
2011
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
ICDCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We propose a peer-to-peer architecture designed to overcome asymmetries in upload/download speeds that are typical in end-user dialup, broadband and cellular wireless Internet con...