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

Lecture notes in computer science

Multi-Secret Sharing Schemes

Carlo Blundo, Alfredo De Santis, Giovanni Di Crescenzo, A. Giorgio Gaggia, Ugo Vaccaro

Published Jan 1, 1994• 104 citations
Publisher
DOI
10.1007/3-540-48658-5_17

Related papers

Multi-linear Secret-Sharing Schemes

Amos Beimel, Aner Ben-Efraim, Carles Padró +1 more

Lecture notes in computer science•Jan 1, 2014•36 citations

Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes

Zhifang Zhang, Mulan Liu, Liangliang Xiao

Lecture notes in computer science•Jan 1, 2005•4 citations

Computationally secure group ring based multi-stage secret sharing schemes

Yogesh Kumar Gupta, Gaurav Mittal, S K Pal

Sadhana•Sep 7, 2026•0 citations

Non-interactive verifiable LWE-based multi secret sharing scheme

Niloofar Kiamari, Massoud Hadian Dehkordi, Samaneh Mashhadi

Multimedia Tools and Applications•Jul 4, 2022•7 citations

On secret sharing schemes

Carlo Blundo, Alfredo De Santis, Ugo Vaccaro

Information Processing Letters•Jan 1, 1998•44 citations

The Existence of Multi-secret Sharing Schemes Based on Random Walks on Graphs

Xiaomin Zha, Yongxuan Sang, Jiwen Zen +1 more

A multi-secret sharing scheme is the extension of a secret sharing scheme to the case in which there are many secrets need to be shared, and each secret may with different qualified subsets of participants. We study multi-secret sharing schemes based on random walks on graphs. Since many problems of secret sharing can be seen as having structure of the graphs. Different access structures corresponding to different walks for a graph with n vertices can be defined. So considering multi-secret sharing scheme based on random walks on graphs is meaningful. We prove that there exists multi-secret sharing schemes based on random walks on graphs by studying monotone span programs computing monotone Boolean function and secret sharing schemes realizing these classes of access structure.

World Congress on Software Engineering (WCSE)•Jan 1, 2009•0 citations
A multi-secret sharing scheme is the extension of a secret sharing scheme to the case in which there are many secrets need to be shared, and each secret may with different qualified subsets of participants. We study multi-secret sharing schemes based on random walks on graphs. Since many problems of secret sharing can be seen as having structure of the graphs. Different access structures corresponding to different walks for a graph with n vertices can be defined. So considering multi-secret sharing scheme based on random walks on graphs is meaningful. We prove that there exists multi-secret sharing schemes based on random walks on graphs by studying monotone span programs computing monotone Boolean function and secret sharing schemes realizing these classes of access structure.