Sciweavers

13 search results - page 2 / 3
» On the Insecurity of a Server-Aided RSA Protocol
Sort
View
SCN
2010
Springer
232views Communications» more  SCN 2010»
13 years 3 months ago
Authenticated Key Agreement with Key Re-use in the Short Authenticated Strings Model
Serge Vaudenay [20] introduced a notion of Message Authentication (MA) protocols in the Short Authenticated String (SAS) model. A SAS-MA protocol authenticates arbitrarily long mes...
Stanislaw Jarecki, Nitesh Saxena
SP
1997
IEEE
139views Security Privacy» more  SP 1997»
13 years 8 months ago
Number Theoretic Attacks on Secure Password Schemes
Encrypted Key Exchange (EKE) [1, 2] allows two parties sharing a password to exchange authenticated information over an insecure network by using a combination of public and secre...
Sarvar Patel
STOC
1996
ACM
185views Algorithms» more  STOC 1996»
13 years 9 months ago
Adaptively Secure Multi-Party Computation
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...
Ran Canetti, Uriel Feige, Oded Goldreich, Moni Nao...
CORR
2010
Springer
128views Education» more  CORR 2010»
13 years 5 months ago
Random Oracles in a Quantum World
Once quantum computers reach maturity most of today's traditional cryptographic schemes based on RSA or discrete logarithms become vulnerable to quantum-based attacks. Hence, ...
Özgür Dagdelen, Marc Fischlin, Anja Lehm...
NDSS
2002
IEEE
13 years 10 months ago
Performance Analysis of TLS Web Servers
TLS is the protocol of choice for securing today’s ecommerce and online transactions, but adding TLS to a web server imposes a significant overhead relative to an insecure web ...
Cristian Coarfa, Peter Druschel, Dan S. Wallach