Provably secure threshold paillier encryption based on hyperplane geometry
From MaRDI portal
Recommendations
Cites work
- Efficient set operations in the presence of malicious adversaries
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to share a function securely
- scientific article; zbMATH DE number 176567 (Why is no real title available?)
- scientific article; zbMATH DE number 1302792 (Why is no real title available?)
- scientific article; zbMATH DE number 1302840 (Why is no real title available?)
- scientific article; zbMATH DE number 1303139 (Why is no real title available?)
- scientific article; zbMATH DE number 1759349 (Why is no real title available?)
- Practical multi-candidate election system
- Practical threshold signatures
- Privacy-Preserving Set Operations
- Robust and efficient sharing of RSA functions
Cited in
(4)
This page was built for publication: Provably secure threshold paillier encryption based on hyperplane geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817804)