Two Generic Constructions of Probabilistic Cryptosystems and Their Applications
From MaRDI portal
Publication:3540038
DOI10.1007/978-3-540-85855-3_7zbMath1180.94048OpenAlexW1485264737MaRDI QIDQ3540038
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
quadratic fieldsstandard modelPaillier cryptosystemgeneric constructionprobabilistic encryptionhomomorphic schemeIND-CPA and IND-CCA2 security
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic encryption
- Elliptic curve Paillier schemes
- A new public-key cryptosystem over a quadratic order with quadratic decryption time.
- An efficient probabilistic public-key cryptosystem over quadratic fields quotients
- Practical multi-candidate election system
- Receipt-free secret-ballot elections (extended abstract)
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- 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
- Information Security
This page was built for publication: Two Generic Constructions of Probabilistic Cryptosystems and Their Applications