31 search results - page 5 / 7 » Secure Generalized Vickrey Auction Using Homomorphic Encrypt... |
EUROCRYPT
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. We show that finding an efficiently computable injective homomorphism from the XTR subgroup into the group of points over GF(p2 ) of a particular type of supersingular e...
CCS
2010
ACM
13 years 10 months ago
2010
ACM
Many cryptographic tasks and protocols, such as non-repudiation, contract-signing, voting, auction, identity-based encryption, and certain forms of secure multi-party computation,...
STOC
2006
ACM
14 years 10 months ago
2006
ACM
d abstract) Yuval Ishai Eyal Kushilevitz Yehuda Lindell Erez Petrank It is well known that the secure computation of non-trivial functionalities in the setting of no honest majori...
EUROCRYPT
1999
Springer
14 years 2 months ago
1999
Springer
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...
TCC
2009
Springer
14 years 10 months ago
2009
Springer
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...