Strongly secure universal thresholdizer
From MaRDI portal
Cites work
- An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract)
- Better than advertised security for non-interactive threshold signatures
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- FROST: Flexible round-optimized Schnorr threshold signatures
- Functional encryption for threshold functions (or fuzzy IBE) from lattices
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- scientific article; zbMATH DE number 1304081 (Why is no real title available?)
- scientific article; zbMATH DE number 1950616 (Why is no real title available?)
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Key homomorphic PRFs and their applications
- Key-homomorphic pseudorandom functions from LWE with small modulus
- New and improved key-homomorphic pseudorandom functions
- Practical threshold signatures
- Round-optimal lattice-based threshold signatures, revisited
- Short signatures from the Weil pairing
- Threshold cryptosystems from threshold fully homomorphic encryption
- Threshold raccoon: practical threshold signatures from standard lattice assumptions
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
- Two-round threshold lattice-based signatures from threshold homomorphic encryption
Cited in
(2)
This page was built for publication: Strongly secure universal thresholdizer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6965291)