Threshold Cryptosystems Based on Factoring
From MaRDI portal
Publication:4412798
Recommendations
Cited in
(18)- Threshold cryptosystems from threshold fully homomorphic encryption
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- Secure multiparty computation with sublinear preprocessing
- A signature scheme for a dynamic coalition defence environment without trusted third parties
- The dark side of threshold cryptography
- Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
- A Generalization and a Variant of Two Threshold Cryptosystems Based on Factoring
- Hierarchical and dynamic threshold Paillier cryptosystem without trusted dealer
- Эллиптическая пороговая схема разделения секрета
- A public-key threshold cryptosystem based on residue rings
- Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\)
- Better than advertised security for non-interactive threshold signatures
- Lattice-Based Secure Biometric Authentication for Hamming Distance
- Threshold raccoon: practical threshold signatures from standard lattice assumptions
- Adaptively secure BLS threshold signatures from DDH and co-CDH
- Resolving the efficiency-utility dilemma of threshold linearly homomorphic encryption via message-space adapter
- Simplified adaptively secure threshold BLS signatures
- HARTS: high-threshold, adaptively secure, and robust threshold Schnorr signatures
This page was built for publication: Threshold Cryptosystems Based on Factoring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4412798)