How to share a secret
From MaRDI portal
Recommendations
Cites work
- An explication of secret sharing schemes
- Characterizing Ideal Weighted Threshold Secret Sharing
- Ciphertext-policy hierarchical attribute-based encryption with short ciphertexts
- Discrete polymatroids
- Finding lower bounds on the complexity of secret sharing schemes by linear programming
- Hierarchical threshold secret sharing
- How to share a secret
- scientific article; zbMATH DE number 4179276 (Why is no real title available?)
- scientific article; zbMATH DE number 4195886 (Why is no real title available?)
- Ideal Hierarchical Secret Sharing Schemes
- Ideal multipartite secret sharing schemes
- Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
- Ideal secret sharing schemes with multipartite access structures
- Leakproof secret sharing protocols with applications to group identification scheme
- Lifetime maximization routing with network coding in wireless multihop networks
- Matroids Can Be Far from Ideal Secret Sharing
- Monotone circuits for monotone weighted threshold functions
- Multipartite secret sharing by bivariate interpolation
- Natural Generalizations of Threshold Secret Sharing
- On 2-level secret sharing
- On secret sharing schemes, matroids and polymatroids
- On secret sharing systems
- On the classification of ideal secret sharing schemes
- On the optimization of bipartite secret sharing schemes
- On the size of shares for secret sharing schemes
- Practical direct chosen ciphertext secure key-policy attribute-based encryption with public ciphertext test
- Practical distributed signatures in the standard model
- Rational secret sharing as extensive games
- Secret Sharing and Non-Shannon Information Inequalities
- Secret sharing schemes with bipartite access structure
- Secret-Sharing Schemes: A Survey
- The size of a share must be large
- Theory of Cryptography
- Three-level secret sharing schemes from the twisted cubic
- Weighted threshold secret sharing schemes
Cited in
(only showing first 100 items - show all)- On expected constant-round protocols for Byzantine agreement
- New schemes for sharing points on an elliptic curve
- Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
- Detection and identification of cheaters in \((t,n)\) secret sharing scheme
- Distortion-free secret image sharing mechanism using modulus operator
- On the security of a visual cryptography scheme for color images
- A comment on ``Sharing secrets in stego images with authentication
- Multipartite secret sharing by bivariate interpolation
- A sharing-based fragile watermarking method for authentication and self-recovery of image tampering
- Designing a secure e-tender submission protocol
- Hypergraph decomposition and secret sharing
- Linear connectivity problems in directed hypergraphs
- Generalized scheme for splitting arbitrary 2-qubit state with three 2-qubit entangled states
- An impossibility result on graph secret sharing
- Secure multiplication of shared secrets in the exponent
- Monotone circuits for monotone weighted threshold functions
- Strongly secure ramp secret sharing schemes for general access structures
- Partitioned encryption and achieving simultaneity by partitioning
- How to share a secret with cheaters
- Summing over a network without revealing summands
- On the power of two-point based sampling
- Secret sharing schemes for graph-based prohibited structures
- Univariate polynomial factorization over finite fields
- A cryptosystem for multiple communication
- A note on Master keys for group sharing
- On the classification of ideal secret sharing schemes
- Distributed user identification by zero-knowledge access rights proving
- Two distributed problems involving Byzantine processes
- Protocols for group oriented secret sharing
- Incidence structures applied to cryptography
- Some improved bounds on the information rate of perfect secret sharing schemes
- Strongly ideal secret sharing schemes
- An explication of secret sharing schemes
- Multiple assignment scheme for sharing secret
- How to avoid the cheaters succeeding in the key sharing scheme
- Secret sharing over infinite domains
- Ideal homomorphic secret sharing schemes over cyclic groups
- On the size of shares for secret sharing schemes
- Geometric secret sharing schemes and their duals
- On the structure of the privacy hierarchy
- The knowledge complexity of quadratic residuosity languages
- On dynamic threshold schemes
- A note on dynamic threshold schemes
- Anonymous secret sharing schemes
- Sharing one secret vs. sharing many secrets.
- On identification secret sharing schemes.
- Multi-party key agreement protocols with cheater identification
- Information flow on trees
- Secure distributed storage and retrieval
- Protecting data privacy in private information retrieval schemes
- New efficient and secure protocols for verifiable signature sharing and other applications
- Secret-sharing with a class of ternary codes
- Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
- Probability of shares in secret sharing schemes
- Weighted decomposition construction for perfect secret sharing schemes
- On the bound for anonymous secret sharing schemes
- Perfectly secure data aggregation via shifted projections
- Some basics on privacy techniques, anonymization and their big data challenges
- Higher weights and near-MDR codes over chain rings
- Ideal ramp schemes and augmented orthogonal arrays
- Cutting-edge cryptography through the lens of secret sharing
- Algorithmic problems in right-angled Artin groups: complexity and applications
- On the power of amortization in secret sharing: d-uniform secret sharing and CDS with constant information rate
- Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model
- ZCZ -- achieving \(n\)-bit SPRP security with a minimal number of tweakable-block-cipher calls
- Privacy-preserving distributed mining of association rules using elliptic-curve cryptosystem and Shamir's secret sharing scheme
- Multiparty quantum direct secret sharing of classical information with Bell states and Bell measurements
- Analysis of secret sharing schemes based on Nielsen transformations
- Towards breaking the exponential barrier for general secret sharing
- Improving the linear programming technique in the search for lower bounds in secret sharing
- A secure ciphertext self-destruction scheme with attribute-based encryption
- A reversible steganography scheme of secret image sharing based on cellular automata and least significant bits construction
- Linear codes from simplicial complexes
- Distributive weighted threshold secret sharing schemes
- Effect of noise on deterministic joint remote preparation of an arbitrary two-qubit state
- On minimal connectivity requirements for secure message transmission in directed networks
- Ideal ramp schemes and related combinatorial objects
- On the information ratio of non-perfect secret sharing schemes
- Optimal codes from Fibonacci polynomials and secret sharing schemes
- Timed-release computational secret sharing and threshold encryption
- Combinatorial repairability for threshold schemes
- Relative generalized Hamming weights of cyclic codes
- Quantum secret sharing using orthogonal multiqudit entangled states
- Unitary reconstruction of secret for stabilizer-based quantum secret sharing
- Privacy-preserving outsourcing of image feature extraction in cloud computing
- A new improving quantum secret sharing scheme
- Homomorphic secret sharing for low degree polynomials
- Constructing ideal secret sharing schemes based on Chinese remainder theorem
- Efficient identity-based threshold decryption scheme from bilinear pairings
- Privacy preserving distributed optimization using homomorphic encryption
- Strongly secure quantum ramp secret sharing constructed from algebraic curves over finite fields
- Optimal information ratio of secret sharing schemes on Dutch windmill graphs
- Linear codes from weakly regular plateaued functions and their secret sharing schemes
- Non-zero-sum cooperative access control game model with user trust and permission risk
- Perennial secure multi-party computation of universal Turing machine
- Multi-dimensional quantum state sharing based on quantum Fourier transform
- Threshold quantum secret sharing based on single qubit
- Attacks to some verifiable multi-secret sharing schemes and two improved schemes
- Multi-prover proof of retrievability
- Improvement of assurance including security for wireless sensor networks using dispersed data transmission
This page was built for publication: How to share a secret
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3050283)
