{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:29:56Z","timestamp":1760059796912,"version":"build-2065373602"},"reference-count":25,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T00:00:00Z","timestamp":1752105600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"The Talented Research Start-up Project of Jiaying University","award":["2022RC02","QHKLYC-GDCXCY-2024-216"],"award-info":[{"award-number":["2022RC02","QHKLYC-GDCXCY-2024-216"]}]},{"name":"The 2024 Qinghai Province \u201cKunlun Talent-High-End Innovative and Entrepreneurial Talent\u201d Cultivation Category Top-notch Talent Project","award":["2022RC02","QHKLYC-GDCXCY-2024-216"],"award-info":[{"award-number":["2022RC02","QHKLYC-GDCXCY-2024-216"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computation"],"abstract":"<jats:p>The secret sharing schemes (SSS) are widely used in secure multi-party computing and distributed computing, and the access structure is the key to constructing secret sharing schemes. In this paper, we propose a method for constructing access structures based on hyperplane combinatorial structures over finite fields. According to the given access structure, the corresponding secret sharing scheme that can identify cheaters is given. This scheme enables the secret to be correctly restored if the cheater does not exceed the threshold, and the cheating behavior can be detected and located.<\/jats:p>","DOI":"10.3390\/computation13070166","type":"journal-article","created":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T09:38:27Z","timestamp":1752140307000},"page":"166","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Some Secret Sharing Based on Hyperplanes"],"prefix":"10.3390","volume":"13","author":[{"given":"Guohui","family":"Wang","sequence":"first","affiliation":[{"name":"School of Mathematics and Physics, Qinghai University, Xining 810016, China"}]},{"given":"Yucheng","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Mathematics, Jiaying University, Meizhou 514015, China"}]}],"member":"1968","published-online":{"date-parts":[[2025,7,10]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","article-title":"How to share a secret","volume":"22","author":"Shamir","year":"1979","journal-title":"Commun. ACM"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Blakley, G.R. (1979, January 4\u20137). Safeguarding cryptographic keys. Proceedings of the International Workshop on Managing Requirements Knowledge, New York, NY, USA.","DOI":"10.1109\/MARK.1979.8817296"},{"key":"ref_3","unstructured":"Ben-Or, M., Goldwasser, S., and Wigderson, A. (2019). Completeness theorems for non-cryptographic fault-tolerant distributed computation. Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, Association for Computing Machinery."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., and Damgard, I. (1988, January 2\u20134). Multiparty unconditionally secure protocols. Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, Chicago, IL, USA.","DOI":"10.1145\/62212.62214"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I., and Maurer, U. (2000). General secure multi-party computation from any linear secret-sharing scheme. Advances in Cryptology\u2014EUROCRYPT 2000, Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques, Bruges, Belgium, 14\u201318 May 2000, Springer.","DOI":"10.1007\/3-540-45539-6_22"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"2644","DOI":"10.1109\/TIT.2008.921692","article-title":"On codes, matroids, and secure multiparty computation from linear secret-sharing schemes","volume":"54","author":"Cramer","year":"2008","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"980","DOI":"10.1109\/TIFS.2016.2598533","article-title":"Information-theoretic secure multi-party computation with collusion deterrence","volume":"12","author":"Wang","year":"2016","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_8","unstructured":"Goyal, V., Pandey, O., Sahai, A., and Waters, B. (November, January 30). Attribute-based encryption for fine-grained access control of encrypted data. Proceedings of the 13th ACM Conference on Computer and Communications Security, Alexandria, VA, USA."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Naor, M., and Wool, A. (1996, January 14\u201315). Access control and signatures via quorum secret sharing. Proceedings of the 3rd ACM Conference on Computer and Communications Security, New Delhi, India.","DOI":"10.1145\/238168.238209"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Desmedt, Y. (1993). Threshold cryptosystems. Advances in Cryptology\u2014AUSCRYPT\u201992, Proceedings of the International Workshop on the Theory and Application of Cryptographic Techniques, Gold Coast, QLD, Australia, 13\u201316 December 1992, Springer.","DOI":"10.1007\/3-540-57220-1_47"},{"key":"ref_11","unstructured":"Karchmer, M., and Wigderson, A. (1993, January 18\u201321). On span programs. Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1145\/358746.358762","article-title":"On sharing secrets and Reed-Solomon codes","volume":"24","author":"McEliece","year":"1981","journal-title":"Commun. ACM"},{"key":"ref_13","unstructured":"Massey, J.L. (1993, January 22\u201327). Minimal codewords and secret sharing. Proceedings of the 6th Joint Swedish-Russian International Workshop on Information Theory, M\u00f6lle, Sweden."},{"key":"ref_14","first-page":"56","article-title":"Secret sharing scheme realizing general access structure","volume":"72","author":"Ito","year":"1989","journal-title":"Electron. Commun. Jpn. (Part III Fundam. Electron. Sci.)"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1007\/s11424-013-2131-4","article-title":"The optimal linear secret sharing scheme for any given access structure","volume":"26","author":"Tang","year":"2013","journal-title":"J. Syst. Sci. Complex."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.ins.2016.06.006","article-title":"Realizing secret sharing with general access structure","volume":"367","author":"Harn","year":"2016","journal-title":"Inf. Sci."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1023\/A:1008200605620","article-title":"Difference sets corresponding to a class of symmetric designs","volume":"10","author":"Ma","year":"1997","journal-title":"Des. Codes Cryptogr."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"257","DOI":"10.4153\/CJM-1982-018-x","article-title":"On automorphism groups of divisible designs","volume":"34","author":"Jungnickel","year":"1982","journal-title":"Can. J. Math."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"319","DOI":"10.2140\/pjm.1965.15.319","article-title":"Character sums and difference sets","volume":"15","author":"Turyn","year":"1965","journal-title":"Pac. J. Math."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0097-3165(73)90031-9","article-title":"A family of difference sets in non-cyclic groups","volume":"15","author":"McFarl","year":"1973","journal-title":"J. Comb. Theory Ser. A"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s00145-008-9027-9","article-title":"Multipartite secret sharing by bivariate interpolation","volume":"22","author":"Tassa","year":"2009","journal-title":"J. Cryptol."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1652","DOI":"10.1109\/TIT.2014.2300113","article-title":"Natural generalizations of threshold secret sharing","volume":"60","author":"Farras","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"2913","DOI":"10.1007\/s10623-019-00657-2","article-title":"Efficient explicit constructions of compartmented secret sharing schemes","volume":"87","author":"Chen","year":"2019","journal-title":"Des. Codes Cryptogr."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1109\/TIT.2021.3123102","article-title":"Efficient explicit constructions of multipartite secret sharing schemes","volume":"68","author":"Chen","year":"2021","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Brickell, E.F. (1990). Some ideal secret sharing schemes. Advances in Cryptology\u2014EUROCRYPT\u201989, Proceedings of the Workshop on the Theory and Application of of Cryptographic Techniques, Houthalen, Belgium, 10\u201313 April 1989, Springer.","DOI":"10.1007\/3-540-46885-4_45"}],"container-title":["Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2079-3197\/13\/7\/166\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T18:07:42Z","timestamp":1760033262000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2079-3197\/13\/7\/166"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,10]]},"references-count":25,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2025,7]]}},"alternative-id":["computation13070166"],"URL":"https:\/\/doi.org\/10.3390\/computation13070166","relation":{},"ISSN":["2079-3197"],"issn-type":[{"type":"electronic","value":"2079-3197"}],"subject":[],"published":{"date-parts":[[2025,7,10]]}}}