46 search results - page 2 / 10 » crypto 2005 |
CRYPTO
2005
Springer
13 years 11 months ago
2005
Springer
In this paper we present a practical heuristic attack on the Ko, Lee et al. key exchange protocol introduced at Crypto 2000 [10]. One of the ideas behind our attack is using Dehorn...
CRYPTO
2005
Springer
13 years 11 months ago
2005
Springer
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not requir...
CRYPTO
2005
Springer
13 years 11 months ago
2005
Springer
Anonymous channels are necessary for a multitude of privacy-protecting protocols. Onion routing is probably the best known way to achieve anonymity in practice. However, the crypto...
CRYPTO
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. Using a recent idea of Gaudry and exploiting rational representations of algebraic tori, we present an index calculus type algorithm for solving the discrete logarithm pr...
CRYPTO
2005
Springer
13 years 11 months ago
2005
Springer
Since bit and string oblivious transfer and commitment, two primitives of paramount importance in secure two- and multi-party computation, cannot be realized in an unconditionally ...