8 search results - page 1 / 2 » Counting Method for Multi-party Computation over Non-abelian... |
CANS
2008
Springer
13 years 6 months ago
2008
Springer
In the Crypto'07 paper [5], Desmedt et al. studied the problem of achieving secure n-party computation over nonAbelian groups. The function to be computed is fG(x1, . . . , x...
CRYPTO
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
ANTS
2008
Springer
13 years 6 months ago
2008
Springer
We discuss the computation of coefficients of the L-series associated to a hyperelliptic curve over Q of genus at most 3, using point counting, generic group algorithms, and p-adic...
WWW
2008
ACM
14 years 5 months ago
2008
ACM
Wikipedia, "the free encyclopedia", now contains over two million English articles, and is widely regarded as a highquality, authoritative encyclopedia. Some Wikipedia a...
CHI
2008
ACM
13 years 6 months ago
2008
ACM
We present a large-scale analysis of the content of weblogs dating back to the release of the Blogger program in 1999. Over one million blogs were analyzed from their conception t...