315 search results - page 41 / 63 » Number Theoretic Attacks on Secure Password Schemes |
IDTRUST
2010
ACM
14 years 29 days ago
2010
ACM
Whilst the growing number of identity management systems have the potential to reduce the threat of identity attacks, major deployment problems remain because of the lack of inter...
EUROCRYPT
2004
Springer
14 years 1 months ago
2004
Springer
We provide methods for transforming an encryption scheme susceptible to decryption errors into one that is immune to these errors. Immunity to decryption errors is vital when const...
CANS
2008
Springer
13 years 9 months ago
2008
Springer
In a (r, n)-threshold secret sharing scheme, no group of (r - 1) colluding members can recover the secret value s. However, the number of colluders is likely to increase over time...
ACISP
2001
Springer
14 years 5 days ago
2001
Springer
Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
We present a non-malleable commitment scheme that retains its security properties even when concurrently executed a polynomial number of times. That is, a manin-the-middle adversa...