Two Generic Constructions of Probabilistic Cryptosystems and Their Applications

DOI10.1007/978-3-540-85855-3_7MaRDI QIDQ3540038zbMATH OpenOpenAlexFDO

Authors Guilhem Castagnos

Publication date 20 November 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85855-3_7

zbMATH Keywords

generic constructionhomomorphic schemeIND-CPA and IND-CCA2 securityPaillier cryptosystemprobabilistic encryptionquadratic fieldsstandard model

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 2079933
• A new public-key cryptosystem as secure as factoring
• A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
• A practical public key cryptosystem from Paillier and Rabin schemes
• scientific article; zbMATH DE number 2081075

Cites work

• A generalisation, a simplification and some applications of Paillier's probabilistic public-key system
• A new elliptic curve based analogue of RSA
• A new public-key cryptosystem as secure as factoring
• A new public-key cryptosystem over a quadratic order with quadratic decryption time.
• An efficient probabilistic public-key cryptosystem over quadratic fields quotients
• Elliptic curve Paillier schemes
• How to enhance the security of public-key encryption at minimum cost
• scientific article; zbMATH DE number 2086698 (Why is no real title available?)
• Information Security
• New public-key schemes based on elliptic curves over the ring \(\mathbb Z_ n\)
• Practical multi-candidate election system
• Probabilistic encryption
• Public-key cryptosystems based on composite degree residuosity classes
• Receipt-free secret-ballot elections (extended abstract)
• The hardness of Hensel lifting: the case of RSA and discrete logarithm
• Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security

Cited in

(4)

• An efficient probabilistic public-key cryptosystem over quadratic fields quotients
• Trapdooring discrete logarithms on elliptic curves over rings
• An efficient IND-CCA2 secure Paillier-based cryptosystem
• Efficient cryptosystems from \(2^k\)-th power residue symbols

This page was built for publication: Two Generic Constructions of Probabilistic Cryptosystems and Their Applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540038)