Sciweavers

154 search results - page 31 / 31
» Proving Group Protocols Secure Against Eavesdroppers
Sort
View
CRYPTO
2007
Springer
132views Cryptology» more  CRYPTO 2007»
13 years 11 months ago
How Should We Solve Search Problems Privately?
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinre...
ICNS
2009
IEEE
13 years 11 months ago
Counter-Flooding: DoS Protection for Public Key Handshakes in LANs
—The majority of security protocols employ public key cryptography for authentication at least in the connection setup phase. However, verifying digital signatures is an expensiv...
Yves Igor Jerschow, Björn Scheuermann, Martin...
TACAS
2004
Springer
108views Algorithms» more  TACAS 2004»
13 years 10 months ago
The Succinct Solver Suite
Abstract. The Succinct Solver Suite offers two analysis engines for solving data and control flow problems expressed in clausal form in a large fragment of first order logic. Th...
Flemming Nielson, Hanne Riis Nielson, Hongyan Sun,...
ASIACRYPT
2001
Springer
13 years 8 months ago
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
Nicolas Courtois