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

The Detection of Cheaters in Thershold Schemes

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

DOI10.1137/0404044zbMath0739.94009OpenAlexW2064052854MaRDI QIDQ3992205

Ernest F. Brickell, Douglas R. Stinson

Publication date: 27 June 1992

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0404044


zbMATH Keywords

partial informationthreshold schemesecret sharing scheme


Mathematics Subject Classification ID

Cryptography (94A60) Combinatorial aspects of finite geometries (05B25)


Related Items

Robust vector space secret sharing schemes ⋮ Some democratic secret sharing schemes ⋮ On the information rate of secret sharing schemes ⋮ An explication of secret sharing schemes ⋮ Cheating in visual cryptography ⋮ Detection and identification of cheaters in \((t,n)\) secret sharing scheme ⋮ A perfect threshold secret sharing scheme to identify cheaters ⋮ How to avoid the cheaters succeeding in the key sharing scheme ⋮ How to fairly reconstruct a shared secret ⋮ Graph decompositions and secret sharing schemes ⋮ Further results on asymmetric authentication schemes



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3992205&oldid=12059328"
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 01:18.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki