31 search results - page 3 / 7 » Secure Generalized Vickrey Auction Using Homomorphic Encrypt... |
CRYPTO
2010
Springer
13 years 4 months ago
2010
Springer
We present a general method to compile any cryptographic algorithm into one which resists side channel attacks of the only computation leaks information variety for an unbounded nu...
PKC
2009
Springer
14 years 8 months ago
2009
Springer
Similar to verifiable shuffling (or, mixing), we consider the problem of verifiable rotating (and random re-encrypting) a given list of homomorphic encryptions. The offset by which...
ACMICEC
2003
ACM
14 years 21 days ago
2003
ACM
A multi-agent marketplace, MAGNET (Multi AGent Negotiation Testbed), is a promising solution to conduct online combinatorial auctions. The trust model of MAGNET is somewhat diffe...
CCS
2010
ACM
13 years 7 months ago
2010
ACM
Secure two-party computation allows two untrusting parties to jointly compute an arbitrary function on their respective private inputs while revealing no information beyond the ou...
CRYPTO
2010
Springer
13 years 8 months ago
2010
Springer
Side-channel attacks have often proven to have a devastating effect on the security of cryptographic schemes. In this paper, we address the problem of storing cryptographic keys a...