Threshold secret sharing with geometric algebras
From MaRDI portal
(Redirected from Publication:6496087)
Recommendations
- Geometrical contributions to secret sharing theory
- scientific article; zbMATH DE number 4181284
- An ideal and perfect \((t, n)\) multi-secret sharing scheme based on finite geometry
- Algebraic geometric secret sharing schemes over large fields are asymptotically threshold
- scientific article; zbMATH DE number 1248184
Cites work
- A \((t,n)\) multi-secret sharing scheme
- A new \((t,n)\) multi-secret sharing scheme based on Shamir's secret sharing
- A new efficient \((t,n)\) verifiable multi-secret sharing (VMSS) based on YCH scheme
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- Computing arbitrary functions of encrypted data
- Definitions and properties of zero-knowledge proof systems
- Efficient fully homomorphic encryption from (standard) LWE
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption using ideal lattices
- Homomorphic encryption for arithmetic of approximate numbers
- How to delegate and verify in public: verifiable computation from attribute-based encryption
- How to share a secret
- scientific article; zbMATH DE number 1627116 (Why is no real title available?)
- scientific article; zbMATH DE number 4101088 (Why is no real title available?)
- scientific article; zbMATH DE number 176565 (Why is no real title available?)
- scientific article; zbMATH DE number 2010195 (Why is no real title available?)
- Implementing Gentry's fully-homomorphic encryption scheme
- More Efficient Match-Making and Satisfiability The Five Card Trick
- On the Composition of Zero-Knowledge Proof Systems
- Probabilistic encryption
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Secret-Sharing Schemes: A Survey
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
- Threshold cryptography based on Asmuth-Bloom secret sharing
- Verifiable Computation over Large Database with Incremental Updates
This page was built for publication: Threshold secret sharing with geometric algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496087)