scientific article; zbMATH DE number 4179276
From MaRDI portal
zbMATH Open0715.94003MaRDI QIDQ3202940FDOQ3202940
Authors: Josh Benaloh, Jerry Leichter 
Publication date: 1990
Title of this publication is not available (Why is that?)
Recommendations
Cited In (only showing first 100 items - show all)
- Threshold schemes with weights
- Matroids Can Be Far from Ideal Secret Sharing
- FROST: Flexible round-optimized Schnorr threshold signatures
- Title not available (Why is that?)
- Remarks on the classical threshold secret sharing schemes
- Weighted decomposition construction for perfect secret sharing schemes
- On-line secret sharing
- On the information ratio of non-perfect secret sharing schemes
- Secret sharing schemes with general access structures
- Escrow-free encryption supporting cryptographic workflow
- Optimal complexity of secret sharing schemes with four minimal qualified subsets
- Rearrangements of access structures and their realizations in secret sharing schemes
- 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
- Adaptively secure distributed PRFs from LWE
- Towards breaking the exponential barrier for general secret sharing
- Secret sharing schemes for graph-based prohibited structures
- Randomness in secret sharing and visual cryptography schemes
- Secure publicly verifiable and proactive secret sharing schemes with general access structure
- Secret-sharing schemes for very dense graphs
- Ideal homomorphic secret sharing schemes over cyclic groups
- Ideal multipartite secret sharing schemes
- All inequalities for the relative entropy
- Lower bounds for monotone span programs
- On the information rate of secret sharing schemes
- An efficient construction of perfect secret sharing schemes for graph-based structures
- An ideal multi-secret sharing scheme based on MSP
- Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures
- On the classification of ideal secret sharing schemes
- Secret sharing schemes on general access structures.
- Secret sharing schemes for dense forbidden graphs
- Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
- Strongly ideal secret sharing schemes
- Hypergraph decomposition and secret sharing
- An explication of secret sharing schemes
- Some improved bounds on the information rate of perfect secret sharing schemes
- On the size of shares for secret sharing schemes
- Probability of shares in secret sharing schemes
- Geometric secret sharing schemes and their duals
- Anonymous secret sharing schemes
- Verifiable quantum \((k,n)\)-threshold secret key sharing
- Sharing multiple secrets: Models, schemes and analysis
- An efficient and secure multi-secret sharing scheme with general access structures
- Visual cryptography on graphs
- Graph decompositions and secret sharing schemes
- Lower bounds on the information rate of secret sharing schemes with homogeneous access structure.
- Ideal hierarchical secret sharing schemes
- Secret sharing schemes with applications in security protocols
- Generalized Mignotte's sequences over polynomial rings
- How to Share a Secret, Infinitely
- How to share a secret
- Blocked linear secret sharing scheme for scalable attribute based encryption in manageable cloud storage system
- Sharing one secret vs. sharing many secrets.
- A remark on hierarchical threshold secret sharing
- Quantum secret sharing for general access structures based on multiparticle entanglements
- Restricted adaptive oblivious transfer
- Recursive constructions for perfect secret sharing schemes
- General constructions for information-theoretic private information retrieval
- Protecting data privacy in private information retrieval schemes
- A scheme for threshold multi-secret sharing
- Secret-Sharing Schemes: A Survey
- General secret sharing based on the Chinese remainder theorem with applications in e-voting
- Secret sharing schemes for compartmented access structures
- Partitioned encryption and achieving simultaneity by partitioning
- Monotone circuits for monotone weighted threshold functions
- How to fairly reconstruct a shared secret
- Efficient robust secret sharing from expander graphs
- Rational quantum secret sharing scheme based on GHZ state
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
- Probabilistic secret sharing
- Optimal information ratio of secret sharing schemes on Dutch windmill graphs
- Methods of encrypting monotonic access structures
- Threshold Secret Sharing Requires a Linear Size Alphabet
- Secret sharing for mNP: completeness results
- Finding the maximal adversary structure from any given access structure
- On Linear Secret Sharing for Connectivity in Directed Graphs
- Secret sharing schemes for infinite sets of participants: a new design technique
- ACE with compact ciphertext size and decentralized sanitizers
- Traceability codes and their generalizations
- Combinatorial constructions of repairable ramp schemes
- Cutting-edge cryptography through the lens of secret sharing
- Quadratic secret sharing and conditional disclosure of secrets
- Upslices, downslices, and secret-sharing with complexity of \(1.5^n\)
- LERNA: secure single-server aggregation via key-homomorphic masking
- Recent advances in non-perfect secret sharing schemes
- Asymmetric distributed trust
- Improved fully adaptive decentralized MA-ABE for NC1 from MDDH
- Fully adaptive decentralized multi-authority \textsf{ABE}
- Generalized Secret Sharing Schemes Using N$$^\mu $$MDS Codes
- Secret sharing schemes for ports of matroids of rank 3.
- Key derivation algorithms for monotone access structures in cryptographic file systems
- How to recover a secret with \(O(n)\) additions
- On ASGS framework: general requirements and an example of implementation
- Randomness recoverable secret sharing schemes
- Secret-sharing for NP
- Candidate witness encryption from lattice techniques
- Secret sharing based on a hard-on-average problem
- Realizing secret sharing with general access structure
- Combinatorial constructions of repairable threshold schemes
- Algebraic secret sharing using privacy homomorphisms for IoT-based healthcare systems
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 Q3202940)
