{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T16:11:58Z","timestamp":1746115918565,"version":"3.40.4"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,10,19]],"date-time":"2013-10-19T00:00:00Z","timestamp":1382140800000},"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":[[2014,6]]},"DOI":"10.1007\/s12095-013-0092-z","type":"journal-article","created":{"date-parts":[[2013,10,18]],"date-time":"2013-10-18T00:29:00Z","timestamp":1382056140000},"page":"137-155","source":"Crossref","is-referenced-by-count":0,"title":["Secret sharing schemes based on graphical codes"],"prefix":"10.1007","volume":"6","author":[{"given":"Ying","family":"Gao","sequence":"first","affiliation":[]},{"given":"Romar","family":"dela Cruz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,10,19]]},"reference":[{"key":"92_CR1","doi-asserted-by":"crossref","first-page":"2010","DOI":"10.1109\/18.705584","volume":"IT-44","author":"A Ashikhmin","year":"1998","unstructured":"Ashikhmin, A., Barg, A.: Minimal vectors in linear codes. IEEE Trans. Inform. Theory IT-44, 2010\u20132017 (1998)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"92_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/978-3-642-20901-7_2","volume-title":"Coding and Cryptology, Third International Workshop, IWCC 2011","author":"A Beimel","year":"2011","unstructured":"Beimel, A.: Secret sharing schemes: a survey. In: Coding and Cryptology, Third International Workshop, IWCC 2011. Lecture Notes in Computer Science, vol. 6639, pp. 11\u201346. Springer, New York (2011)"},{"key":"92_CR3","unstructured":"Beimel, A.: Secure Schemes for Secret Sharing and Key Distribution. Ph.D. dissertation, Technion-Israel Inst. Technol., Haifa, Israel (1996)"},{"key":"92_CR4","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1109\/18.335890","volume":"IT-40","author":"A Beimel","year":"1994","unstructured":"Beimel, A., Chor, B.: Universally ideal secret-secret sharing schemes. IEEE Trans. Inform. Theory IT-40, 786\u2013794 (1994)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"92_CR5","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of the 1979 AFIPS National Computer Conference, pp.\u00a0313\u2013317. AFIPS Press, Monval, NJ (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"92_CR6","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF00196772","volume":"4","author":"E Brickell","year":"1991","unstructured":"Brickell, E., Davenport, D.: On the classification of ideal secret sharing schemes. J. Cryptol. 4, 123\u2013134 (1991)","journal-title":"J. Cryptol."},{"key":"92_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/11818175_31","volume-title":"Proceedings of 26th Annual IACR CRYPTO","author":"H Chen","year":"2006","unstructured":"Chen, H., Cramer, R.: Algebraic geometric secret sharing schemes and secure multi-party computations over small fields. In: Proceedings of 26th Annual IACR CRYPTO. Lecture Notes in Computer Science, vol. 4117, pp. 521\u2013536. Springer, New York (2006)"},{"key":"92_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1007\/3-540-45539-6_22","volume-title":"Proceedings of 19th Annual IACR EUROCRYPT","author":"R Cramer","year":"2000","unstructured":"Cramer, R., Damg\u00e4rd, I., Maurer, U.: General secure multi-party computation from any linear secret-sharing schemes. In: Proceedings of 19th Annual IACR EUROCRYPT. Lecture Notes in Computer Science, vol. 1807, pp. 316\u2013334. Springer, New York (2000)"},{"key":"92_CR9","doi-asserted-by":"crossref","first-page":"2644","DOI":"10.1109\/TIT.2008.921692","volume":"IT-54","author":"R Cramer","year":"2008","unstructured":"Cramer, R., Daza, V., Gracia, I., Urroz, J., Leander, G., Mart\u00ed-Farr\u00e9, J., Padr\u00f3, C.: On codes, matroids, and secure multi-party computation from linear secret-sharing schemes. IEEE Trans. Inform. Theory IT-54, 2644\u20132657 (2008)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"92_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/3-540-45066-1_2","volume-title":"Discrete Mathematics and Theoretical Computer Science","author":"C Ding","year":"2003","unstructured":"Ding, C., Yuan, J.: Covering and Secret Sharing with Linear Codes. In: Discrete Mathematics and Theoretical Computer Science. Lecture Notes in Computer Science, vol. 2731, pp. 11\u201325. Springer, New York (2003)"},{"key":"92_CR11","unstructured":"Gerards, A., Schrijver, A.: Signed Graph \u2013 Regular Matroids \u2013 Grafts. Research Memorandum, Faculteit der Economische Wetenschappen, Tilburg University (1986)"},{"key":"92_CR12","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play ANY mental game. In: Proc. 19th annual ACM Symposium on Theory of Computing, STOC\u201987, pp. 218\u2013229. New York (1987)","DOI":"10.1145\/28395.28420"},{"key":"92_CR13","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1109\/TIT.1968.1054190","volume":"IT-14","author":"S Hakimi","year":"1968","unstructured":"Hakimi, S., Bredeson, J.: Graph-theoretic error-correcting codes. IEEE Trans. Inform. Theory IT-14, 584\u2013591 (1968)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"92_CR14","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1109\/18.567663","volume":"IT-43","author":"D Jungnickel","year":"1997","unstructured":"Jungnickel, D., Vanstone, S.: Graphical codes revisited. IEEE Trans. Inform. Theory IT-43, 136\u2013146 (1997)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"92_CR15","doi-asserted-by":"crossref","unstructured":"Karchmer, M., Wigderson, A.: On span programs. In: Proc. 8th IEEE Structure in Complexity Theory, pp. 102\u2013111. IEEE Computer Society Press, Los Alamitos, CA (1993)","DOI":"10.1109\/SCT.1993.336536"},{"key":"92_CR16","series-title":"Lecture Notes in Computer Science","first-page":"148","volume-title":"Proc. 2nd Int. Conf. on Information Theoretic Security","author":"E Kasper","year":"2007","unstructured":"Kasper, E., Nikova, S., Nikov, V.: Strongly multiplicative hierarchical threshold secret sharing. In: Proc. 2nd Int. Conf. on Information Theoretic Security. Lecture Notes in Computer Science, vol. 4883, pp. 148\u2013168. Springer, New York (2007)"},{"key":"92_CR17","doi-asserted-by":"crossref","first-page":"3973","DOI":"10.1109\/TIT.2007.907505","volume":"IT-53","author":"M Liu","year":"2007","unstructured":"Liu, M., Xiao, L., Zhang, Z.: Multiplicative linear secret sharing schemes based on connectivity of graphs. IEEE Trans. Inform. Theory IT-53, 3973\u20133978 (2007)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"92_CR18","first-page":"276","volume-title":"Proc. 6th Joint Swedish-Russian Workshop Inf","author":"JL Massey","year":"1993","unstructured":"Massey, J.L.: Minimal codewords and secret sharing. In: Proc. 6th Joint Swedish-Russian Workshop Inf. Theory, pp. 276\u2013279. Molle, Sweden (1993)"},{"key":"92_CR19","first-page":"194","volume-title":"International Workshop on Optimal Codes and Related Topics","author":"S Nikova","year":"2007","unstructured":"Nikova, S., Nikov, V.: On multiplicative secret sharing schemes realizing graph access structures. In: International Workshop on Optimal Codes and Related Topics, pp. 194\u2013199. Balchik, Bulgaria (2007)"},{"key":"92_CR20","volume-title":"Matroid Theory","author":"J Oxley","year":"1992","unstructured":"Oxley, J.: Matroid Theory. Oxford Science Publications, Oxford University Press, New York (1992)"},{"key":"92_CR21","doi-asserted-by":"crossref","first-page":"1046","DOI":"10.1137\/05064309X","volume":"20","author":"C Padr\u00f3","year":"2006","unstructured":"Padr\u00f3, C., Gracia, I.: Representing small identically self-dual matroids by self-dual codes. SIAM J. Discrete Math. 20, 1046\u20131055 (2006)","journal-title":"SIAM J. Discrete Math."},{"key":"92_CR22","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22, 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"92_CR23","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF00125203","volume":"2","author":"D Stinson","year":"1992","unstructured":"Stinson, D.: An explication of secret sharing schemes. Des. Codes Cryptogr. 2, 357\u2013390 (1992)","journal-title":"Des. Codes Cryptogr."},{"key":"92_CR24","volume-title":"Cryptography Theory and Practice","author":"D Stinson","year":"2005","unstructured":"Stinson, D.: Cryptography Theory and Practice, 3rd edn. CRC Press, Boca Raton, FL (2005)","edition":"3"},{"key":"92_CR25","volume-title":"Introduction to Graph Theory","author":"D West","year":"2001","unstructured":"West, D.: Introduction to Graph Theory, 2nd edn. Prentice Hall, New York (2001)","edition":"2"},{"key":"92_CR26","doi-asserted-by":"crossref","unstructured":"Yao, A.: Protocols for secure computation. In: Proc. 23rd IEEE Symp. Foundation of Computer Science, FOCS \u201982, IL, pp. 160\u2013164. Chicago (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-013-0092-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-013-0092-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-013-0092-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T17:27:38Z","timestamp":1746034058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-013-0092-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,19]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["92"],"URL":"https:\/\/doi.org\/10.1007\/s12095-013-0092-z","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2013,10,19]]}}}