(t, k, n) Regional Secret Image Sharing over Finite Fields

MK Sardar, J Pramanik, A Adhikari - Signal Processing, 2023 - Elsevier
Secret image sharing (SIS), a tool capable of distributing a private image among certain
number of shareholders, ensures both authorized recovery and unauthorized forbidding of …

Evolving secret sharing with essential participants

J Pramanik, A Adhikari - … of International Conference on Frontiers in …, 2021 - Springer
Komargodski et al. introduced Evolving Secret Sharing which allows an impartial participant,
called dealer, to share a secret among unbounded number of participants over any given …

Evolving secret sharing in almost semi-honest model

J Pramanik, A Adhikari - International Conference on Security and Privacy, 2021 - Springer
Evolving secret sharing is a special kind of secret sharing where the number of shareholders
is not known beforehand, ie, at time t= 0 t= 0. In classical secret sharing such a restriction …

Cheating detectable ramp secret sharing with optimal cheating resiliency

J Pramanik, S Dutta, PS Roy, A Adhikari - International Conference on …, 2020 - Springer
Abstract A (k, L, n) ramp secret sharing scheme allows a dealer to share a secret vector with
a lesser share size compared to threshold secret sharing schemes. In this work, we …

Efficient random grid visual cryptographic schemes having essential members

B Chandra Das, MK Sardar, A Adhikari - Security and Privacy: Select …, 2021 - Springer
This paper deals with both “OR”-and “XOR”-based black and white random grid visual
cryptographic schemes (RGVCS) for (t, k, n) essential access structure. The (t, k, n) essential …

[PDF][PDF] A Complete Bibliography of Publications in the journal Groups Complexity Cryptology

NHF Beebe - 2019 - netlib.org
A Complete Bibliography of Publications in the journal Groups Complexity Cryptology Page
1 A Complete Bibliography of Publications in the journal Groups Complexity Cryptology …