Benaloh’s Dense Probabilistic Encryption Revisited
From MaRDI portal
Publication:3011926
DOI10.1007/978-3-642-21969-6_22zbMath1280.94055arXiv1008.2991OpenAlexW1768836513MaRDI QIDQ3011926
Laurent Fousse, Pascal Lafourcade, Mohamed Alnuaimi
Publication date: 29 June 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1008.2991
Related Items
Privacy-preserving anomaly detection in cloud with lightweight homomorphic encryption, Privacy and verifiability in voting systems: methods, developments and trends
Uses Software
Cites Work
- A verifiable secret shuffle of homomorphic encryptions
- Receipt-free secret-ballot elections (extended abstract)
- Multi-Authority Secret-Ballot Elections with Linear Work
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
- Fully Homomorphic Encryption over the Integers
- Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
- i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
- A method for obtaining digital signatures and public-key cryptosystems
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Fully homomorphic encryption using ideal lattices
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - CRYPTO 2003
- Progress in Cryptology – Mycrypt 2005
- Theory of Cryptography
- Information Security and Cryptology - ICISC 2003
- Theory of Cryptography
- Computer Aided Verification
- Advances in Cryptology - ASIACRYPT 2003
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item