Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Theoretical Computer Science

On group-characterizability of homomorphic secret sharing schemes

Reza Kaboli, Shahram Khazaei, Maghsoud Parviz

Published Sep 1, 2021• 4 citations
Publisher
DOI
10.1016/j.tcs.2021.08.032

Related papers

Group-homomorphic Secret Sharing Schemes Are Group-characterizable with Normal Subgroups.

Reza Kaboli, Shahram Khazaei, Maghsoud Parviz

•Jan 1, 2019•2 citations

Multi-Key Homomorphic Secret Sharing

Geoffroy Couteau, Lalita Devadas, Aditya Hegde +2 more

Lecture notes in computer science•Jan 1, 2025•11 citations

An Optimal Distributed Discrete Log Protocol with Applications to Homomorphic Secret Sharing

Itai Dinur, Nathan Keller, Ohad Klein

Journal of Cryptology•Sep 26, 2019•5 citations

On the classification of ideal secret sharing schemes

Ernest F. Brickell, Daniel M. Davenport

Journal of Cryptology•Jan 1, 1991•294 citations

On ideal and weakly-ideal access structures

Reza Kaboli, Shahram Khazaei, Maghsoud Parviz

For more than two decades, proving or refuting the following statement has remained a challenging open problem in the theory of secret sharing schemes (SSSs): every ideal access structure admits an ideal perfect multi-linear SSS. The class of group-characterizable (GC) SSSs include the multi-linear ones. Hence, if the above statement is true, then so is the following weaker statement: every ideal access structure admits an ideal perfect GC SSS. One contribution of this paper is to show that ideal SSSs are not necessarily GC. Our second contribution is to study the above two statements with respect to several variations of weakly-ideal access structures. Recently, Mejia and Montoya studied ideal access structures that admit ideal multi-linear schemes and provided a classification-like theorem for them. We additionally present some tools that are useful to extend their result.

Advances in Mathematics of Communications•Jun 11, 2021•2 citations

On the Classification of Ideal Secret Sharing Schemes

Ernest F. Brickell, Daniel M. Davenport

Springer eBooks•Nov 8, 2007•21 citations
For more than two decades, proving or refuting the following statement has remained a challenging open problem in the theory of secret sharing schemes (SSSs): every ideal access structure admits an ideal perfect multi-linear SSS. The class of group-characterizable (GC) SSSs include the multi-linear ones. Hence, if the above statement is true, then so is the following weaker statement: every ideal access structure admits an ideal perfect GC SSS. One contribution of this paper is to show that ideal SSSs are not necessarily GC. Our second contribution is to study the above two statements with respect to several variations of weakly-ideal access structures. Recently, Mejia and Montoya studied ideal access structures that admit ideal multi-linear schemes and provided a classification-like theorem for them. We additionally present some tools that are useful to extend their result.