62 search results - page 12 / 13 » Multiparty Computation from Threshold Homomorphic Encryption |
FC
2006
Springer
13 years 9 months ago
2006
Springer
Existing stable matching algorithms reveal the preferences of all participants, as well as the history of matches made and broken in the course of computing a stable match. This in...
EUROCRYPT
2001
Springer
13 years 9 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...
NDSS
2003
IEEE
13 years 10 months ago
2003
IEEE
In this work we revisit and formally study the notion of proxy cryptography. Intuitively, various proxy functions allow two cooperating parties F (the “FBI”) and P (the “pro...
EUROPKI
2009
Springer
13 years 3 months ago
2009
Springer
Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building blocks of many cryptographic applications such as identification schemes, group signatures, and secure mult...
TAMC
2009
Springer
13 years 11 months ago
2009
Springer
The retention of communication data has recently attracted much public interest, mostly because of the possibility of its misuse. In this paper, we present protocols that address ...