Sciweavers

58 search results - page 12 / 12
» Multiparty Computation from Somewhat Homomorphic Encryption
Sort
View
EUROCRYPT
2001
Springer
13 years 9 months ago
Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems
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...
Eric R. Verheul
ACMICEC
2003
ACM
144views ECommerce» more  ACMICEC 2003»
13 years 10 months ago
Security model for a multi-agent marketplace
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...
Ashutosh Jaiswal, Yongdae Kim, Maria L. Gini
EUROPKI
2009
Springer
13 years 2 months ago
Automatic Generation of Sigma-Protocols
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...
Endre Bangerter, Thomas Briner, Wilko Henecka, Ste...