EUROCRYPT
15 years 6 months ago
2007 Springer
We present a structural attack against the Sidelnikov cryptosystem [8]. The attack creates a private key from a given public key. Its running time is subexponential and is effecti...
EUROCRYPT
15 years 4 months ago
2007 Springer
This paper shows that Py and Pypy are practically insecure. If one key is used with about 216 IVs with special differences, with high probability two identical keystreams will appe...
109
click to vote
EUROCRYPT
15 years 4 months ago
2007 Springer
We show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secur...
106
click to vote
EUROCRYPT
15 years 4 months ago
2007 Springer
Abstract. With computer networks spreading into a variety of new environments, the need to authenticate and secure communication grows. Many of these new environments have particul...
EUROCRYPT
15 years 4 months ago
2007 Springer
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
|