Realizing secret sharing with general access structure

DOI10.1016/j.ins.2016.06.006zbMath1428.94107MaRDI QIDQ2282021

Lein Harn, Tingting He, Mingwu Zhang, Maoyuan Zhang, Ching-Fang Hsu

Publication date: 6 January 2020

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

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

zbMATH Keywords

Chinese remainder theorem; monotone function; integer optimization; general secret sharing; maximal negative access subset; minimal positive access subset; secret-sharing policy

Mathematics Subject Classification ID

94A62: Authentication, digital signatures and secret sharing

Related Items

ZCZ -- achieving \(n\)-bit SPRP security with a minimal number of tweakable-block-cipher calls, Constructing ideal secret sharing schemes based on Chinese remainder theorem, Finding the maximal adversary structure from any given access structure, A collaborative secret sharing scheme based on the Chinese remainder theorem, A new threshold changeable secret sharing scheme based on the Chinese remainder theorem

Cites Work

• New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures
• Two verifiable multi secret sharing schemes based on nonhomogeneous linear recursion and LFSR public-key cryptosystem
• An ideal multi-secret sharing scheme based on MSP
• Multiple assignment scheme for sharing secret
• Weighted threshold secret sharing schemes
• Attacks to some verifiable multi-secret sharing schemes and two improved schemes
• Optimal assignment schemes for general access structures based on linear programming
• General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting
• How to share a secret
• How to Share a Secret
• A modular approach to key safeguarding
• Theory of Cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item