scientific article; zbMATH DE number 1942426
From MaRDI portal
Publication:4409124
Recommendations
- Publicly verifiable secret sharing using non-abelian groups
- A verifiable secret sharing scheme using non-abelian groups
- On Secure Multi-party Computation in Black-Box Groups
- scientific article; zbMATH DE number 826068
- Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields
- On abelian and homomorphic secret sharing schemes
- Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution
- On group-characterizability of homomorphic secret sharing schemes
- Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes
- Secret sharing using non-commutative groups and the shortlex order
Cited in
(24)- Adaptively secure distributed PRFs from LWE
- On ideal homomorphic secret sharing schemes and their decomposition
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
- On abelian and homomorphic secret sharing schemes
- Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
- On group-characterizability of homomorphic secret sharing schemes
- Efficient integer span program for hierarchical threshold access structure
- On the communication required for unconditionally secure multiplication
- Evolving perfect hash families: a combinatorial viewpoint of evolving secret sharing
- scientific article; zbMATH DE number 1305506 (Why is no real title available?)
- scientific article; zbMATH DE number 826068 (Why is no real title available?)
- Threshold secret sharing requires a linear-size alphabet
- Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields
- Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\)
- How to recover a secret with O(n) additions
- Secure multiparty computation from threshold encryption based on class groups
- On sigma-protocols and (packed) black-box secret sharing schemes
- Efficient robust secret sharing from expander graphs
- Resolving the efficiency-utility dilemma of threshold linearly homomorphic encryption via message-space adapter
- Partially non-interactive two-round lattice-based threshold signatures
- A note on short invertible ring elements and applications to cyclotomic and trinomials number fields
- A construction of evolving k-threshold secret sharing scheme over a polynomial ring
- A construction of evolving 3-threshold secret sharing scheme with perfect security and smaller share size
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4409124)
