Anonymous secret sharing schemes

DOI10.1016/S0166-218X(97)89208-6MaRDI QIDQ1364776zbMATH OpenOpenAlexFDO

Authors Carlo Blundo, D. R. Stinson

Publication date 5 September 2000

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-218x(97)89208-6

zbMATH Keywords

lower boundssize of share setsthreshold scheme

Mathematics Subject Classification ID

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

Recommendations

• On the bound for anonymous secret sharing schemes
• Constructions for anonymous secret sharing schemes using combinatorial designs
• On the size of shares for secret sharing schemes
• scientific article; zbMATH DE number 176543

Cites work

• A Combinatorial Approach to Threshold Schemes
• An explication of secret sharing schemes
• Decomposition constructions for secret-sharing schemes
• Graph decompositions and secret sharing schemes
• How to share a secret
• scientific article; zbMATH DE number 4179276 (Why is no real title available?)
• scientific article; zbMATH DE number 4104855 (Why is no real title available?)
• scientific article; zbMATH DE number 68551 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1279036 (Why is no real title available?)
• scientific article; zbMATH DE number 553905 (Why is no real title available?)
• scientific article; zbMATH DE number 708803 (Why is no real title available?)
• scientific article; zbMATH DE number 708804 (Why is no real title available?)
• scientific article; zbMATH DE number 1024085 (Why is no real title available?)
• scientific article; zbMATH DE number 826065 (Why is no real title available?)
• scientific article; zbMATH DE number 867473 (Why is no real title available?)
• scientific article; zbMATH DE number 3392464 (Why is no real title available?)
• On resolvable designs
• On the classification of ideal secret sharing schemes
• On the size of shares for secret sharing schemes
• Some improved bounds on the information rate of perfect secret sharing schemes
• Strongly ideal secret sharing schemes

Cited in

(21)

• Providing anonymity in unconditionally secure secret sharing schemes
• Sharing one secret vs. sharing many secrets.
• On the bound for anonymous secret sharing schemes
• Anonymous membership broadcast schemes
• Partitions of the lines in \(\mathrm{PG}( 2 n - 1, s)\) into multifold spreads for \(s = 3, 4\)
• A verifiable threshold secret sharing scheme based on lattices
• Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
• An unequal probability scheme for improving anonymity in shared key operations
• Anonymity in shared symmetric key primitives
• On ASGS framework: general requirements and an example of implementation
• scientific article; zbMATH DE number 2102684 (Why is no real title available?)
• Anonymous Meeting in Networks
• Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures
• On-line secret sharing
• On the information rate of secret sharing schemes
• Self-orthogonal cellular automata
• Fully anonymous secret sharing
• A decomposition of the 2-design formed by the planes in AG(2n, 3)
• On cryptographic anonymity and unpredictability in secret sharing
• Constructions for anonymous secret sharing schemes using combinatorial designs
• New constructions of anonymous membership broadcasting schemes

This page was built for publication: Anonymous secret sharing schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1364776)