On secret sharing systems
From MaRDI portal
Publication:4739795
Recommendations
Cited in
(only showing first 100 items - show all)- Two new classes of projective two-weight linear codes
- Multisecret-sharing schemes and bounded distance decoding of linear codes
- Verifiable Multi-secret Sharing Schemes for Multiple Threshold Access Structures
- Matroids Can Be Far from Ideal Secret Sharing
- A note on dynamic threshold schemes
- On identification secret sharing schemes.
- Bounds And Constructions For Threshold Shared Generation Of Authenticators
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- An improvement on the Lin-Wu \((t,n)\) threshold verifiable multi-secret sharing scheme
- Secure two-party computation: a visual way
- A geometric characterization of minimal codes and their asymptotic performance
- Weighted decomposition construction for perfect secret sharing schemes
- On Linear Secret Sharing for Connectivity in Directed Graphs
- A dynamic secret sharing scheme with cheater detection
- A nonlinear secret sharing scheme
- scientific article; zbMATH DE number 1424185 (Why is no real title available?)
- On the information ratio of non-perfect secret sharing schemes
- Key-policy attribute-based encryption for Boolean circuits from bilinear maps
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Optimal complexity of secret sharing schemes with four minimal qualified subsets
- Secret sharing schemes with partial broadcast channels
- Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid
- General information dispersal algorithms
- Combinatorial lower bounds for secret sharing schemes
- scientific article; zbMATH DE number 1024085 (Why is no real title available?)
- Cutting-edge cryptography through the lens of secret sharing
- On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate
- Summing over a network without revealing summands
- scientific article; zbMATH DE number 4179276 (Why is no real title available?)
- Secret-sharing schemes for very dense graphs
- Ideal ramp schemes and related combinatorial objects
- A simple primal-dual approximation algorithm for 2-edge-connected spanning subgraphs
- On secret sharing schemes
- Developing a multiple secret sharing scheme by residue number system
- On secret set schemes
- scientific article; zbMATH DE number 177621 (Why is no real title available?)
- Some democratic secret sharing schemes
- scientific article; zbMATH DE number 467267 (Why is no real title available?)
- Ideal multipartite secret sharing schemes
- Ideal homomorphic secret sharing schemes over cyclic groups
- On secret sharing communication systems with two or three channels
- Homomorphic extensions of CRT-based secret sharing
- Public Key Cryptography - PKC 2006
- Improvement of assurance including security for wireless sensor networks using dispersed data transmission
- A new approach to construct secret sharing schemes based on field extensions
- Introduction to secret-sharing
- scientific article; zbMATH DE number 2149833 (Why is no real title available?)
- Multi-recipient and threshold encryption based on hidden multipliers
- Lower bounds for monotone span programs
- On the information rate of secret sharing schemes
- An ideal multi-secret sharing scheme based on MSP
- Fully dynamic secret sharing schemes
- A state-tree based \((t,n)\) secret sharing scheme
- Blakley type secret sharing scheme based on the intersection of subspaces
- New secret sharing scheme based on linear code
- Multiple assignment scheme for sharing secret
- Multipartite secret sharing by bivariate interpolation
- On proper secrets, (t,k)-bases and linear codes
- On ideal homomorphic secret sharing schemes and their decomposition
- Analysis of secret sharing schemes based on Nielsen transformations
- Improving the linear programming technique in the search for lower bounds in secret sharing
- Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
- Construction of arithmetic secret sharing schemes by using torsion limits
- Hypergraph decomposition and secret sharing
- On secret sharing protocols
- A novel secret sharing scheme using multiple share images
- On ASGS framework: general requirements and an example of implementation
- An explication of secret sharing schemes
- Linear threshold multisecret sharing schemes
- A lower bound on the share size of leakage-resilient secret-sharing schemes
- On the size of shares for secret sharing schemes
- Linear multi-secret sharing schemes based on multi-party computation
- Secret sharing based on a hard-on-average problem
- scientific article; zbMATH DE number 4139670 (Why is no real title available?)
- Randomness recoverable secret sharing schemes
- Shared secret reconstruction
- Finding lower bounds on the complexity of secret sharing schemes by linear programming
- Reduced access structures with four minimal qualified subsets on six participants
- On the bound for anonymous secret sharing schemes
- Strong security of linear ramp secret sharing schemes with general access structures
- scientific article; zbMATH DE number 124015 (Why is no real title available?)
- Probability of shares in secret sharing schemes
- A Latin square autotopism secret sharing scheme
- Verifiable quantum \((k,n)\)-threshold secret key sharing
- On the dealer's randomness required in perfect secret sharing schemes with access structures of constant rank
- scientific article; zbMATH DE number 4195886 (Why is no real title available?)
- The arithmetic codex: theory and applications. (Abstract)
- Revisiting and extending the AONT-RS scheme: a robust computationally secure secret sharing scheme
- Sharing multiple secrets: Models, schemes and analysis
- Optimal assignment schemes for general access structures based on linear programming
- Cheating-immune secret sharing schemes from codes and cumulative arrays
- On constructing privileged coalitions in Shamir's type scheme
- Graph decompositions and secret sharing schemes
- On abelian and homomorphic secret sharing schemes
- Security games over lexicographic orders
- A method of protected distribution of data among unreliable and untrusted nodes
- A secret sharing scheme based on large numbers factorization
- Secret-sharing schemes and orthogonal systems of \(k\)-ary operations
- A perfect threshold secret sharing scheme to identify cheaters
- Ideal hierarchical secret sharing schemes
This page was built for publication: On secret sharing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4739795)