Sciweavers

57 search results - page 2 / 12
» Addition of ElGamal Plaintexts
Sort
View
PKC
2009
Springer
115views Cryptology» more  PKC 2009»
14 years 6 months ago
Compact CCA-Secure Encryption for Messages of Arbitrary Length
This paper proposes a chosen-ciphertext secure variant of the ElGamal public-key encryption scheme which generates very compact ciphertexts for messages of arbitrary length. The ci...
Masayuki Abe, Eike Kiltz, Tatsuaki Okamoto
CSREASAM
2006
13 years 7 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
ISW
2007
Springer
13 years 11 months ago
Towards a DL-Based Additively Homomorphic Encryption Scheme
ElGamal scheme has been the first encryption scheme based on discrete logarithm. One of its main advantage is that it is simple, natural and efficient, but also that its security ...
Guilhem Castagnos, Benoît Chevallier-Mames
AINA
2003
IEEE
13 years 9 months ago
Signature Schemes Based on Two Hard Problems Simultaneously
In 1994, Harn proposed a signature scheme based on the modified ElGamal's scheme and claimed that the security relies on both of the factorization and the discrete logarithm....
Ching-Te Wang, Chu-Hsing Lin, Chin-Chen Chang
TYPES
2004
Springer
13 years 11 months ago
A Machine-Checked Formalization of the Random Oracle Model
Abstract. Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowl...
Gilles Barthe, Sabrina Tarento