Sciweavers

209 search results - page 27 / 42
» Secure Hash-and-Sign Signatures Without the Random Oracle
Sort
View
CRYPTO
1989
Springer
163views Cryptology» more  CRYPTO 1989»
15 years 7 months ago
Undeniable Signatures
Abstract. In this paper, we provide a new approach to study undeniable signatures by translating secure digital signatures to secure undeniable signatures so that the existing algo...
David Chaum, Hans Van Antwerpen
IWSEC
2009
Springer
15 years 9 months ago
ID-Based Group Password-Authenticated Key Exchange
Abstract—Password-authenticated key exchange (PAKE) protocols are designed to be secure even when the secret key used for authentication is a human-memorable password. In this pa...
Xun Yi, Raylin Tso, Eiji Okamoto
CRYPTO
2008
Springer
84views Cryptology» more  CRYPTO 2008»
15 years 4 months ago
Improved Bounds on Security Reductions for Discrete Log Based Signatures
Despite considerable research efforts, no efficient reduction from the discrete log problem to forging a discrete log based signature (e.g. Schnorr) is currently known. In fact, ne...
Sanjam Garg, Raghav Bhaskar, Satyanarayana V. Loka...
ICALP
2005
Springer
15 years 8 months ago
Hierarchical Group Signatures
We introduce the notion of hierarchical group signatures. This is a proper generalization of group signatures, which allows multiple group managers organized in a tree with the si...
Mårten Trolin, Douglas Wikström
ICALP
2005
Springer
15 years 8 months ago
Completely Non-malleable Schemes
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...
Marc Fischlin