Threshold cryptosystems from threshold fully homomorphic encryption
From MaRDI portal
Publication:1673409
Recommendations
Cited in
(47)- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
- Threshold-optimal MPC with friends and foes
- BETA: biometric-enabled threshold authentication
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
- Multi-party threshold private set intersection with sublinear communication
- Combiners for functional encryption, unconditionally
- Better than advertised security for non-interactive threshold signatures
- How to recover a secret with \(O(n)\) additions
- Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
- Gladius: LWR Based Efficient Hybrid Public Key Encryption with Distributed Decryption
- \textit{Flood and submerse}: distributed key generation and robust threshold signature from lattices
- Adaptively secure 5 round threshold signatures from \textsf{MLWE}/\textsf{MSIS} and \textsf{DL} with rewinding
- Threshold encryption with silent setup
- Two-round threshold signature from algebraic one-more learning with errors
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
- Two-round MPC: information-theoretic and black-box
- Adaptively secure distributed PRFs from LWE
- Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof?
- Efficient and universally composable single secret leader election from pairings
- Practical lattice-based distributed signatures for a small number of signers
- Efficient, actively secure MPC with a dishonest majority: a survey
- Maliciously secure massively parallel computation for all-but-one corruptions
- Threshold fully homomorphic encryption over the torus
- Threshold schemes from isogeny assumptions
- Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}}
- Robust Distributed Pseudorandom Functions for mNP Access Structures
- On the round complexity of fully secure solitary MPC with honest majority
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- Provable security against decryption failure attacks from LWE
- Threshold ring signatures: new definitions and post-quantum security
- Secure MPC: laziness leads to GOD
- Adaptively secure threshold symmetric-key encryption
- MuSig-L: lattice-based multi-signature with single-round online phase
- Adaptively secure MPC with sublinear communication complexity
- Mixed-technique multi-party computations composed of two-party computations
- Quantum-resistant password-based threshold single-sign-on authentication with updatable server private key
- Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus
- Twinkle: threshold signatures from DDH with full adaptive security
- Threshold raccoon: practical threshold signatures from standard lattice assumptions
- Rational modular encoding in the DCR setting: non-interactive range proofs and Paillier-based Naor-Yung in the standard model
- An efficient threshold access-structure for RLWE-based multiparty homomorphic encryption
- Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\)
- Fast two-party signature for upgrading ECDSA to two-party scenario easily
- Privacy-preserving mixed set operations
- SLAP: simpler, improved private stream aggregation from ring learning with errors
- Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
This page was built for publication: Threshold cryptosystems from threshold fully homomorphic encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1673409)
