135 search results - page 6 / 27 » Formal Indistinguishability Extended to the Random Oracle Mo... |
ACNS
2006
Springer
14 years 1 months ago
2006
Springer
We propose a new password-based 3-party protocol with a formal security proof in the standard model. Under reasonable assumptions we show that our new protocol is more efficient t...
ASIACRYPT
2000
Springer
13 years 12 months ago
2000
Springer
Assuming a cryptographically strong cyclic group G of prime order q and a random hash function H, we show that ElGamal encryption with an added Schnorr signature is secure against ...
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
Signcryption [35] is a public key primitive that achieves the functionality of both an encryption scheme and a signature scheme simultaneously. It does this more efficiently than a...
PROVSEC
2009
Springer
14 years 1 days ago
2009
Springer
Abstract. Oracle separation methods are used in cryptography to rule out blackbox reductions between cryptographic primitives. It is sufficient to find an oracle relative to whic...
TC
2008
13 years 7 months ago
2008
In a distributed key distribution scheme, a set of servers help a set of users in a group to securely obtain a common key. Security means that an adversary who corrupts some server...