Sciweavers

92 search results - page 17 / 19
» Provable Secure Generalized Signcryption
Sort
View
CRYPTO
2006
Springer
155views Cryptology» more  CRYPTO 2006»
13 years 9 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
SIGCOMM
2010
ACM
13 years 6 months ago
NetFence: preventing internet denial of service from inside out
Denial of Service (DoS) attacks frequently happen on the Internet, paralyzing Internet services and causing millions of dollars of financial loss. This work presents NetFence, a s...
Xin Liu, Xiaowei Yang, Yong Xia
CRYPTO
2005
Springer
144views Cryptology» more  CRYPTO 2005»
13 years 11 months ago
Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes
We investigate several previously suggested scenarios of instantiating random oracles (ROs) with “realizable” primitives in cryptographic schemes. As candidates for such “in...
Alexandra Boldyreva, Marc Fischlin
PODC
2004
ACM
13 years 11 months ago
Asynchronous group key exchange with failures
Group key exchange protocols allow a group of servers communicating over an asynchronous network of point-to-point links to establish a common key, such that an adversary which fu...
Christian Cachin, Reto Strobl
ASIACRYPT
2010
Springer
13 years 3 months ago
Lattice-Based Blind Signatures
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...
Markus Rückert