Sciweavers

281 search results - page 22 / 57
» Non-black-box Techniques in Cryptography
Sort
View
EUROCRYPT
2007
Springer
14 years 1 months ago
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
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...
Yehuda Lindell, Benny Pinkas
FSE
2007
Springer
192views Cryptology» more  FSE 2007»
14 years 4 months ago
Algebraic Cryptanalysis of 58-Round SHA-1
In 2004, a new attack against SHA-1 has been proposed by a team leaded by Wang [15]. The aim of this article5 is to sophisticate and improve Wang’s attack by using algebraic tech...
Makoto Sugita, Mitsuru Kawazoe, Ludovic Perret, Hi...
SAT
2009
Springer
126views Hardware» more  SAT 2009»
14 years 4 months ago
Extending SAT Solvers to Cryptographic Problems
Cryptography ensures the confidentiality and authenticity of information but often relies on unproven assumptions. SAT solvers are a powerful tool to test the hardness of certain ...
Mate Soos, Karsten Nohl, Claude Castelluccia
DSN
2007
IEEE
14 years 4 months ago
Protecting Cryptographic Keys from Memory Disclosure Attacks
Cryptography has become an indispensable mechanism for securing systems, communications and applications. While offering strong protection, cryptography makes the assumption that ...
Keith Harrison, Shouhuai Xu
ACNS
2009
Springer
124views Cryptology» more  ACNS 2009»
14 years 4 months ago
Novel Precomputation Schemes for Elliptic Curve Cryptosystems
We present an innovative technique to add elliptic curve points with the form P Q± , and discuss its application to the generation of precomputed tables for the scalar multiplicat...
Patrick Longa, Catherine H. Gebotys