Improved universal thresholdizer from iterative Shamir secret sharing
From MaRDI portal
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- Coin flipping by telephone a protocol for solving impossible problems
- Constant-Round MPC with Fairness and Guarantee of Output Delivery
- Cryptography with weights: MPC, encryption and signatures
- Decentralizing attribute-based encryption
- Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
- Efficient homomorphic comparison methods with optimal complexity
- Fast secure two-party ECDSA signing
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- FE for inner products and its application to decentralized ABE
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Functional encryption for threshold functions (or fuzzy IBE) from lattices
- Homomorphic encryption for arithmetic of approximate numbers
- How to recover a secret with O(n) additions
- How to share a function securely
- How to share a secret
- scientific article; zbMATH DE number 1722676 (Why is no real title available?)
- scientific article; zbMATH DE number 1808277 (Why is no real title available?)
- scientific article; zbMATH DE number 7725605 (Why is no real title available?)
- Lattice-based fully dynamic multi-key FHE with short ciphertexts
- Linear Threshold Secret-Sharing with Binary Reconstruction
- Monotone Circuits for the Majority Function
- Multi-key FHE from LWE, revisited
- Multiparty computation with low communication, computation and interaction via threshold FHE
- On (Valiant’s) Polynomial-Size Monotone Formula for Majority
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Practical threshold signatures
- Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
- Robust threshold DSS signatures
- Round-optimal lattice-based threshold signatures, revisited
- Secure MPC: laziness leads to GOD
- Security of Ramp Schemes
- Short monotone formulae for the majority function
- Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus
- Threshold cryptosystems from threshold fully homomorphic encryption
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Threshold-optimal DSA/ECDSA signatures and an application to bitcoin wallet security
- Two round multiparty computation via multi-key FHE
- Two-round threshold lattice-based signatures from threshold homomorphic encryption
- Using amplification to compute majority with small majority gates
- Using level-1 homomorphic encryption to improve threshold DSA signatures for Bitcoin wallet security
- Verifiable random functions from non-interactive witness-indistinguishable proofs
This page was built for publication: Improved universal thresholdizer from iterative Shamir secret sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7021185)
