On group-characterizability of homomorphic secret sharing schemes

DOI10.1016/J.TCS.2021.08.032MaRDI QIDQ2235752zbMATH OpenOpenAlexWikidataFDO

Authors Reza Kaboli, Shahram Khazaei, Maghsoud Parviz

Publication date 21 October 2021

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2021.08.032

zbMATH Keywords

information theorygroup theoryaccess structurehomomorphic secret sharinggroup-characterizable random variable

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Group homomorphic encryption: characterizations, impossibility results, and applications
• Ideal homomorphic secret sharing schemes over cyclic groups
• On abelian and homomorphic secret sharing schemes
• On ideal homomorphic secret sharing schemes and their decomposition
• Homomorphic Encryptions of Sums of Groups
• A verifiable secret sharing scheme using non-abelian groups
• scientific article; zbMATH DE number 4039795
• Publicly verifiable secret sharing using non-abelian groups
• Foundations of homomorphic secret sharing
• Secret sharing using non-commutative groups and the shortlex order

Cites work

• scientific article; zbMATH DE number 6006357 (Why is no real title available?)
• scientific article; zbMATH DE number 4039795 (Why is no real title available?)
• scientific article; zbMATH DE number 503324 (Why is no real title available?)
• scientific article; zbMATH DE number 708831 (Why is no real title available?)
• scientific article; zbMATH DE number 1024000 (Why is no real title available?)
• scientific article; zbMATH DE number 1942426 (Why is no real title available?)
• scientific article; zbMATH DE number 6541785 (Why is no real title available?)
• Geometric secret sharing schemes and their duals
• Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian Group
• How to share a secret
• Ideal homomorphic secret sharing schemes over cyclic groups
• Improving the linear programming technique in the search for lower bounds in secret sharing
• Inequalities for Shannon entropy and Kolmogorov complexity
• Information Inequalities are Not Closed Under Polymatroid Duality
• Information Security and Cryptology
• Matroids Can Be Far from Ideal Secret Sharing
• Multi-linear secret-sharing schemes
• On Ingleton-Violating Finite Groups
• On a connection between information and group lattices
• On a relation between information inequalities and group theory
• On ideal homomorphic secret sharing schemes and their decomposition
• On the Power of Nonlinear Secret-Sharing
• On the information rate of perfect secret sharing schemes
• On the information ratio of non-perfect secret sharing schemes
• On the size of shares for secret sharing schemes
• Optimal linear secret sharing schemes for graph access structures on six participants
• Perfect secret sharing schemes on five participants
• Secret sharing and duality
• The size of a share must be large
• Unitary representations of groups, duals, and characters

Cited in

(4)

• scientific article; zbMATH DE number 826068 (Why is no real title available?)
• A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
• On ideal and weakly-ideal access structures
• scientific article; zbMATH DE number 1942426 (Why is no real title available?)

This page was built for publication: On group-characterizability of homomorphic secret sharing schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2235752)