Sciweavers

21 search results - page 1 / 5
» A Provably Secure Elliptic Curve Scheme with Fast Encryption
Sort
View
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...
CSREASAM
2006
13 years 6 months ago
Finding Minimum Optimal Path Securely Using Homomorphic Encryption Schemes in Computer Networks
- In this paper we find a secure routing protocol for computer networks, which finds minimum optimum path using homomorphic encryption schemes. We briefly look into the existing ho...
Levent Ertaul, Vaidehi Kedlaya
ESORICS
2004
Springer
13 years 10 months ago
A Public-Key Encryption Scheme with Pseudo-random Ciphertexts
This work presents a practical public-key encryption scheme that offers security under adaptive chosen-ciphertext attack (CCA) and has pseudo-random ciphertexts, i.e. ciphertexts ...
Bodo Möller
MASCOTS
2001
13 years 6 months ago
Performance of Finite Field Arithmetic in an Elliptic Curve Cryptosystem
As the Internet commerce becomes a more important part of the economy, network security is receiving more emphasis. Time spent in data encryption can be a significant performance ...
Zhi Li, John Higgins, Mark J. Clement
ASIACRYPT
2000
Springer
13 years 9 months ago
Trapdooring Discrete Logarithms on Elliptic Curves over Rings
This paper introduces three new probabilistic encryption schemes using elliptic curves over rings. The cryptosystems are based on three specific trapdoor mechanisms allowing the r...
Pascal Paillier