# zbMATH — the first resource for mathematics

Geometric and computational approach to classical and quantum secret sharing. (English) Zbl 1383.81075
Kotsireas, Ilias S. (ed.) et al., Applications of computer algebra, Kalamata, Greece, July 20–23, 2015. Cham: Springer (ISBN 978-3-319-56930-7/hbk; 978-3-319-56932-1/ebook). Springer Proceedings in Mathematics & Statistics 198, 267-272 (2017).
Summary: Secret sharing is a cryptographic scheme to encode a secret to multiple shares being distributed to participants, so that only qualified (or authorized) sets of participants can reconstruct the original secret from their shares. It is also known that every linear ramp secret sharing can be expressed by a nested pair of linear codes $$C_2 \subset C_1 \subset \mathbb{F}_q^n$$. On the other hand, a nest code pair $$C_2 \subset C_1 \subset \mathbb{F}_q^n$$ can also give a quantum secret sharing. Since $$C_1$$ and $$C_2$$ are linear codes, it is natural to use algebraic geometry codes to construct $$C_1$$ and $$C_2$$. The purpose of this work is to find sufficient conditions for qualified or forbidden sets by using geometric properties of the set of points.
For the entire collection see [Zbl 1379.13001].
##### MSC:
 81P94 Quantum cryptography (quantum-theoretic aspects) 94A62 Authentication, digital signatures and secret sharing 94A60 Cryptography 94B05 Linear codes, general 81P70 Quantum coding (general)
Full Text:
##### References:
 [1] 1. Bains, T.: Generalized Hamming weights and their applications to secret sharing schemes. Master’s Thesis, University of Amsterdam (2008). Supervised by R. Cramer, G. van der Geer, and R. de Haan [2] 2. Blakley, G.R., Meadows, C.: Security of ramp schemes. In: Advances in Cryptology—CRYPTO’84. Lecture Notes in Computer Science, vol. 196, pp. 242-269. Springer (1985). doi: · Zbl 1359.68062 [3] 3. Chen, H., Cramer, R., Goldwasser, S., de Haan, R., Vaikuntanathan, V.: Secure computation from random error correccting codes. In: Advances in Cryptology—EUROCRYPT 2007. Lecture Notes in Computer Science, vol. 4515, pp. 291-310. Springer (2007). doi: · Zbl 1141.94346 [4] 4. Chen, H., Cramer, R., de Haan, R., Cascudo Pueyo, I.: Strongly multiplicative ramp schemes from high degree rational points on curves. In: Smart, N. (ed.) Advances in Cryptology—EUROCRYPT 2008. Lecture Notes in Computer Science, vol. 4965, pp. 451-470. Springer (2008). doi: · Zbl 1149.94309 [5] 5. Cleve, R., Gottesman, D., Lo, H.K.: How to share a quantum secret. Phys. Rev. Lett. 83 (3), 648-651 (1999). doi: [6] 6. Geil, O., Pellikaan, R.: On the structure of order domains. Finite Fields Appl. 8 , 369-396 (2002) · Zbl 1008.13007 [7] 7. Gottesman, D.: Theory of quantum secret sharing. Phys. Rev. A 61 (4), 042311 (2000). doi: [8] 8. Heegard, C., Little, J., Saints, K.: Systematic encoding via Gröbner bases for a class of algebraic-geometric Goppa codes. IEEE Trans. Inf. Theory 41 (6), 1752-1761 (1995). doi: · Zbl 0857.94015 [9] 9. Kurihara, J., Uyematsu, T., Matsumoto, R.: Secret sharing schemes based on linear codes can be precisely characterized by the relative generalized Hamming weight. IEICE Trans. Fundam. E95-A (11), 2067-2075 (2012). doi: [10] 10. Matsumoto, R.: Coding theoretic construction of quantum ramp secret sharing, Version 4 or later (2014) [11] 11. Matsumoto, R., Miura, S.: Finding a basis of a linear system with pairwise distinct discrete valuations on an algebraic curve. J. Symb. Comput. 30 (3), 309-323 (2000). doi: · Zbl 0966.14042 [12] 12. Matsumoto, R., Miura, S.: On construction and generalization of algebraic geometry codes. In: Katsura, T. et al. (eds.) Proceedings of Algebraic Geometry, Number Theory, Coding Theory, and Cryptography, pp. 3-15. University of Tokyo, Japan (2000). [13] 13. Ogata, W., Kurosawa, K., Tsujii, S.: Nonperfect secret sharing schemes. In: Advances in Cryptology—AUSCRYPT ’92. Lecture Notes in Computer Science, vol. 718, pp. 56-66. Springer (1993). doi: · Zbl 0869.94021 [14] 14. Ogawa, T., Sasaki, A., Iwamoto, M., Yamamoto, H.: Quantum secret sharing schemes and reversibility of quantum operations. Phys. Rev. A 72 (3), 032318 (2005). doi: [15] 15. Shamir, A.: How to share a secret. Commun. ACM 22 (11), 612-613 (1979). doi: · Zbl 0414.94021 [16] 16. Smith, A.D.: Quantum secret sharing for general access structures. [17] 17. Yamamoto, H.: Secret sharing system using [18] 18. Zhang, P., Matsumoto, R.: Quantum strongly secure ramp secret sharing. Quantum Inf. Process. 14 (2), 715-729 (2015). doi: · Zbl 1311.81106
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.