Abstract
Secret sharing allows a secret key to be distributed among n persons, such that k(1
Cite
CITATION STYLE
APA
Pedersen, T. P. (1992). Distributed Provers and Verifiable Secret Sharing Based on the Discrete Logarithm Problem. DAIMI Report Series, 21(388). https://doi.org/10.7146/dpb.v21i388.6621
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free