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

SpringerBriefs in information security and cryptography

Adversary Models for Secret Sharing Schemes

Stephan Krenn, Thomas Lorünser

Published Jan 1, 2023• 0 citations
Publisher
DOI
10.1007/978-3-031-28161-7_3

Related papers

Robust Secret Sharing Schemes Against Local Adversaries

Allison Bishop, Valerio Pastro

Lecture notes in computer science•Jan 1, 2016•15 citations

Hierarchical Secret Sharing Schemes Secure Against Rushing Adversary: Cheater Identification and Robustness

Partha Sarathi Roy, Sabyasachi Dutta, Kirill Morozov +4 more

Lecture notes in computer science•Jan 1, 2018•9 citations

Two Quantum Secret Sharing Schemes with Adversary Structure

Tingting Wu, Shixin Zhu, Fulin Li +1 more

International Journal of Theoretical Physics•Jul 26, 2022•4 citations

Robust Secret Sharing with Almost Optimal Share Size and Security Against Rushing Adversaries

Serge Fehr, Chen Yuan

Lecture notes in computer science•Jan 1, 2020•12 citations

Multiparty Computations Information-Theoretically Secure Against an Adaptive Adversary

Stefan Dziembowski

In this thesis we study a problem of doing Verifiable Secret Sharing (VSS) and Multiparty Computations (MPC) in a model where private channels between the players and a broadcast channel is available. The adversary is active, adaptive and has an unbounded computing power. The thesis is based on two papers [CDD00, CDD 99]. In [CDD00] we assume that the adversary can corrupt any set from a given adversary structure. In this setting we study a problem of doing efficient VSS and MPC given an access to a secret sharing scheme (SS). For all adversary structures where VSS is possible at all, we show that, up to a polynomial time black-box reduction, the complexity of adaptively secure VSS is the same as that of ordinary secret sharing (SS), where security is only required against a passive, static adversary. Previously, such a connection was only known for linear secret sharing and VSS schemes. We then show

•Jan 1, 2002•0 citations

On the classification of ideal secret sharing schemes

Ernest F. Brickell, Daniel M. Davenport

Journal of Cryptology•Jan 1, 1991•291 citations
In this thesis we study a problem of doing Verifiable Secret Sharing (VSS) and Multiparty Computations (MPC) in a model where private channels between the players and a broadcast channel is available. The adversary is active, adaptive and has an unbounded computing power. The thesis is based on two papers [CDD00, CDD 99]. In [CDD00] we assume that the adversary can corrupt any set from a given adversary structure. In this setting we study a problem of doing efficient VSS and MPC given an access to a secret sharing scheme (SS). For all adversary structures where VSS is possible at all, we show that, up to a polynomial time black-box reduction, the complexity of adaptively secure VSS is the same as that of ordinary secret sharing (SS), where security is only required against a passive, static adversary. Previously, such a connection was only known for linear secret sharing and VSS schemes. We then show