{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T17:09:41Z","timestamp":1763572181480,"version":"3.40.4"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,12,8]],"date-time":"2012-12-08T00:00:00Z","timestamp":1354924800000},"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,3]]},"DOI":"10.1007\/s12095-012-0076-4","type":"journal-article","created":{"date-parts":[[2012,12,7]],"date-time":"2012-12-07T08:45:08Z","timestamp":1354869908000},"page":"67-83","source":"Crossref","is-referenced-by-count":7,"title":["Cheating-immune secret sharing schemes from codes and cumulative arrays"],"prefix":"10.1007","volume":"5","author":[{"given":"Romar","family":"dela Cruz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaxiong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,12,8]]},"reference":[{"key":"76_CR1","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1002\/(SICI)1520-6610(1996)4:5<353::AID-JCD4>3.0.CO;2-E","volume":"4","author":"M Atici","year":"1996","unstructured":"Atici, M., Magliveras, S., Stinson, D., Wei, W.: Some recursive constructions for perfect hash families. J. Comb. Des. 4, 353\u2013363 (1996)","journal-title":"J. Comb. Des."},{"key":"76_CR2","unstructured":"Blakley, G.: Safeguarding cryptographic keys. In: Proc. AFIPS 1979 Natl. Computer Conf. N.Y., vol. 48, pp. 313\u2013317 (1979)"},{"key":"76_CR3","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":"76_CR4","doi-asserted-by":"crossref","unstructured":"Braeken, A., Nikov, V., Nikova, S.: On cheating immune secret sharing. In: Proc. 25th Symposium on Information Theory in the Benelux, pp. 113\u2013120 (2004)","DOI":"10.1007\/978-3-540-30556-9_11"},{"key":"76_CR5","doi-asserted-by":"crossref","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":"76_CR6","doi-asserted-by":"crossref","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. Designs Codes Cryptogr. 25, 175\u2013188 (2002)","journal-title":"Designs Codes Cryptogr."},{"key":"76_CR7","doi-asserted-by":"crossref","unstructured":"Camion, P., Carlet, C., Charpin, P., Sendrier, N.: On correlation-immune functions. In: Advances in Cryptology - CRYPTO \u201991, LNCS, vol. 576, pp. 86\u2013100 (1992)","DOI":"10.1007\/3-540-46766-1_6"},{"key":"76_CR8","doi-asserted-by":"crossref","unstructured":"C. Carlet, \u201cOn the Propagation Criterion of Degree l and Order k,\u201d In: EUROCRYPT \u201998, LNCS, vol. 1403, pp. 462\u2013474 (1998)","DOI":"10.1007\/BFb0054146"},{"key":"76_CR9","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 \u201985, pp. 383\u2013395 (1985)","DOI":"10.1109\/SFCS.1985.64"},{"key":"76_CR10","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/j.dam.2005.03.026","volume":"154","author":"P D\u2019Arco","year":"2006","unstructured":"P. D\u2019Arco, W. Kishimoto and D. Stinson, \u201cProperties and Constraints of Cheating-Immune Secret Sharing Schemes. Discrete Appl. Math. 154, 219\u2013233 (2006)","journal-title":"Discrete Appl. Math."},{"key":"76_CR11","doi-asserted-by":"crossref","unstructured":"Ghodosi, H., Pieprzyk, J., Safavi-Naini, R., Wang, H.: On construction of cumulative secret sharing. In: Proceedings of the Third Australasian Conference on Information Security and Privacy (ACISP\u201998), LNCS, vol. 1438, pp. 379\u2013390 (1998)","DOI":"10.1007\/BFb0053749"},{"issue":"3","key":"76_CR12","doi-asserted-by":"crossref","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"},{"key":"76_CR13","doi-asserted-by":"crossref","unstructured":"Huffman, W.C., Vera Pless: Fundamentals of Error-Correcting Codes, Cambridge University Press, August (2003)","DOI":"10.1017\/CBO9780511807077"},{"key":"76_CR14","unstructured":"Itoh, M., Saito, A., Nishizeki, T.: Secret sharing scheme realizing general access structure. In: IEEE Globecom 1987, pp. 99\u2013102, (1987)"},{"key":"76_CR15","doi-asserted-by":"crossref","unstructured":"Jackson, W.-A., Martin, K.: Cumulative Arrays and Geometric Secret Sharing Schemes. In: Advances in Cryptology: Auscrypt \u201992, LNCS, vol. 718, pp. 48\u201355 (1993)","DOI":"10.1007\/3-540-57220-1_51"},{"key":"76_CR16","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/TIT.1983.1056621","volume":"29","author":"E Karnin","year":"1983","unstructured":"Karnin, E., Greene, J., Hellman, M.: On secret sharing systems. IEEE Trans. Inf. Theory 29, 35\u201341 (1983)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"76_CR17","doi-asserted-by":"crossref","unstructured":"Kurosawa, K., Obana, S., Ogata, W.: t-cheater identifiable (k, n) threshold secret sharing schemes. In: CRYPTO 1995, LNCS, vol. 963, pp. 410\u2013423 (1995)","DOI":"10.1007\/3-540-44750-4_33"},{"key":"76_CR18","doi-asserted-by":"crossref","unstructured":"Kurosawa, K., Satoh, T.: Design of SAC\/PC(l) of Order k Boolean Functions and Three Other Cryptographic Criteria. In: EUROCRYPT \u201997, LNCS, vol. 1233, pp. 434\u2013449 (1997)","DOI":"10.1007\/3-540-69053-0_30"},{"key":"76_CR19","unstructured":"Massey, J.\u00a0L.: Minimal codewords and secret sharing. In: Proc. 6th Joint Swedish-Russian Workshop Inf. Theory, Molle, Sweden, pp. 276\u2013279 (1993)"},{"key":"76_CR20","doi-asserted-by":"crossref","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":"76_CR21","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s10623-006-0007-5","volume":"40","author":"S Long","year":"2006","unstructured":"Long, S., Pieprzyk, J., Wang, H., Wong, D.: Generalised cumulative arrays in secret sharing. Designs Codes Cryptogr. 40, 191\u2013209 (2006)","journal-title":"Designs Codes Cryptogr."},{"key":"76_CR22","doi-asserted-by":"crossref","unstructured":"Ma, W., Lee, M.: New methods to construct cheating immune functions. In: ICISC 2003, LNCS, vol. 2971, pp. 79\u201386 (2003)","DOI":"10.1007\/978-3-540-24691-6_7"},{"key":"76_CR23","doi-asserted-by":"crossref","unstructured":"Ma, W., Zhang, F.: New methods to construct cheating-immune multisecret sharing scheme. In: CISC 2005, LNCS, vol. 3822, pp. 384\u2013394 (2005)","DOI":"10.1007\/11599548_33"},{"key":"76_CR24","unstructured":"Martin, K.: Challenging the adversary model in secret sharing schemes. In: Coding and Cryptography II, Proc. of the Royal Flemish Academy of Belgium for Science and the Arts, pp. 45\u201363 (2008)"},{"key":"76_CR25","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s10623-003-1719-4","volume":"36","author":"K Martin","year":"2005","unstructured":"Martin, K., Safav-Naini, R., Wang, H., Wild, P.: Distributing the encryption and decryption of a block cipher. Designs Codes Cryptogr. 36, 263\u2013287 (2005)","journal-title":"Designs Codes Cryptogr."},{"key":"76_CR26","doi-asserted-by":"crossref","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. Discrete Math. 20, 79\u201395 (2006)","journal-title":"SIAM J. Discrete Math."},{"key":"76_CR27","doi-asserted-by":"crossref","unstructured":"Pieprzyk, J., Zhang, X.M.: Cheating Prevention in Secret Sharing over GF(p t ). In: INDOCRYPT 2001, LNCS, vol. 2247, pp. 79\u201390 (2001)","DOI":"10.1007\/3-540-45311-3_8"},{"key":"76_CR28","doi-asserted-by":"crossref","unstructured":"Pieprzyk, J., Zhang, X.M.: Constructions of Cheating-Immune Secret Sharing. In: ICICS 2001, LNCS, vol. 2288, pp. 226\u2013243 (2002)","DOI":"10.1007\/3-540-45861-1_18"},{"key":"76_CR29","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":"76_CR30","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":"76_CR31","doi-asserted-by":"crossref","unstructured":"Renvall, A., Ding, C.: The access structure of some secret sharing schemes. In: Information Security and Privacy, LNCS, vol. 1172, pp. 67\u201378, Springer-Verlag (1996)","DOI":"10.1007\/BFb0023288"},{"key":"76_CR32","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":"76_CR33","doi-asserted-by":"crossref","unstructured":"Stinson, D.: Cryptography Theory and Practice, 3rd edn., CRC Press, November (2005)","DOI":"10.1201\/9781420057133"},{"key":"76_CR34","doi-asserted-by":"crossref","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":"76_CR35","unstructured":"Wei, Y., Hu, Y.: New Construction of Resilient Functions with Satisfying Multiple Cryptographic Criteria. In: Proc. of the 3rd International Conference on Information Security InfoSecu \u201904, pp. 175\u2013180, ACM, (2004)"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-012-0076-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-012-0076-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-012-0076-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T11:46:00Z","timestamp":1745408760000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-012-0076-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,8]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["76"],"URL":"https:\/\/doi.org\/10.1007\/s12095-012-0076-4","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2012,12,8]]}}}