Finding the maximal adversary structure from any given access structure

DOI10.1016/j.ins.2019.08.057zbMath1456.94116OpenAlexW2970105493WikidataQ127313991 ScholiaQ127313991MaRDI QIDQ1999100

Qiuxia Xu, Gengran Hu, Chun-Ming Tang

Publication date: 18 March 2021

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2019.08.057

zbMATH Keywords

binary treesecret sharingaccess structuremaximal adversary structure

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generation of key predistribution schemes using secret sharing schemes
• Optimal assignment schemes for general access structures based on linear programming
• Realizing secret sharing with general access structure
• The optimal linear secret sharing scheme for any given access structure
• Multiparty Computation from Somewhat Homomorphic Encryption
• Secret-Sharing Schemes: A Survey
• How to share a secret
• On the hardness of approximating minimization problems
• A Tight Analysis of the Greedy Algorithm for Set Cover
• Reducibility among Combinatorial Problems
• A modular approach to key safeguarding
• Combinatorial optimization. Theory and algorithms.

This page was built for publication: Finding the maximal adversary structure from any given access structure