2021/04/13 by Diego Munuera-Merayo, Munuera-Merayo, Diego
Computer Science · Mathematics · #13F07 #94A62 #Complexity and Algorithms in Graphs #Cryptography and Data Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Graph Labeling and Dimension Problems #Information Theory (cs.IT) #cs.CR #cs.IT #math.IT #msc:13F07 #msc:94A62
paper · pdf · doi:10.48550/arxiv.2104.06361
12 pages. There is one figure in page 6. To be submitted to the Journal of Algebra Combinatorics Discrete Structures and Applications
openalex publication_date 2021/04/13 · arxiv created 2021/06/23 · arxiv updated 2021/06/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Secret Sharing Schemes (SSS) are methods for distributing a secret among a set of participants. One of the first Secret Sharing Schemes was proposed by M. Mignotte, based on the Chinese remainder theorem over the ring of integers. In this article we extend the Mignotte's scheme to the ring of Gaussian Integers and study some of its properties. While doing this we aim to solve a gap in a previous construction of such extension. In addition we show that any access structure can be made through a SSS over ℤ[i].