Secret-Sharing Schemes: A Survey

From MaRDI portal
Publication:3005578

DOI10.1007/978-3-642-20901-7_2zbMath1272.94074OpenAlexW51265332MaRDI QIDQ3005578

Amos Beimel

Publication date: 8 June 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20901-7_2


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data encryption (aspects in computer science) (68P25) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Authentication, digital signatures and secret sharing (94A62)


Related Items

Upslices, downslices, and secret-sharing with complexity of \(1.5^n\), Quadratic secret sharing and conditional disclosure of secrets, Secret-sharing schemes for very dense graphs, 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, ZCZ -- achieving \(n\)-bit SPRP security with a minimal number of tweakable-block-cipher calls, Optimal linear secret sharing schemes for graph access structures on six participants, Secret sharing on large girth graphs, Secret Sharing for mNP: Completeness Results, Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption, Threshold Secret Sharing Requires a Linear Size Alphabet, How to Share a Secret, Infinitely, Towards breaking the exponential barrier for general secret sharing, Improving the linear programming technique in the search for lower bounds in secret sharing, Recent Advances in Non-perfect Secret Sharing Schemes, Secret-sharing for NP, The \(\varepsilon\)-\(t\)-net problem, Abelian sharing, common informations, and linear rank inequalities, Distributive weighted threshold secret sharing schemes, Secure Two-Party Computation: A Visual Way, New classes of codes over \(R_{q,p,m}=\mathbb{Z}_{p^m}[u_1, u_2, \dots , u_q/ \langle u_i^2=0,u_iu_j=u_ju_i\rangle\) and their applications], Cryptanalysis of Boyen's attribute-based encryption scheme in TCC 2013, Local bounds for the optimal information ratio of secret sharing schemes, Quantum attribute-based encryption: a comprehensive study, Semi-quantum cryptography, On the information ratio of non-perfect secret sharing schemes, Access structures determined by uniform polymatroids, On ideal and weakly-ideal access structures, Bipartite secret sharing and staircases, Threshold signatures with private accountability, How to recover a secret with \(O(n)\) additions, Ideal uniform multipartite secret sharing schemes, Brief Announcement: Breaking the f + 1 Barrier: Executing Payment Transactions in Parallel with Less than f + 1 Validations, Finding lower bounds on the complexity of secret sharing schemes by linear programming, Ideal hierarchical secret sharing and lattice path matroids, Smart elements in combinatorial group testing problems with more defectives, Algebraic manipulation detection codes, Secret sharing on regular bipartite access structures, Constructing ideal secret sharing schemes based on Chinese remainder theorem, Secure message transmission on directed networks, Long term confidentiality: a survey, Common information, matroid representation, and secret sharing for matroid ports, Secret sharing schemes for infinite sets of participants: a new design technique, Operations over Linear Secret Sharing Schemes, Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification, Probabilistic secret sharing, New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures, Efficient robust secret sharing from expander graphs, Construction of arithmetic secret sharing schemes by using torsion limits, Secure computation without computers, Secret sharing schemes for compartmented access structures, Smart elements in combinatorial group testing problems, Finding the maximal adversary structure from any given access structure, Extending Brickell-Davenport theorem to non-perfect secret sharing schemes, Simplifying Design and Analysis of Complex Predicate Encryption Schemes, Secret sharing on the \(d\)-dimensional cube, Secret sharing schemes based on graphical codes, How to share a secret, Reduced access structures with four minimal qualified subsets on six participants, Threshold Secret Sharing Through Multivariate Birkhoff Interpolation, Classes of matroids closed under minors and principal extensions, Secret sharing and duality, The exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structures, A Study of Pair Encodings: Predicate Encryption in Prime Order Groups, Cutting-Edge Cryptography Through the Lens of Secret Sharing, Using multiobjective optimization to map the entropy region, Tag-based ABE in prime-order groups via pair encoding, On abelian and homomorphic secret sharing schemes, Exploiting the Error Correction Mechanism in QR Codes for Secret Sharing, Lower bounds for leakage-resilient secret sharing, Revisiting and Extending the AONT-RS Scheme: A Robust Computationally Secure Secret Sharing Scheme, Practical Fault-Tolerant Data Aggregation, Generic negation of pair encodings, Secret Sharing Schemes for Dense Forbidden Graphs, Unnamed Item, Cooperative secret sharing using QR codes and symmetric keys, Efficient explicit constructions of compartmented secret sharing schemes, Practically Efficient Secure Single-Commodity Multi-market Auctions, Secret sharing schemes for ports of matroids of rank 3, Nearly optimal robust secret sharing against rushing adversaries, Roughly weighted hierarchical simple games, Some Open Problems in Information-Theoretic Cryptography, Practical (fully) distributed signatures provably secure in the standard model



Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3005578&oldid=16028798"
Powered by MediaWiki