{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:39:47Z","timestamp":1742985587128,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030121457"},{"type":"electronic","value":"9783030121464"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-12146-4_15","type":"book-chapter","created":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T02:57:09Z","timestamp":1548298629000},"page":"233-247","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Cheating-Immune Secret Sharing Schemes from Maiorana-McFarland Boolean Functions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3563-2262","authenticated-orcid":false,"given":"Romar B.","family":"dela Cruz","sequence":"first","affiliation":[]},{"given":"Say","family":"Ol","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,23]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Blakley, G.: Safeguarding cryptographic keys. In: Proceedings of AFIPS 1979 National Computer Conference, New York, vol. 48, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Robust computational secret sharing and a unified account of classical secret-sharing goals. In: ACM Conference on Computer and Communications Security, pp. 172\u2013184. ACM (2007)","DOI":"10.1145\/1315245.1315268"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/3-540-48658-5_24","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201994","author":"J Bierbrauer","year":"1994","unstructured":"Bierbrauer, J., Gopalakrishnan, K., Stinson, D.R.: Bounds for resilient functions and orthogonal arrays. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 247\u2013256. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_24"},{"key":"15_CR4","unstructured":"Braeken, A., Nikov, V., Nikova, S.: On cheating immune secret sharing. In: Proceedings of 25th Symposium on Information Theory in the Benelux, pp. 113\u2013120 (2004)"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. J. Symb. Comput. 24, 235\u2013265 (1997)","journal-title":"J. Symb. Comput."},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1023\/A:1013856431727","volume":"25","author":"S Cabello","year":"2002","unstructured":"Cabello, S., Padr\u00f3, C., S\u00e1ez, G.: Secret sharing schemes with detection of cheaters for general access structures. Des. Codes Cryptogr. 25, 175\u2013188 (2002)","journal-title":"Des. Codes Cryptogr."},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/3-540-46766-1_6","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"P Camion","year":"1992","unstructured":"Camion, P., Carlet, C., Charpin, P., Sendrier, N.: On Correlation-immune functions. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 86\u2013100. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_6"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Carlet, C.: Boolean functions for cryptography and error-correcting codes. In: Boolean Models and Methods in Mathematics, Computer Science, and Engineering (Encyclopedia of Mathematics and its Applications), pp. 257\u2013397. Cambridge University Press (2010)","DOI":"10.1017\/CBO9780511780448.011"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/BFb0054146","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201998","author":"C Carlet","year":"1998","unstructured":"Carlet, C.: On the propagation criterion of degree l and order k. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 462\u2013474. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054146"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Carlet, C.: Vectorial Boolean functions for cryptography. In: Boolean Models and Methods in Mathematics, Computer Science, and Engineering (Encyclopedia of Mathematics and its Applications), pp. 398\u2013470. Cambridge University Press (2010)","DOI":"10.1017\/CBO9780511780448.012"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults. In: FOCS 1985, pp. 383\u2013395 (1985)","DOI":"10.1109\/SFCS.1985.64"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-45539-6_22","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2000","author":"R Cramer","year":"2000","unstructured":"Cramer, R., Damg\u00e5rd, I., Maurer, U.: General secure multi-party computation from any linear secret-sharing scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 316\u2013334. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_22"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.dam.2005.03.026","volume":"154","author":"P D\u2019Arco","year":"2006","unstructured":"D\u2019Arco, P., Kishimoto, W., Stinson, D.: Properties and constraints of cheating-immune secret sharing schemes. Discret. Appl. Math. 154, 219\u2013233 (2006)","journal-title":"Discret. Appl. Math."},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s12095-012-0076-4","volume":"5","author":"R Cruz dela","year":"2013","unstructured":"dela Cruz, R., Wang, H.: Cheating-immune secret sharing schemes from codes and cumulative arrays. Cryptogr. Commun. 5, 67\u201383 (2013)","journal-title":"Cryptogr. Commun."},{"key":"15_CR15","doi-asserted-by":"publisher","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"},{"issue":"3","key":"15_CR16","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1109\/18.6037","volume":"34","author":"X Guo-Zhen","year":"1988","unstructured":"Guo-Zhen, X., Massey, J.: A spectral characterization of correlation-immune combining functions. IEEE Trans. Inf. Theory 34(3), 569\u2013571 (1988)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"15_CR17","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1109\/TIT.1978.1055928","volume":"24","author":"T Helleseth","year":"1978","unstructured":"Helleseth, T., Klove, T., Mykkeltveit, J.: On the covering radius of binary codes. IEEE Trans. Inf. Theory 24(5), 627\u2013628 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"15_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error-Correcting Codes","author":"WC Huffman","year":"2003","unstructured":"Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003)"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/3-540-44750-4_33","volume-title":"Advances in Cryptology \u2014 CRYPT0\u2019 95","author":"K Kurosawa","year":"1995","unstructured":"Kurosawa, K., Obana, S., Ogata, W.: t-Cheater identifiable (k, n) threshold secret sharing schemes. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 410\u2013423. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-44750-4_33"},{"key":"15_CR20","volume-title":"The Theory of Error-Correcting Codes","author":"F MacWilliams","year":"1977","unstructured":"MacWilliams, F., Sloane, N.: The Theory of Error-Correcting Codes. North-Holland Publishing Company, Amsterdam (1977)"},{"key":"15_CR21","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"R McEliece","year":"1981","unstructured":"McEliece, R., Sarwate, D.: On sharing secrets and Reed-Solomon codes. Commun. ACM 24, 583\u2013584 (1981)","journal-title":"Commun. ACM"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-24691-6_7","volume-title":"Information Security and Cryptology - ICISC 2003","author":"WP Ma","year":"2004","unstructured":"Ma, W.P., Lee, M.H.: New methods to construct cheating immune functions. In: Lim, J.-I., Lee, D.-H. (eds.) ICISC 2003. LNCS, vol. 2971, pp. 79\u201386. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24691-6_7"},{"key":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/11599548_33","volume-title":"Information Security and Cryptology","author":"WP Ma","year":"2005","unstructured":"Ma, W.P., Zhang, F.T.: New methods to construct cheating-immune multisecret sharing scheme. In: Feng, D., Lin, D., Yung, M. (eds.) CISC 2005. LNCS, vol. 3822, pp. 384\u2013394. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11599548_33"},{"key":"15_CR24","unstructured":"Martin, K.: Challenging the adversary model in secret sharing schemes. In: Coding and Cryptography II, Proceeidngs of the Royal Flemish Academy of Belgium for Science and the Arts, pp. 45\u201363 (2008)"},{"key":"15_CR25","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1137\/S0895480100378689","volume":"20","author":"W Ogata","year":"2006","unstructured":"Ogata, W., Kurosawa, K., Stinson, D.: Optimum secret sharing scheme secure against cheating. SIAM J. Discret. Math. 20, 79\u201395 (2006)","journal-title":"SIAM J. Discret. Math."},{"key":"15_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/3-540-45311-3_8","volume-title":"Progress in Cryptology\u2014INDOCRYPT 2001","author":"J Pieprzyk","year":"2001","unstructured":"Pieprzyk, J., Zhang, X.-M.: Cheating Prevention in Secret Sharing over $$GF(p^{t})$$ . In: Rangan, C.P., Ding, C. (eds.) INDOCRYPT 2001. LNCS, vol. 2247, pp. 79\u201390. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45311-3_8"},{"key":"15_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/3-540-45861-1_18","volume-title":"Information Security and Cryptology \u2014 ICISC 2001","author":"J Pieprzyk","year":"2002","unstructured":"Pieprzyk, J., Zhang, X.-M.: Constructions of cheating-immune secret sharing. In: Kim, K. (ed.) ICISC 2001. LNCS, vol. 2288, pp. 226\u2013243. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45861-1_18"},{"key":"15_CR28","first-page":"253","volume":"6","author":"J Pieprzyk","year":"2004","unstructured":"Pieprzyk, J., Zhang, X.M.: On cheating immune secret sharing. Discret. Math. Theor. Comput. Sci. 6, 253\u2013264 (2004)","journal-title":"Discret. Math. Theor. Comput. Sci."},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proceedings of 21st ACM Symposium on Theory of Computing, pp. 73\u201385 (1989)","DOI":"10.1145\/73007.73014"},{"key":"15_CR30","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":"3","key":"15_CR31","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF00202271","volume":"8","author":"D Stinson","year":"1995","unstructured":"Stinson, D., Massey, J.: An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions. J. Cryptol. 8(3), 167\u2013173 (1995)","journal-title":"J. Cryptol."},{"issue":"1","key":"15_CR32","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/s10623-010-9378-8","volume":"58","author":"T Tassa","year":"2011","unstructured":"Tassa, T.: Generalized oblivious transfer by secret sharing. Des. Codes Cryptogr. 58(1), 11\u201321 (2011)","journal-title":"Des. Codes Cryptogr."},{"key":"15_CR33","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF02252871","volume":"1","author":"M Tompa","year":"1988","unstructured":"Tompa, M., Woll, H.: How to share a secret with cheaters. J. Cryptol. 1, 133\u2013138 (1988)","journal-title":"J. Cryptol."},{"key":"15_CR34","doi-asserted-by":"crossref","unstructured":"Wei, Y., Hu, Y.: New Construction of resilient functions with satisfying multiple cryptographic criteria. In: Proceedings of the 3rd International Conference on Information Security InfoSecu 2004, pp. 175\u2013180. ACM (2004)","DOI":"10.1145\/1046290.1046327"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2013 ICISC 2018"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-12146-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T22:57:55Z","timestamp":1573772275000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-12146-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030121457","9783030121464"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-12146-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security and Cryptology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Seoul","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","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":"28 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icisc2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icisc.org\/","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":"49","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"21","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":"43% - 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","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"}},{"value":"3 papers of invited talks were accepted.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}