Publicly Verifiable Secret Sharing Using Non-Abelian Groups

2014/03/14 by Delaram Kahrobaei, Kahrobaei, Delaram, Elizabeth Vidaurre +1
Computer Science · Mathematics · Social Sciences · #Access Control and Trust #Cooperative Communication and Network Coding #Cryptography and Data Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #FOS: Mathematics #Group Theory (math.GR) #cs.CR #math.GR

paper · pdf · doi:10.48550/arxiv.1403.3661

openalex publication_date 2014/03/14 · arxiv created 2014/08/27 · arxiv updated 2014/08/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In his paper Stadler develops techniques for improving the security of existing secret sharing protocols by allowing to check whether the secret shares given out by the dealer are valid. In particular, the secret sharing is executed over abelian groups. In this paper we develop similar methods over non-abelian groups.

Related

• Secret Sharing using Non-Commutative Groups and the Shortlex Order
• A Secret Sharing Scheme Based on Group Presentations and the Word Problem
• Publicly Verifiable Secret Sharing: Generic Constructions and Lattice-Based Instantiations in the Standard Model
• A Novel Approach for Verifiable Secret Sharing by using a One Way Hash Function
• False shares in verifiable secret sharing with finite field commitments