Skip to main content
Conference ProceedingsOPEN ACCESS

Security of Ramp Schemes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1985) 196 LNCS 242-268
DOI: 10.1007/3-540-39568-7_20
246Citations
Citations of this article
58Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A k out of n p/s/r process [AS81] is a very efficient way to convey information (k words suffice to reclaim k words). But it provides virtually no cryptographic security for the information it deals with.

Cite

CITATION STYLE

APA

Blakley, G. R., & Meadows, C. (1985). Security of Ramp Schemes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 196 LNCS, pp. 242–268). Springer Verlag. https://doi.org/10.1007/3-540-39568-7_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free