Complexity of universal access structures

DOI10.1016/j.ipl.2011.10.022zbMath1277.94050arXiv1908.05021OpenAlexW1987871737MaRDI QIDQ413265

László Csirmaz

Publication date: 4 May 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.05021

zbMATH Keywords

complexityharmonic seriescryptographyentropy methodsecret-sharing

Mathematics Subject Classification ID

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

Related Items

Quantum attribute-based encryption: a comprehensive study

Cites Work

• Unnamed Item
• Optimal complexity of secret sharing schemes with four minimal qualified subsets
• An impossibility result on graph secret sharing
• Tight bounds on the information rate of secret sharing schemes
• Secret sharing schemes with three or four minimal qualified subsets
• Decomposition constructions for secret-sharing schemes

This page was built for publication: Complexity of universal access structures