A Nested Layered Threshold Model for Dynamic Task Allocation
Abstract
References
Recommendations
Dynamic threshold secret reconstruction and its application to the threshold cryptography
Shamir's ( t , n ) secret sharing scheme (SS) is based on a univariate polynomial and is the most cited SS in the literature. The secret in a ( t , n ) SS can be recovered either by exactly t or more than t shareholders. Most SSs only consider when ...
A New Dynamic Threshold Secret Sharing Scheme from Bilinear Maps
ICPPW '07: Proceedings of the 2007 International Conference on Parallel Processing WorkshopsIn a (t, n) threshold secret sharing scheme, any t-out- of-n participants could recover the shared secret, and any less than t participants could get nothing about the shared secret. Most of the existing secret sharing schemes are not flexible enough ...
Parallelizing tightly nested loops
IPPS '91: Proceedings of the Fifth International Parallel Processing SymposiumPresents a new technique to parallelize nested loops at the statement level. It transforms sequential nested loops, either vectorizable or not, into parallel ones. Previously, the wavefront method was used to parallelize non-vectorizable nested loops. ...
Comments
Information & Contributors
Information
Published In
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in