Sciweavers

EUROCRYPT
2003
Springer
13 years 9 months ago
On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions
The recently proposed universally composable (UC) security framework for analyzing security of cryptographic protocols provides very strong security guarantees. In particular, a p...
Ran Canetti, Eyal Kushilevitz, Yehuda Lindell
EUROCRYPT
2003
Springer
13 years 9 months ago
A Forward-Secure Public-Key Encryption Scheme
Cryptographic computations are often carried out on insecure devices for which the threat of key exposure represents a serious concern. Forward security allows one to mitigate the...
Ran Canetti, Shai Halevi, Jonathan Katz
EUROCRYPT
2003
Springer
13 years 9 months ago
Algebraic Attacks on Stream Ciphers with Linear Feedback
A classical construction of stream ciphers is to combine several LFSRs and a highly non-linear Boolean function f. Their security is usually analysed in terms of correlation attack...
Nicolas Courtois, Willi Meier
EUROCRYPT
2003
Springer
13 years 9 months ago
Improved Algorithms for Efficient Arithmetic on Elliptic Curves Using Fast Endomorphisms
Mathieu Ciet, Tanja Lange, Francesco Sica, Jean-Ja...
EUROCRYPT
2003
Springer
13 years 9 months ago
A Theoretical Treatment of Related-Key Attacks: RKA-PRPs, RKA-PRFs, and Applications
ded abstract of this paper appears in Advances in Cryptology – EUROCRYPT ’03, Lecture Notes in Computer Science Vol. 2656, E. Biham ed., Springer-Verlag, 2003. This is the full...
Mihir Bellare, Tadayoshi Kohno
EUROCRYPT
2003
Springer
13 years 9 months ago
CAPTCHA: Using Hard AI Problems for Security
We introduce captcha, an automated test that humans can pass, but current computer programs can’t pass: any program that has high success over a captcha can be used to solve an u...
Luis von Ahn, Manuel Blum, Nicholas J. Hopper, Joh...