Access Structure Hiding Verifiable Tensor Designs

Article Type

Research Article

Publication Title

Statistics and Applications

Abstract

The field of verifiable secret sharing schemes was introduced by Verheul et al. and has evolved over time, including well-known examples by Feldman and Pedersen. Stinson made advancements in combinatorial design-based secret sharing schemes in 2004. Desmedt et al. introduced the concept of frameproofness in 2021, while recent research by Sehrawat et al. in 2021 focuses on LWE-based access structure hiding verifiable secret sharing with malicious-majority settings. Furthermore, Roy et al. combined the concepts of reparable threshold schemes by Stinson et al. and frameproofness by Desmedt et al. in 2023, to develop extendable tensor designs built from balanced incomplete block designs, and also presented a frameproof version of their design. This paper explores ramp-type verifiable secret sharing schemes, and the application of hidden access structures in such cryptographic protocols. Inspired by Sehrawat et al.’s access structure hiding scheme, we develop an ϵ-almost access structure hiding scheme, which is verifiable as well as frameproof. We detail how the concept ϵ-almost hiding is important for incorporating ramp schemes, thus making a fundamental generalisation of this concept.

First Page

535

Last Page

554

Publication Date

1-1-2024

This document is currently not available here.

Share

COinS