58 search results - page 12 / 12 » Multiparty Computation from Somewhat Homomorphic Encryption |
143
Voted
EUROCRYPT
2001
Springer
15 years 7 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...
137
Voted
ACMICEC
2003
ACM
15 years 8 months 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...
231
Voted
EUROPKI
2009
Springer
15 years 16 days 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...