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

On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing

Divesh Aggarwal, Eldon Chung, Maciej Obremski, João Ribeiro

Published Jan 1, 2022• 1 citation
Publisher
DOI
10.1007/978-3-031-22318-1_12

Related papers

Random Robust Secret Sharing with Perfect Privacy and its Applications

Mohammad Hassan Ameri, Jeremiah Blocki

•Sep 16, 2026•0 citations

On the Dealer's Randomness Required in Secret Sharing Schemes

Carlo Blundo, A. Giorgio Gaggia, Douglas R. Stinson

Designs Codes and Cryptography•Jul 1, 1997•26 citations

On the dealer's randomness required in secret sharing schemes

Carlo Blundo, A. Giorgio Gaggia, Douglas R. Stinson

Lecture notes in computer science•Jan 1, 1995•14 citations

On cryptographic anonymity and unpredictability in secret sharing

Anat Paskin-Cherniavsky, Ruxandra F. Olimid

Information Processing Letters•May 10, 2020•4 citations

SHARK: Actively Secure Inference Using Function Secret Sharing

Kanav Gupta, Nishanth Chandran, Divya Gupta +2 more

We consider the problem of actively secure two-party machine-learning inference in the preprocessing model, where the parties obtain (input-independent) correlated randomness in an offline phase that they can then use to run an efficient protocol in the (input-dependent) online phase. In this setting, the state-of-the-art is the work of Escudero et al. (Crypto 2020); unfortunately, that protocol requires a large amount of correlated randomness, extensive communication, and many rounds of interaction, which leads to poor performance. In this work, we show protocols for this setting based on function secret sharing (FSS) that beat the state-of-the-art in all parameters: they use less correlated randomness and fewer rounds, and require lower communication and computation. We achieve this in part by allowing for a mix of boolean and arithmetic values in FSS-based protocols (something not done in prior work), as well as by relying on “interactive FSS;’ a generalization of FSS we introduce. To demonstrate the effectiveness of our approach we build SHARK-the first FSS-based system for actively secure inference-which outperforms the state-of-the-art by up to 2300×.

IEEE Symposium on Security and Privacy (S&P)•May 12, 2025•7 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
We consider the problem of actively secure two-party machine-learning inference in the preprocessing model, where the parties obtain (input-independent) correlated randomness in an offline phase that they can then use to run an efficient protocol in the (input-dependent) online phase. In this setting, the state-of-the-art is the work of Escudero et al. (Crypto 2020); unfortunately, that protocol requires a large amount of correlated randomness, extensive communication, and many rounds of interaction, which leads to poor performance. In this work, we show protocols for this setting based on function secret sharing (FSS) that beat the state-of-the-art in all parameters: they use less correlated randomness and fewer rounds, and require lower communication and computation. We achieve this in part by allowing for a mix of boolean and arithmetic values in FSS-based protocols (something not done in prior work), as well as by relying on “interactive FSS;’ a generalization of FSS we introduce. To demonstrate the effectiveness of our approach we build SHARK-the first FSS-based system for actively secure inference-which outperforms the state-of-the-art by up to 2300×.
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.