{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:56:02Z","timestamp":1764996962251},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,2,15]],"date-time":"2013-02-15T00:00:00Z","timestamp":1360886400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s12095-013-0082-1","type":"journal-article","created":{"date-parts":[[2013,2,14]],"date-time":"2013-02-14T02:08:17Z","timestamp":1360807697000},"page":"229-240","source":"Crossref","is-referenced-by-count":5,"title":["A simple combinatorial treatment of constructions and threshold gaps of ramp schemes"],"prefix":"10.1007","volume":"5","author":[{"given":"Maura B.","family":"Paterson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas R.","family":"Stinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,2,15]]},"reference":[{"key":"82_CR1","unstructured":"Bierbrauer, J.: Introduction to Coding Theory. Chapman & Hall\/ CRC (2005)"},{"key":"82_CR2","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/3-540-39568-7_20","volume":"196","author":"GR Blakley","year":"1985","unstructured":"Blakley, G.R., Meadows, C.: Security of ramp schemes. Lect. Notes Comput. Sci. 196, 242\u2013268 (1985) (CRYPTO 1984)","journal-title":"Lect. Notes Comput. Sci."},{"key":"82_CR3","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1007\/3-540-56503-5_68","volume":"665","author":"C Blundo","year":"1993","unstructured":"Blundo, C., De\u00a0Santis, A., Vaccaro, U.: Efficient sharing of many secrets. Lect. Notes Comput. Sci. 665, 692\u2013703 (1993) (STACS \u201993)","journal-title":"Lect. Notes Comput. Sci."},{"key":"82_CR4","unstructured":"Cascudo, I., Cramer, R., Xing, C.: Bounds on the threshold gap in secret sharing over small fields. Cryptology ePrint Archive: Report 2012\/319. http:\/\/eprint.iacr.org\/2012\/319 (2012) [Version 1 is dated June 5, 2012; version 2 is dated Sept. 27, 2012]"},{"key":"82_CR5","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/11818175_31","volume":"4117","author":"H Chen","year":"2006","unstructured":"Chen, H., Cramer, R.: Algebraic geometric secret sharing schemes and secure multi-party computations over small fields. Lect. Notes Comput. Sci. 4117, 521\u2013536 (2006) (CRYPTO 2006)","journal-title":"Lect. Notes Comput. Sci."},{"key":"82_CR6","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/978-3-540-72540-4_17","volume":"4515","author":"H Chen","year":"2007","unstructured":"Chen, H., Cramer, R., Goldwasser, S., de\u00a0Haan, R., Vaikuntanathan, V.: Secure computation from random error correcting codes. Lect. Notes Comput. Sci. 4515, 291\u2013310 (2007) (EUROCRYPT 2007)","journal-title":"Lect. Notes Comput. Sci."},{"key":"82_CR7","first-page":"27","volume":"8","author":"E Dawson","year":"1993","unstructured":"Dawson, E., Mahmoodian, E.S.: Orthogonal arrays and ordered threshold schemes. Australas. J. Comb. 8, 27\u201344 (1993)","journal-title":"Australas. J. Comb."},{"key":"82_CR8","unstructured":"Delsarte, P.: An Algebraic Approach to the Association Schemes of Coding Theory. Philips Research Reports Supplements (1973)"},{"key":"82_CR9","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/S0019-9958(73)80007-5","volume":"23","author":"P Delsarte","year":"1973","unstructured":"Delsarte, P.: Four fundamental parameters of a code and their combinatorial significance. Inf. Control 23, 407\u2013438 (1973)","journal-title":"Inf. Control"},{"key":"82_CR10","doi-asserted-by":"crossref","unstructured":"Duursma, I., Chen, J.: Multiplicative secret sharing schemes from Reed\u2013Muller type codes. In: 2012 IEEE International Symposium on Information Theory Proceedings, pp.\u00a0264\u2013268","DOI":"10.1109\/ISIT.2012.6283999"},{"key":"82_CR11","doi-asserted-by":"crossref","unstructured":"Hedayat, A.S., Sloane, N.J.A., Stufken, J.: Orthogonal Arrays, Theory and Applications. Springer (1999)","DOI":"10.1007\/978-1-4612-1478-6"},{"key":"82_CR12","first-page":"51","volume":"14","author":"W-A Jackson","year":"1996","unstructured":"Jackson, W.-A., Martin, K.M.: A combinatorial interpretation of ramp schemes. Australas. J. Comb. 14, 51\u201360 (1996)","journal-title":"Australas. J. Comb."},{"key":"82_CR13","doi-asserted-by":"crossref","first-page":"221","DOI":"10.51286\/albjm\/1229509503","volume":"2","author":"A Kohnert","year":"2008","unstructured":"Kohnert, A.: Construction of linear codes having prescribed primal-dual minimum distance with applications in cryptography. Albanian J. Math. 2, 221\u2013227 (2008)","journal-title":"Albanian J. Math."},{"key":"82_CR14","doi-asserted-by":"crossref","unstructured":"Kurihara, J., Uyematsu, T., Matsumoto, R.: Secret sharing schemes based on linear codes can be precisely characterized by the relative generalized hamming weight. IEICE Trans. Fundam. E95-A(11), 2067\u20132075 (2012)","DOI":"10.1587\/transfun.E95.A.2067"},{"key":"82_CR15","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1007\/3-540-69053-0_30","volume":"1233","author":"K Kurosawa","year":"1997","unstructured":"Kurosawa, K., Satoh, T.: Design of SAC\/PC(\u2113) of order k boolean functions and three other cryptographic criteria. Lect. Notes Comput. Sci. 1233, 434\u2013449 (1997) (EUROCRYPT 1997)","journal-title":"Lect. Notes Comput. Sci."},{"key":"82_CR16","doi-asserted-by":"crossref","unstructured":"van\u00a0Lint, J.H.: Introduction to Coding Theory, 3rd edn. Springer (1998)","DOI":"10.1007\/978-3-642-58575-3"},{"key":"82_CR17","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1109\/TIT.1987.1057320","volume":"33","author":"JH Lint van","year":"1987","unstructured":"van\u00a0Lint, J.H., Springer, T.A.: Generalized Reed\u2013Solomon codes from algebraic geometry. IEEE Trans. Inf. Theory 33, 305\u2013309 (1987)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"82_CR18","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland (1977)"},{"key":"82_CR19","unstructured":"Martin, K.M., Paterson, M.B., Stinson, D.R.: Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures. Cryptogr. Commun. \u2013 Discrete Structures, Boolean Functions and Sequences 3, 65\u201386 (2011)"},{"key":"82_CR20","unstructured":"Massey, J.L.: Minimal codewords and secret sharing. In: Proceedings of the 6th Joint Swedish\u2013Russian International Workshop on Information Theory, pp.\u00a0276\u2013279 (1993)"},{"key":"82_CR21","doi-asserted-by":"crossref","first-page":"4251","DOI":"10.1109\/TIT.2006.880050","volume":"52","author":"R Matsumoto","year":"2006","unstructured":"Matsumoto, R., Kurosawa, K., Itoh, T., Konno, T., Uyematsu, T.: Primal-dual distance bounds of linear codes with application to cryptography. IEEE Trans. Inf. Theory 52, 4251\u20134256 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"82_CR22","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"RJ McEliece","year":"1981","unstructured":"McEliece, R.J., Sarwate, D.V.: On sharing secrets and Reed\u2013Solomon codes. Commun. ACM 24, 583\u2013584 (1981)","journal-title":"Commun. ACM"},{"key":"82_CR23","first-page":"690","volume":"4","author":"W Ogata","year":"1998","unstructured":"Ogata, W., Kurosawa, K.: Some basic properties of general nonperfect secret sharing schemes. J. Univers. Comput. Sci. 4, 690\u2013704 (1998)","journal-title":"J. Univers. Comput. Sci."},{"key":"82_CR24","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0020-0190(98)00204-X","volume":"69","author":"DR Stinson","year":"1999","unstructured":"Stinson, D.R., Wei, R.: An application of ramp schemes to broadcast encryption. Inf. Process. Lett. 69, 131\u2013135 (1999)","journal-title":"Inf. Process. Lett."},{"key":"82_CR25","unstructured":"Sudan, M.: Algorithmic introduction to coding theory. Lecture 21 (2001). http:\/\/people.csail.mit.edu\/madhu\/FT01\/scribe\/lect21.ps . Accessed 26 Sept 2012"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-013-0082-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-013-0082-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-013-0082-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,6]],"date-time":"2024-05-06T01:33:25Z","timestamp":1714959205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-013-0082-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,15]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["82"],"URL":"https:\/\/doi.org\/10.1007\/s12095-013-0082-1","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,15]]}}}