Sciweavers

20 search results - page 1 / 4
» The Rabin cryptosystem revisited
Sort
View
ACNS
2010
Springer
135views Cryptology» more  ACNS 2010»
13 years 8 months ago
Okamoto-Tanaka Revisited: Fully Authenticated Diffie-Hellman with Minimal Overhead
Rosario Gennaro, Hugo Krawczyk, Tal Rabin
INDOCRYPT
2004
Springer
13 years 10 months ago
A Provably Secure Elliptic Curve Scheme with Fast Encryption
Abstract. We present a new elliptic curve cryptosystem with fast encryption and key generation, which is provably secure in the standard model. The scheme uses arithmetic modulo n2...
David Galindo, Sebastià Martín Molle...
ICISC
1998
87views Cryptology» more  ICISC 1998»
13 years 6 months ago
Rabin and RSA analogues based on non-maximal imaginary quadratic orders
Abstract. In 14] and 21] there are proposed ElGamal-type cryptosystems based on non-maximal imaginary quadratic orders with fast trapdoor decryption. The trapdoor information is th...
Detlef Hühnlein, Andreas Meyer, Tsuyoshi Taka...
CRYPTO
1998
Springer
106views Cryptology» more  CRYPTO 1998»
13 years 9 months ago
New Efficient and Secure Protocols for Verifiable Signature Sharing and Other Applications
Verifiable Signature Sharing (VS ) enables the recipient of a digital signature, who is not necessarily the original signer, to share such signature among n proxies so that a subse...
Dario Catalano, Rosario Gennaro
CCS
1997
ACM
13 years 9 months ago
On the Importance of Securing Your Bins: The Garbage-man-in-the-middle Attack
In this paper, we address the following problem: \ Is it possible to weaken/attack a scheme when a (provably) secure cryptosystem is used? ". The answer is yes. We exploit we...
Marc Joye, Jean-Jacques Quisquater