Decomposition Constructions for Secret-Sharing Schemes

IEEE Transactions on Information Theory - United States
doi 10.1109/18.272461
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Related search

Universally Ideal Secret-Sharing Schemes

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
1994English

Secret Sharing and Visual Cryptography Schemes

IFIP Advances in Information and Communication Technology
Computer NetworksInformation SystemsManagementCommunications
2001English

New Results and Applications for Multi-Secret Sharing Schemes

Designs, Codes, and Cryptography
CombinatoricsApplied MathematicsComputer Science ApplicationsTheoretical Computer ScienceDiscrete Mathematics
2013English

Efficient Secret Sharing Schemes From Room Square

English

On the Optimization of Bipartite Secret Sharing Schemes

Designs, Codes, and Cryptography
CombinatoricsApplied MathematicsComputer Science ApplicationsTheoretical Computer ScienceDiscrete Mathematics
2011English

Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

New Construction Methods of Secret Sharing Schemes Based on Authorized Subsets

Journal of Information Processing
2013English

Bounds and Constructions for Metering Schemes

Communications in Information and Systems
2002English

Improved Upper Bounds for the Information Rates of the Secret Sharing Schemes Induced by the Vámos Matroid

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy