83 search results - page 4 / 17 » Efficient Two-Party Secure Computation on Committed Inputs |
GRC
2008
IEEE
13 years 8 months ago
2008
IEEE
—Secure multiparty computation is a very important research topic in cryptography. A secure multi-party computation involves N untrusful parties. It takes input xi from the ith p...
ASIACRYPT
2010
Springer
13 years 5 months ago
2010
Springer
We study security amplification for weak bit-commitment schemes and improve the efficiency of (black-box) transformations in both the information-theoretic and computational setti...
ASIACRYPT
2008
Springer
13 years 9 months ago
2008
Springer
Optimistic fair exchange (OFE) is a protocol for solving the problem of exchanging items or services in a fair manner between two parties, a signer and a verifier, with the help o...
ACNS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. This paper examines secure two-party computation of functions which depend only on the Hamming distance of the inputs of the two parties. We present efficient protocols f...
ICISC
2008
13 years 9 months ago
2008
Secure Evaluation of Private Functions (PF-SFE) allows two parties to compute a private function which is known by one party only on private data of both. It is known that PF-SFE c...