scientific article
From MaRDI portal
Publication:3202940
zbMath0715.94003MaRDI QIDQ3202940
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Fully adaptive decentralized multi-authority \textsf{ABE}, Access structures determined by uniform polymatroids, Short leakage resilient and non-malleable secret sharing schemes, On secret sharing, randomness, and random-less reductions for secret sharing, A perfect secret sharing scheme for general access structures, Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\), Multi-client functional encryption with fine-grained access control, Candidate witness encryption from lattice techniques, How to recover a secret with \(O(n)\) additions, Adaptive extractors and their application to leakage resilient secret sharing, Upslices, downslices, and secret-sharing with complexity of \(1.5^n\), Quadratic secret sharing and conditional disclosure of secrets, An efficient and secure multi-secret sharing scheme with general access structures, FROST: Flexible round-optimized Schnorr threshold signatures, Secret-sharing schemes for very dense graphs, Secret sharing based on a hard-on-average problem, 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, Secret Sharing for mNP: Completeness Results, Threshold Secret Sharing Requires a Linear Size Alphabet, How to Share a Secret, Infinitely, Towards breaking the exponential barrier for general secret sharing, Recent Advances in Non-perfect Secret Sharing Schemes, Anonymous secret sharing schemes, Algebraic secret sharing using privacy homomorphisms for IoT-based healthcare systems, Secret-sharing for NP, An efficient construction of perfect secret sharing schemes for graph-based structures, Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures, Algebraic geometric secret sharing schemes over large fields are asymptotically threshold, CNF-FSS and Its Applications, Secret sharing schemes for graph-based prohibited structures, Cryptographic algorithms for privacy-preserving online applications, All inequalities for the relative entropy, Local bounds for the optimal information ratio of secret sharing schemes, On the information ratio of non-perfect secret sharing schemes, Traceability codes and their generalizations, Timed-release computational secret sharing and threshold encryption, Combinatorial repairability for threshold schemes, Sharing one secret vs. sharing many secrets., Visual cryptography on graphs, Verifiable quantum \((k,n)\)-threshold secret key sharing, Rational quantum secret sharing scheme based on GHZ state, Ideal multipartite secret sharing schemes, Decentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDH, Methods of encrypting monotonic access structures, A remark on hierarchical threshold secret sharing, A fully dynamic secret sharing scheme, Restricted adaptive oblivious transfer, Recursive constructions for perfect secret sharing schemes, On Linear Secret Sharing for Connectivity in Directed Graphs, Optimal information ratio of secret sharing schemes on Dutch windmill graphs, Quantum secret sharing for general access structures based on multiparticle entanglements, Secret sharing schemes for infinite sets of participants: a new design technique, On the classification of ideal secret sharing schemes, Probabilistic secret sharing, Secret-Sharing Schemes: A Survey, Ideal Secret Sharing Schemes for Useful Multipartite Access Structures, On the information rate of secret sharing schemes, Rearrangements of access structures and their realizations in secret sharing schemes, Lower bounds for monotone span programs, Efficient robust secret sharing from expander graphs, Secret sharing schemes for compartmented access structures, Some improved bounds on the information rate of perfect secret sharing schemes, Strongly ideal secret sharing schemes, Finding the maximal adversary structure from any given access structure, An explication of secret sharing schemes, General constructions for information-theoretic private information retrieval, A scheme for threshold multi-secret sharing, An ideal multi-secret sharing scheme based on MSP, Optimal assignment schemes for general access structures based on linear programming, Sharing multiple secrets: Models, schemes and analysis, How to share a secret, Optimal complexity of secret sharing schemes with four minimal qualified subsets, Matroids Can Be Far from Ideal Secret Sharing, Realizing secret sharing with general access structure, Cutting-Edge Cryptography Through the Lens of Secret Sharing, ACE with Compact Ciphertext Size and Decentralized Sanitizers, Secure publicly verifiable and proactive secret sharing schemes with general access structure, Adaptively secure distributed PRFs from \(\mathsf{LWE}\), Ideal secret sharing schemes whose minimal qualified subsets have at most three participants, Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes, Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}}, Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings, Secret Sharing Schemes for Dense Forbidden Graphs, Hypergraph decomposition and secret sharing, How to fairly reconstruct a shared secret, Randomness in secret sharing and visual cryptography schemes, Shared generation of pseudo-random functions, Escrow-free encryption supporting cryptographic workflow, Ideal Hierarchical Secret Sharing Schemes, Ideal homomorphic secret sharing schemes over cyclic groups, Protecting data privacy in private information retrieval schemes, Blocked linear secret sharing scheme for scalable attribute based encryption in manageable cloud storage system, Monotone circuits for monotone weighted threshold functions, On-line secret sharing, Graph decompositions and secret sharing schemes, Secret sharing schemes for ports of matroids of rank 3, Lower bounds on the information rate of secret sharing schemes with homogeneous access structure., Generalized Secret Sharing Schemes Using N$$^\mu $$MDS Codes, Establishment of Ad-Hoc Communities through Policy-Based Cryptography, Key Derivation Algorithms for Monotone Access Structures in Cryptographic File Systems, On the size of shares for secret sharing schemes, Generalized Mignotte's Sequences Over Polynomial Rings, General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting, Probability of shares in secret sharing schemes, Hierarchical and dynamic threshold Paillier cryptosystem without trusted dealer, Geometric secret sharing schemes and their duals, Weighted decomposition construction for perfect secret sharing schemes
