Characterizing ideal weighted threshold secret sharing

DOI10.1007/978-3-540-30576-7_32MaRDI QIDQ5711666zbMATH OpenOpenAlexFDO

Authors Amos Beimel, Tamir Tassa, Enav Weinreb

Publication date 7 December 2005

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

Full work available at URL https://doi.org/10.1007/b106171

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Characterizing Ideal Weighted Threshold Secret Sharing
• A characterisation of ideal weighted secret sharing schemes
• Weighted threshold secret sharing schemes
• Distributive weighted threshold secret sharing schemes
• scientific article; zbMATH DE number 5263446
• Optimum general threshold secret sharing
• A scheme for threshold multi-secret sharing
• Remarks on the classical threshold secret sharing schemes
• A new threshold secret sharing scheme

Cited in

(23)

• Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
• Multipartite secret sharing by bivariate interpolation
• Monotone circuits for monotone weighted threshold functions
• Weighted threshold secret sharing schemes
• Distributive weighted threshold secret sharing schemes
• Three hierarchies of simple games parameterized by ``resource parameters
• Optimal assignment schemes for general access structures based on linear programming
• Any 2-asummable bipartite function is weighted threshold
• Realizing secret sharing with general access structure
• A necessary and sufficient condition for the asymptotic idealness of the GRS threshold secret sharing scheme
• Ideal hierarchical secret sharing schemes
• Characterizing Ideal Weighted Threshold Secret Sharing
• Hierarchical and dynamic threshold Paillier cryptosystem without trusted dealer
• scientific article; zbMATH DE number 5263446 (Why is no real title available?)
• Cryptography with weights: MPC, encryption and signatures
• Hierarchical modeling of aggregate mining conflict in Ontario, Canada
• Weighted secret sharing from wiretap channels
• New method to compute bounds on the optimal information rate of secret sharing schemes
• Distributed randomness using weighted VUFs
• Evolving secret sharing revisited: computational security and succinctness
• Evolving secret sharing made short
• Polynomial secret sharing schemes and algebraic matroids
• A characterisation of ideal weighted secret sharing schemes

This page was built for publication: Characterizing ideal weighted threshold secret sharing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5711666)