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
• scientific article; zbMATH DE number 1303131
• scientific article; zbMATH DE number 1302835
• A Practical Public Key Cryptosystem from Paillier and Rabin Schemes
• scientific article; zbMATH DE number 2081075

Cites work

• 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
• scientific article; zbMATH DE number 1618044 (Why is no real title available?)
• scientific article; zbMATH DE number 176555 (Why is no real title available?)
• scientific article; zbMATH DE number 1303131 (Why is no real title available?)
• scientific article; zbMATH DE number 1341866 (Why is no real title available?)
• scientific article; zbMATH DE number 2086698 (Why is no real title available?)
• scientific article; zbMATH DE number 1394325 (Why is no real title available?)
• Information Security
• 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
• scientific article; zbMATH DE number 1583807 (Why is no real title available?)
• 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)