A New Secret Sharing Scheme for Images Based on Additive 2-Dimensional Cellular Automata

2005 ◽  
pp. 411-418 ◽  
Author(s):  
Gonzalo Álvarez Marañón ◽  
Luis Hernández Encinas ◽  
Ángel Martín del Rey
Keyword(s):  
Cellular Automata ◽  
Secret Sharing ◽  
Secret Sharing Scheme ◽  
Sharing Scheme

High-speed GPU implementation of a secret sharing scheme based on cellular automata

2019 ◽  
Vol 75 (11) ◽  
pp. 7314-7336
Author(s):  
Saeideh Kabirirad ◽  
Mahmood Fazlali ◽  
Ziba Eslami
Keyword(s):  
Cellular Automata ◽  
Secret Sharing ◽  
High Speed ◽  
Secret Sharing Scheme ◽  
Sharing Scheme ◽  
Gpu Implementation

A GPU implementation of secret sharing scheme based on cellular automata

2016 ◽  
Vol 72 (4) ◽  
pp. 1291-1311 ◽  
Author(s):  
Rogelio Adrian Hernandez-Becerril ◽  
Ariana Guadalupe Bucio-Ramirez ◽  
Mariko Nakano-Miyatake ◽  
Hector Perez-Meana ◽  
Marco Pedro Ramirez-Tachiquin
Keyword(s):  
Cellular Automata ◽  
Secret Sharing ◽  
Secret Sharing Scheme ◽  
Sharing Scheme ◽  
Gpu Implementation

A (2, n)-SECRET SHARING SCHEME BASED ON LINEAR CELLULAR AUTOMATA

2008 ◽  
Vol 19 (10) ◽  
pp. 1529-1535
Author(s):  
A. MARTÍN DEL REY ◽  
A. QUEIRUGA DIOS ◽  
G. RODRÍGUEZ SÁNCHEZ
Keyword(s):  
Cellular Automata ◽  
Secret Sharing ◽  
Secret Sharing Scheme ◽  
Sharing Scheme ◽  
Elementary Cellular Automata ◽  
Finite Set

An algorithm to share a secret among a set of users is introduced in this work. It is based on the use of linear cellular automata over the finite set 𝔽2 and it is considered as a generalization of a previous work due to the authors dealing with an elementary cellular automata-based secret sharing scheme. The algorithm is shown to be secure, ideal, and perfect.

A secret sharing scheme based on cellular automata

2005 ◽  
Vol 170 (2) ◽  
pp. 1356-1364 ◽  
Author(s):  
A. Martín del Rey ◽  
J. Pereira Mateus ◽  
G. Rodríguez Sánchez
Keyword(s):  
Cellular Automata ◽  
Secret Sharing ◽  
Secret Sharing Scheme ◽  
Sharing Scheme

A verifiable multi-secret sharing scheme based on cellular automata

2010 ◽  
Vol 180 (15) ◽  
pp. 2889-2894 ◽  
Author(s):  
Z. Eslami ◽  
J. Zarepour Ahmadabadi
Keyword(s):  
Cellular Automata ◽  
Secret Sharing ◽  
Secret Sharing Scheme ◽  
Sharing Scheme ◽  
Multi Secret Sharing

A 3D-Cellular Automata-Based Publicly-Verifiable Threshold Secret Sharing

2020 ◽  
pp. 270-291
Author(s):  
Rosemary Koikara ◽  
Eun-Joon Yoon ◽  
Anand Paul
Keyword(s):  
Cellular Automata ◽  
Secret Sharing ◽  
Three Dimensional ◽  
Secret Sharing Scheme ◽  
Reconstruction Process ◽  
Threshold Secret Sharing ◽  
Verifiable Secret Sharing ◽  
Access Structures ◽  
Sharing Scheme ◽  
Public Share

In secret sharing, a secret is distributed between various participants in a manner that an authorized group of participants in the appropriate access structures can recover this secret. However, a dealer might get corrupted by adversaries and may influence this secret sharing or the reconstruction process. Verifiable secret sharing (VSS) overcomes this issue by adding a verifiability protocol to the original secret sharing scheme. This chapter discusses a computationally secure publicly verifiable secret sharing scheme constructed using the three-dimensional cellular automata (3D CA). The initial configuration of the 3D CA is the secret. The following configurations are devised to be the shares distributed among the participants. Update mechanisms and various rules make it hard for an adversary to corrupt or duplicate a share. To make it even more efficient, the authors added a verifiability layer such that a dealer posts a public share and a private share to each shareholder. The NIST test suite has been used to calculate the randomness of the shares.

Sign in / Sign up

Export Citation Format

Share Document