Sciweavers

1342 search results - page 188 / 269
» Attacks are Protocols Too
Sort
View
JPDC
2006
105views more  JPDC 2006»
15 years 6 months ago
Mutual anonymous overlay multicast
Multicast services are demanded by a variety of applications. Many applications require anonymity during their communication. However, there has been very little work on anonymous...
Li Xiao, Yunhao Liu, Wenjun Gu, Dong Xuan, Xiaomei...
CRYPTO
2006
Springer
155views Cryptology» more  CRYPTO 2006»
15 years 10 months ago
A Method for Making Password-Based Key Exchange Resilient to Server Compromise
This paper considers the problem of password-authenticated key exchange (PAKE) in a client-server setting, where the server authenticates using a stored password file, and it is de...
Craig Gentry, Philip D. MacKenzie, Zulfikar Ramzan
ARESEC
2011
117views more  ARESEC 2011»
14 years 6 months ago
Non-Parallelizable and Non-Interactive Client Puzzles from Modular Square Roots
—Denial of Service (DoS) attacks aiming to exhaust the resources of a server by overwhelming it with bogus requests have become a serious threat. Especially protocols that rely o...
Yves Igor Jerschow, Martin Mauve
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
16 years 7 months ago
Non-malleable extractors and symmetric key cryptography from weak secrets
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
Yevgeniy Dodis, Daniel Wichs
ISCC
2009
IEEE
149views Communications» more  ISCC 2009»
16 years 1 months ago
A secure variant of the Hill Cipher
The Hill cipher is a classical symmetric encryption algorithm that succumbs to the know-plaintext attack. Although its vulnerability to cryptanalysis has rendered it unusable in p...
Mohsen Toorani, Abolfazl Falahati