113 search results - page 6 / 23 » Threshold Fully Homomorphic Encryption and Secure Computatio... |
182
Voted
CRYPTO
2012
Springer
13 years 8 months ago
2012
Springer
We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players. The protocol may be used to compute securely arithm...
162
click to vote
CRYPTO
2010
Springer
15 years 7 months ago
2010
Springer
Homomorphic encryption (HE) schemes enable computing functions on encrypted data, by means of a public Eval procedure that can be applied to ciphertexts. But the evaluated ciphert...
157
click to vote
PKC
2007
Springer
16 years 14 days ago
2007
Springer
Abstract. Yao’s classical millionaires’ problem is about securely determining whether x > y, given two input values x, y, which are held as private inputs by two parties, re...
137
Voted
ISW
2007
Springer
16 years 15 days ago
2007
Springer
ElGamal scheme has been the first encryption scheme based on discrete logarithm. One of its main advantage is that it is simple, natural and efficient, but also that its security ...
194
Voted
FC
2003
Springer
15 years 11 months ago
2003
Springer
Combinatorial auctions have recently attracted the interest of many researchers due to their promising applications such as the spectrum auctions recently held by the FCC. In a com...