{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T04:23:49Z","timestamp":1785212629213,"version":"3.55.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030004330","type":"print"},{"value":"9783030004347","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00434-7_23","type":"book-chapter","created":{"date-parts":[[2018,8,31]],"date-time":"2018-08-31T21:35:51Z","timestamp":1535751351000},"page":"463-480","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Secret Sharing Schemes for (k,\u00a0n)-Consecutive Access Structures"],"prefix":"10.1007","author":[{"given":"Javier","family":"Herranz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Germ\u00e1n","family":"S\u00e1ez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,9,1]]},"reference":[{"issue":"1","key":"23_CR1","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1137\/S0895480104445654","volume":"22","author":"A Beimel","year":"2008","unstructured":"Beimel, A., Tassa, T., Weinreb, E.: Characterizing ideal weighted threshold secret sharing. SIAM J. Discret. Math. 22(1), 360\u2013397 (2008)","journal-title":"SIAM J. Discret. Math."},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: AFIPS Conference Proceedings, vol. 48, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"issue":"2","key":"23_CR3","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1023\/A:1008216403325","volume":"11","author":"C Blundo","year":"1997","unstructured":"Blundo, C., De Santis, A., De Simone, R., Vaccaro, U.: Tight bounds on the information rate of secret sharing schemes. Des. Codes Cryptogr. 11(2), 107\u2013122 (1997)","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"23_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF00204801","volume":"8","author":"C Blundo","year":"1995","unstructured":"Blundo, C., De Santis, A., Stinson, D.R., Vaccaro, U.: Graph decompositions and secret sharing schemes. J. Cryptol. 8(1), 39\u201364 (1995)","journal-title":"J. Cryptol."},{"key":"23_CR5","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF00196772","volume":"4","author":"EF Brickell","year":"1991","unstructured":"Brickell, E.F., Davenport, D.M.: On the classification of ideal secret sharing schemes. J. Cryptol. 4, 123\u2013134 (1991)","journal-title":"J. Cryptol."},{"issue":"4","key":"23_CR6","doi-asserted-by":"publisher","first-page":"2527","DOI":"10.1109\/TIT.2012.2236958","volume":"59","author":"L Csirmaz","year":"2013","unstructured":"Csirmaz, L., Tardos, G.: Optimal information rate of secret sharing schemes on trees. IEEE Trans. Inf. Theory 59(4), 2527\u20132530 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"23_CR7","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1016\/j.dam.2008.04.001","volume":"157","author":"G Crescenzo Di","year":"2009","unstructured":"Di Crescenzo, G., Galdi, C.: Hypergraph decomposition and secret sharing. Discret. Appl. Math. 157(5), 928\u2013946 (2009)","journal-title":"Discret. Appl. Math."},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/978-3-319-78381-9_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"O Farr\u00e0s","year":"2018","unstructured":"Farr\u00e0s, O., Kaced, T., Mart\u00edn, S., Padr\u00f3, C.: Improving the linear programming technique in the search for lower bounds in secret sharing. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 597\u2013621. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_22"},{"issue":"3","key":"23_CR9","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/s00145-011-9101-6","volume":"25","author":"O Farr\u00e0s","year":"2012","unstructured":"Farr\u00e0s, O., Mart\u00ed-Farr\u00e9, J., Padr\u00f3, C.: Ideal multipartite secret sharing schemes. J. Cryptol. 25(3), 434\u2013463 (2012)","journal-title":"J. Cryptol."},{"issue":"5","key":"23_CR10","doi-asserted-by":"publisher","first-page":"3273","DOI":"10.1109\/TIT.2011.2182034","volume":"58","author":"O Farr\u00e0s","year":"2012","unstructured":"Farr\u00e0s, O., Padr\u00f3, C.: Ideal hierarchical secret sharing schemes. IEEE Trans. Inf. Theory 58(5), 3273\u20133286 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"23_CR11","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1049\/ip-ifs:20060081","volume":"153","author":"J Herranz","year":"2006","unstructured":"Herranz, J., S\u00e1ez, G.: New results on multipartite access structures. IET Proc. Inf. Secur. 153(4), 153\u2013162 (2006)","journal-title":"IET Proc. Inf. Secur."},{"issue":"1","key":"23_CR12","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF01388562","volume":"4","author":"WA Jackson","year":"1994","unstructured":"Jackson, W.A., Martin, K.M.: Geometric secret sharing schemes and their duals. Des. Codes Cryptogr. 4(1), 83\u201395 (1994)","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"23_CR13","first-page":"267","volume":"9","author":"WA Jackson","year":"1996","unstructured":"Jackson, W.A., Martin, K.M.: Perfect secret sharing schemes on five participants. Des. Codes Cryptogr. 9(3), 267\u2013286 (1996)","journal-title":"Des. Codes Cryptogr."},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Juels, A., Pappu, R., Parno, B.: Unidirectional key distribution across time and space with applications to RFID security. In: Proceedings of the USENIX Security Symposium 2008, pp. 75\u201390 (2008)","DOI":"10.1145\/1352533.1352534"},{"issue":"1","key":"23_CR15","doi-asserted-by":"crossref","first-page":"72","DOI":"10.37236\/1825","volume":"11","author":"J Mart\u00ed-Farr\u00e9","year":"2004","unstructured":"Mart\u00ed-Farr\u00e9, J., Padr\u00f3, C.: Secret sharing schemes on sparse homogeneous access structures with rank three. Electron. J. Comb. 11(1), 72 (2004)","journal-title":"Electron. J. Comb."},{"issue":"1","key":"23_CR16","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s10623-003-4192-1","volume":"34","author":"J Mart\u00ed-Farr\u00e9","year":"2005","unstructured":"Mart\u00ed-Farr\u00e9, J., Padr\u00f3, C.: Secret sharing schemes with three or four minimal qualified subsets. Des. Codes Cryptogr. 34(1), 17\u201334 (2005)","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"23_CR17","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1016\/j.dam.2005.09.003","volume":"154","author":"J Mart\u00ed-Farr\u00e9","year":"2006","unstructured":"Mart\u00ed-Farr\u00e9, J., Padr\u00f3, C.: Secret sharing schemes on access structures with intersection number equal to one. Discret. Appl. Math. 154(3), 552\u2013563 (2006)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"23_CR18","doi-asserted-by":"crossref","first-page":"1356","DOI":"10.1016\/j.amc.2005.01.026","volume":"170","author":"A Mart\u00edn","year":"2005","unstructured":"Mart\u00edn, A., Pereira, J., Rodr\u00edguez, G.: A secret sharing scheme based on cellular automata. Appl. Math. Comput. 170(2), 1356\u20131364 (2005)","journal-title":"Appl. Math. Comput."},{"issue":"7","key":"23_CR19","doi-asserted-by":"publisher","first-page":"2596","DOI":"10.1109\/18.887867","volume":"46","author":"C Padr\u00f3","year":"2000","unstructured":"Padr\u00f3, C., S\u00e1ez, G.: Secret sharing schemes with bipartite access structure. IEEE Trans. Inf. Theory 46(7), 2596\u20132604 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"23_CR20","doi-asserted-by":"publisher","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"},{"issue":"1","key":"23_CR21","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1109\/18.272461","volume":"40","author":"DR Stinson","year":"1994","unstructured":"Stinson, D.R.: Decomposition constructions for secret sharing schemes. IEEE Trans. Inf. Theory 40(1), 118\u2013125 (1994)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"23_CR22","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s00145-006-0334-8","volume":"20","author":"T Tassa","year":"2007","unstructured":"Tassa, T.: Hierarchical threshold secret sharing. J. Cryptol. 20(2), 237\u2013264 (2007)","journal-title":"J. Cryptol."}],"container-title":["Lecture Notes in Computer Science","Cryptology and Network Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00434-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,31]],"date-time":"2022-08-31T02:18:39Z","timestamp":1661912319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00434-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030004330","9783030004347"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00434-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"1 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CANS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Naples","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cans2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cans2018.na.icar.cnr.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"79","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}