83 search results - page 11 / 17 » Efficient Two-Party Secure Computation on Committed Inputs |
74
Voted
JOC
2010
14 years 6 months ago
2010
Abstract. A shuffle consists of a permutation and re-encryption of a set of input ciphertexts. One application of shuffles is to build mix-nets. We suggest an honest verifier zero-...
101
click to vote
IEEECIT
2010
IEEE
14 years 9 months ago
2010
IEEE
Suppose Bob, the boss in Company A, pays a secure cloud storage service and authorizes all the employees in that company to share such a service. There exists a user hierarchy: Bob...
JOC
2010
14 years 6 months ago
2010
Abstract. In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their private inputs. The computati...
JUCS
2008
14 years 11 months ago
2008
Abstract: Oblivious transfer is an important cryptographic protocol in various security applications. For example, in on-line transactions, a k-out-of-n oblivious transfer scheme a...
TCC
2009
Springer
16 years 6 days ago
2009
Springer
In the setting of secure computation, a set of parties wish to securely compute some function of their inputs, in the presence of an adversary. The adversary in question may be st...