On the dealer's randomness required in secret sharing schemes

DOI10.1023/A:1008242111272zbMath0884.94019OpenAlexW1723390624MaRDI QIDQ1358664

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

Publication date: 13 April 1998

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008242111272

zbMATH Keywords

boundsrandomnesssecret sharing scheme

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (7)

On secret sharing schemes ⋮ On ASGS framework: general requirements and an example of implementation ⋮ Message randomization and strong security in quantum stabilizer-based secret sharing for classical secrets ⋮ Rearrangements of access structures and their realizations in secret sharing schemes ⋮ Sharing multiple secrets: Models, schemes and analysis ⋮ ON THE DEALER'S RANDOMNESS REQUIRED IN PERFECT SECRET SHARING SCHEMES WITH ACCESS STRUCTURES OF CONSTANT RANK ⋮ Weighted decomposition construction for perfect secret sharing schemes

This page was built for publication: On the dealer's randomness required in secret sharing schemes