Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

More information theoretical inequalities to be used in secret sharing?

From MaRDI portal
Publication:287126
Jump to:navigation, search

DOI10.1016/S0020-0190(97)00086-0zbMath1336.94083MaRDI QIDQ287126

Marten van Dijk

Publication date: 26 May 2016

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


zbMATH Keywords

cryptographycryptologysecret sharinginformation rate


Mathematics Subject Classification ID

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


Related Items

Improving the linear programming technique in the search for lower bounds in secret sharing, Finding lower bounds on the complexity of secret sharing schemes by linear programming



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Perfect secret sharing schemes on five participants
  • Some improved bounds on the information rate of perfect secret sharing schemes
  • On the size of shares for secret sharing schemes
  • On the information rate of perfect secret sharing schemes
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:287126&oldid=12170968"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 03:03.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki