{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T10:24:35Z","timestamp":1781519075392,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540156581","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-39568-7_20","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T04:56:51Z","timestamp":1186894611000},"page":"242-268","source":"Crossref","is-referenced-by-count":200,"title":["Security of Ramp Schemes"],"prefix":"10.1007","author":[{"given":"G. R.","family":"Blakley","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Catherine","family":"Meadows","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/0898-1221(81)90029-8","volume":"7","author":"C. A. Asmuth","year":"1981","unstructured":"C. A. Asmuth and G. R. Blakley, An efficient algorithm for constructing a cryptosystem which is harder to break than two other cryptosystems, Computers and Mathematics with Applications, Vol. 7 (1981), pp. 447\u2013450.","journal-title":"Computers and Mathematics with Applications"},{"key":"20_CR2","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1109\/SP.1982.10019","volume-title":"Proceedings of the 1982 Symposium on Security and Privacy","author":"C. A. Asmuth","year":"1982","unstructured":"C. A. Asmuth and G. R. Blakley, Pooling, splitting and restituting information to overcome total failure of some channels of communication, Proceedings of the 1982 Symposium on Security and Privacy, IEEE Computer Society, Los Angeles, (1982), pp. 156\u2013169."},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1109\/TIT.1983.1056651","volume":"IT-30","author":"C. Asmuth","year":"1983","unstructured":"C. Asmuth and J. Bloom, A modular approach to key safeguarding. IEEE Transactions on Information Theory, Vol. IT-30 (1983), pp. 208\u2013210.","journal-title":"IEEE Transactions on Information Theory"},{"key":"20_CR4","first-page":"313","volume-title":"Proceedings of the National Computer Conference, 1979, American Federation of Information Processing Societies \u2014 Conference Proceedings","author":"G. R. Blakley","year":"1979","unstructured":"G. R. Blakley, Safeguarding cryptographic keys, Proceedings of the National Computer Conference, 1979, American Federation of Information Processing Societies \u2014 Conference Proceedings, Vol. 48 (1979), AFIPS Press, Montvale, New Jersey (1979), pp. 313\u2013317."},{"key":"20_CR5","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1109\/SP.1980.10016","volume-title":"Proceedings of the 1980 Symposium on Security and Privacy","author":"G. R. Blakley","year":"1980","unstructured":"G. R. Blakley, One-time pads are key safeguarding schemes, not cryptosystems. Fast key safeguarding schemes (threshold schemes) exist, Proceedings of the 1980 Symposium on Security and Privacy, IEEE Computer Society, New York (1980), pp. 108\u2013113."},{"key":"20_CR6","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1109\/SP.1981.10018","volume-title":"Proceedings of the 1981 Symposium on Security and Privacy","author":"G. R. Blakley","year":"1981","unstructured":"G. R. Blakley and Laif Swanson, Security proofs for information protection systems, Proceedings of the 1981 Symposium on Security and Privacy, IEEE, Computer Society, New York (1981), pp. 75\u201388."},{"key":"20_CR7","unstructured":"J. Bloom, A note on superfast threshold schemes, Preprint, Texas A&M University, Department of Mathematics (1981) and Threshold schemes and error correcting codes, Abstracts of Papers Presented to the American Mathematical Society, Vol. 2 (1981), p. 230."},{"key":"20_CR8","unstructured":"G. R. Blakley, Protecting information against both destruction and unauthorized disclosure, Proceedings of the 1982 Carnahan Conference on Security Technology, University of Kentucky Press, (1982), pp. 123\u2013133."},{"key":"20_CR9","series-title":"Advances in Cryptology","first-page":"39","volume-title":"Proceeding of Crypto\u2019 82","author":"G. R. Blakley","year":"1983","unstructured":"G. R. Blakley and L. Swanson, Infinite structures in information theory, in D. Chaum, R. L. Rivest and A. T. Sherman, Advances in Cryptology, Proceeding of Crypto\u2019 82, Plenum Press, New York (1983), pp. 39\u201350."},{"key":"20_CR10","unstructured":"D. Chaum, Computer systems established, maintained, and trusted by mutually suspicious groups, Memorandum No. UCB\/ERL\/M79\/10, UC Berkeley ERL (1979)."},{"key":"20_CR11","unstructured":"D. Chaum, Computer systems established, maintained and trusted by mutually suspicious groups, Ph.D. dissertation in Computer Science, UC Berkeley (1982)."},{"key":"20_CR12","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/SP.1980.10011","volume-title":"Proceedings of the 1980 Symposium on Security and Privacy","author":"G. I. Davida","year":"1980","unstructured":"G. I. Davida, R. A. DeMillo and R. J. Lipton, Protecting shared cryptographic keys, Proceedings of the 1980 Symposium on Security and Privacy, IEEE Computer Society, New York (1980), pp. 100\u2013102."},{"key":"20_CR13","volume-title":"Cryptography and Data Security","author":"D. E. R. Denning","year":"1980","unstructured":"D. E. R. Denning, Cryptography and Data Security, Addison-Wesley, Reading, Massachusetts (1980)."},{"key":"20_CR14","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/978-3-7091-2640-0_4","volume-title":"Secret sharing systems, in Secure Digital Communications","author":"S. Harari","year":"1983","unstructured":"S. Harari, Secret sharing systems, in Secure Digital Communications, Edited by G. Longo, Springer-Verlag, Wien (1983), pp. 105\u2013110."},{"key":"20_CR15","volume-title":"Linear Algebra","author":"K. Hoffman","year":"1971","unstructured":"K. Hoffman and R. Kunze, Linear Algebra, Second Edition, Prentice Hall, Englewood Cliffs, New Jersey (1971).","edition":"Second Edition"},{"key":"20_CR16","first-page":"35","volume":"IT-29","author":"E. D. Karnin","year":"1983","unstructured":"E. D. Karnin, J. W. Greene and M. E. Hellman, On secret sharing systems, Verbal presentation, Session 83 (Cryptography), 1981 IEEE International Symposium on Information Theory, Santa Monica, California, February 9\u201312 (1981), and On secret sharing systems, IEEE Transactions on Information Theory. Vol. IT-29 (1983), pp. 35\u201341.","journal-title":"Verbal presentation, Session 83 (Cryptography), 1981"},{"key":"20_CR17","volume-title":"Cryptography: A Primer","author":"A. G. Konheim","year":"1981","unstructured":"A. G. Konheim, Cryptography: A Primer, Wiley-Interscience, New York (1981)."},{"key":"20_CR18","volume-title":"Proceedings of Crypto\u2019 84","author":"S. Kothari","year":"1985","unstructured":"S. Kothari, On a Generalized Threshold Scheme, Proceedings of Crypto\u2019 84, Springer-Verlag, New York (1985)."},{"key":"20_CR19","series-title":"Encyclopedia of Mathematics and its Applications","volume-title":"Finite Fields","author":"R. Lidl","year":"1983","unstructured":"R. Lidl and H. Niederreiter, Finite Fields, Vol. 20 of the Encyclopedia of Mathematics and its Applications, Addison-Wesley, Reading, Massachusetts (1983)."},{"key":"20_CR20","unstructured":"S. MacLane and G. Birkhoff, Algebra, MacMillan, New York, (1967)."},{"key":"20_CR21","volume-title":"The Theory of Error-Correcting Codes","author":"F. J. MacWilliams","year":"1978","unstructured":"F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam (1978)."},{"key":"20_CR22","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"R. J. McEliece","year":"1981","unstructured":"R. J. McEliece and D. V. Sarwate, On sharing secrets and Reed-Solomon codes, communications of the ACM, Vol. 24 (1981), pp. 583\u2013584.","journal-title":"communications of the ACM"},{"key":"20_CR23","first-page":"371","volume-title":"How to share a secret, in Cryptography","author":"M. Mignotte","year":"1983","unstructured":"M. Mignotte, How to share a secret, in Cryptography, Edited by T. Beth, Springer-Verlag, Berlin (1983), pp. 371\u2013375."},{"key":"20_CR24","doi-asserted-by":"crossref","unstructured":"L. H. Ozarow and A. D. Wyner, Wire-tap channel, II, AT&T Bell Labs Technical Journal, vol. 63 (1984), to appear.","DOI":"10.1002\/j.1538-7305.1984.tb00072.x"},{"key":"20_CR25","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir, How to share a secret, communications of the ACM, Vol. 22 (1979), pp. 612\u2013613.","journal-title":"communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-39568-7_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,21]],"date-time":"2021-08-21T16:21:27Z","timestamp":1629562887000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-39568-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540156581"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-39568-7_20","relation":{},"subject":[]}}