Results 1 - 10 of 241

Public-key cryptosystems based on composite degree residuosity classes

by Pascal Paillier - IN ADVANCES IN CRYPTOLOGY — EUROCRYPT 1999 , 1999
"... This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new trapdoor mechanism and derive from this technique three encryption schemes: a trapdoor permutation and two homomorphic probabilist ..."
Abstract - Cited by 1009 (4 self) - Add to MetaCart
This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new trapdoor mechanism and derive from this technique three encryption schemes: a trapdoor permutation and two homomorphic

Multiparty Computation from Threshold Homomorphic Encryption

by Ronald Cramer, Jesper B. Nielsen , 2001
"... Abstract. We introduce a new approach to multiparty computation (MPC) basing it on homomorphic threshold crypto-systems. We show that given keys for any sufficiently efficient system of this type, general MPC protocols for n parties can be devised which are secure against an active adversary that co ..."
Abstract - Cited by 166 (14 self) - Add to MetaCart
Abstract. We introduce a new approach to multiparty computation (MPC) basing it on homomorphic threshold crypto-systems. We show that given keys for any sufficiently efficient system of this type, general MPC protocols for n parties can be devised which are secure against an active adversary

Efficient Fully Homomorphic Encryption from (Standard) LWE

by Zvika Brakerski, Vinod Vaikuntanathan - LWE, FOCS 2011, IEEE 52ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, IEEE , 2011
"... We present a fully homomorphic encryption scheme that is based solely on the (standard) learning with errors (LWE) assumption. Applying known results on LWE, the security of our scheme is based on the worst-case hardness of “short vector problems ” on arbitrary lattices. Our construction improves on ..."
Abstract - Cited by 120 (6 self) - Add to MetaCart
We present a fully homomorphic encryption scheme that is based solely on the (standard) learning with errors (LWE) assumption. Applying known results on LWE, the security of our scheme is based on the worst-case hardness of “short vector problems ” on arbitrary lattices. Our construction improves

Homomorphic Elgamal Encryption in NoSQL for Secure Cloud

by Shagufta Praveen , M Tech Scholar
"... ABSTRACT: NoSQL adopted by number of leading organizations. RDBMS doesn't fit with today's Big Data scenario. Rapid growths of data not only ask for storage but ask for its security too. This paper provides the specific method to secure data on cloud with the help of Homophormic Elgamal E ..."
Abstract - Add to MetaCart
ABSTRACT: NoSQL adopted by number of leading organizations. RDBMS doesn't fit with today's Big Data scenario. Rapid growths of data not only ask for storage but ask for its security too. This paper provides the specific method to secure data on cloud with the help of Homophormic Elgamal

Security of Signed ElGamal Encryption

by Claus Peter Schnorr, Markus Jakobsson - In Asiacrypt ’2000, LNCS 1976 , 2000
"... . 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 the adaptive chosen ciphertext attack, in which an attacker can freely use a decryption oracle except for the target c ..."
Abstract - Cited by 44 (4 self) - Add to MetaCart
. 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 the adaptive chosen ciphertext attack, in which an attacker can freely use a decryption oracle except for the target

1 Homomorphic Encryption

by David Mandell Freeman , 2011
"... Let’s start by considering ElGamal encryption on elliptic curves: ..."
Abstract - Add to MetaCart
Let’s start by considering ElGamal encryption on elliptic curves:

Encoding-Free ElGamal Encryption Without Random Oracles

by Benoît Chevallier-mames, Pascal Paillier, David Pointcheval , 2006
"... ElGamal encryption is the most extensively used alternative to RSA. Easily adaptable to many kinds of cryptographic groups, ElGamal encryption enjoys homomorphic properties while remaining semantically secure providing that the DDH assumption holds on the chosen group. Its practical use, unfortuna ..."
Abstract - Cited by 5 (1 self) - Add to MetaCart
to ruin the standard model security of the system. This paper introduces a new alternative to group encodings and hash functions which remains fully compatible with standard model security properties. Partially homomorphic in customizable ways, our encryptions are comparable to plain ElGamal in efficiency

Leakage Resilient ElGamal Encryption

by Eike Kiltz, Krzysztof Pietrzak
"... Abstract. Blinding is a popular and well-known countermeasure to protect public-key cryptosystems against side-channel attacks. The high level idea is to randomize an exponentiation in order to prevent multiple measurements of the same operation on different data, as such measurements might allow th ..."
Abstract - Cited by 20 (0 self) - Add to MetaCart
. In particular, we consider a multiplicatively blinded version of ElGamal public-key encryption where – we prove that the scheme, instantiated over bilinear groups of prime order p (where p−1 is not smooth) is leakage resilient in the genericgroup model. Here we consider the model of chosen-ciphertext security

Review on Generating Private Recommendations Using Elgamal Homomorphic Encryption

by Swapnali B Swami , Soniya N Madavi , Post Graduate , 2007
"... ABSTRACT: User's private or sensitive data can be misused because of curious administrators in online applications. Traditional ways of protecting data involve security of user's privacy against third party but not from the service provider. To protect user's data we present an encry ..."
Abstract - Add to MetaCart
an encryption technique and generate recommendations. Recommendations are generated by processing data under encryption. Generating recommendations have become an important research area for the purpose of user's privacy. By introducing a multiparty computation technique (MPC) the active participation

Universal Re-encryption for Mixnets

by Philippe Golle , Markus Jakobsson, Ari Juels, Paul Syverson - IN PROCEEDINGS OF THE 2004 RSA CONFERENCE, CRYPTOGRAPHER’S TRACK , 2002
"... We introduce a new cryptographic technique that we call universal re-encryption. A conventional cryptosystem that permits reencryption, such as ElGamal, does so only for a player with knowledge of the public key corresponding to a given ciphertext. In contrast, universal re-encryption can be don ..."
Abstract - Cited by 112 (10 self) - Add to MetaCart
be done without knowledge of public keys. We propose an asymmetric cryptosystem with universal re-encryption that is half as efficient as standard ElGamal in terms of computation and storage. While
Results 1 - 10 of 241