On Mignotte Secret Sharing Schemes over Gaussian Integers

04/13/2021
by   Diego Munuera-Merayo, et al.
0

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].

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/03/2022

Advance sharing of quantum shares for classical secrets

Secret sharing schemes for classical secrets can be classified into clas...
research
12/10/2021

Linear complementary dual code-based Multi-secret sharing scheme

Hiding a secret is needed in many situations. Secret sharing plays an im...
research
06/11/2019

New dynamic and verifiable multi-secret sharing schemes based on LFSR public key cryptosystem

A verifiable multi-secret sharing (VMSS) scheme enables the dealer to sh...
research
08/16/2021

Multiparty secret sharing based on hidden multipliers

Secret sharing schemes based on the idea of hidden multipliers in encryp...
research
08/09/2018

Secret Sharing with Binary Shares

Secret sharing is a fundamental cryptographic primitive. One of the main...
research
04/28/2023

Randomness Requirements for Three-Secret Sharing

We study a secret sharing problem with three secrets where the secrets a...
research
12/03/2017

Fourier-based Function Secret Sharing with General Access Structure

Function secret sharing (FSS) scheme is a mechanism that calculates a fu...

Please sign up or login with your details

Forgot password? Click here to reset