Multiplicative Partially Homomorphic CRT Secret Sharing
S Dolev, Y Kleinman - Cryptology ePrint Archive, 2022 - eprint.iacr.org
A new CRT-based positive (non-zero) secret-sharing scheme with perfect information-
theoretic (PIT) security and multiplicative homomorphism is presented. The scheme is …
theoretic (PIT) security and multiplicative homomorphism is presented. The scheme is …
Multiplicative Partially Homomorphic CRT Secret Sharing:(Preliminary Version)
S Dolev, Y Kleinman - 2022 IEEE 21st International …, 2022 - ieeexplore.ieee.org
A new CRT-based positive (non-zero) secret-sharing scheme with perfect information-
theoretic (PIT) security and multiplicative homomorphism is presented. The scheme is …
theoretic (PIT) security and multiplicative homomorphism is presented. The scheme is …
Homomorphic extensions of CRT-based secret sharing
In this work, we explore the homomorphic aspect of CRT-based secret sharing schemes.
Secret sharing homomorphism is the notion of operating on multiple secrets by direct …
Secret sharing homomorphism is the notion of operating on multiple secrets by direct …
Asymptotically ideal CRT-based secret sharing schemes for multilevel and compartmented access structures
Multilevel and compartmented access structures are two important classes of access
structures where participants are grouped into levels/compartments with different degrees of …
structures where participants are grouped into levels/compartments with different degrees of …
On d-Multiplicative Secret Sharing
A multiplicative secret sharing scheme allows players to multiply two secret-shared field
elements by locally converting their shares of the two secrets into an additive sharing of their …
elements by locally converting their shares of the two secrets into an additive sharing of their …
Secret sharing scheme based on hashing
M Andrecut - arXiv preprint arXiv:2302.02507, 2023 - arxiv.org
We propose an adaptive threshold multi secret sharing scheme based solely on
cryptographically secure hash functions. We show that the proposed scheme is also: perfect …
cryptographically secure hash functions. We show that the proposed scheme is also: perfect …
[PDF][PDF] Proactive linear integer secret sharing
R Thorbek - Cryptology ePrint Archive, 2009 - eprint.iacr.org
Proactive Linear Integer Secret Sharing Page 1 Proactive Linear Integer Secret Sharing Rune
Thorbek BRICS, Dept. of Computer Science, University of Aarhus Abstract. In [3] Damgard …
Thorbek BRICS, Dept. of Computer Science, University of Aarhus Abstract. In [3] Damgard …
[HTML][HTML] Novel threshold changeable secret sharing schemes based on polynomial interpolation
After any distribution of secret sharing shadows in a threshold changeable secret sharing
scheme, the threshold may need to be adjusted to deal with changes in the security policy …
scheme, the threshold may need to be adjusted to deal with changes in the security policy …
Secret sharing: A comprehensive survey, taxonomy and applications
The emergence of ubiquitous computing and different disruptive technologies caused
magnificent development in information and communication technology. Likewise …
magnificent development in information and communication technology. Likewise …
Efficient secret sharing schemes achieving optimal information rate
Y Wang, Y Desmedt - 2014 IEEE Information Theory Workshop …, 2014 - ieeexplore.ieee.org
One of the important problems in secret sharing schemes is to establish bounds on the size
of the shares to be given to participants in secret sharing schemes. The other important …
of the shares to be given to participants in secret sharing schemes. The other important …