Randomness in secret sharing and visual cryptography schemes

DOI10.1016/J.TCS.2003.12.018MaRDI QIDQ1826638zbMATH OpenOpenAlexFDO

Authors Annalisa De Bonis, Alfredo De Santis

Publication date 6 August 2004

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2003.12.018

zbMATH Keywords

CryptographyRandomnessSecret sharingVisual cryptography

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 1500549
• scientific article; zbMATH DE number 1588476
• Visual secret sharing by random grids revisited
• Sharing multiple secrets in visual cryptography
• Visual multiple-secret sharing by circle random grids
• Private visual share-homomorphic computation and randomness reduction in visual cryptography
• scientific article; zbMATH DE number 2076151
• Publication:4508385
• On secret sharing, randomness, and random-less reductions for secret sharing

Cites work

• scientific article; zbMATH DE number 1588476 (Why is no real title available?)
• scientific article; zbMATH DE number 4179276 (Why is no real title available?)
• scientific article; zbMATH DE number 4123667 (Why is no real title available?)
• scientific article; zbMATH DE number 1228785 (Why is no real title available?)
• scientific article; zbMATH DE number 553905 (Why is no real title available?)
• scientific article; zbMATH DE number 1088271 (Why is no real title available?)
• scientific article; zbMATH DE number 1088898 (Why is no real title available?)
• scientific article; zbMATH DE number 1500549 (Why is no real title available?)
• scientific article; zbMATH DE number 2102766 (Why is no real title available?)
• scientific article; zbMATH DE number 774344 (Why is no real title available?)
• Constructions and properties of \(k\) out of \(n\) visual secret sharing schemes
• Contrast Optimal Threshold Visual Cryptography Schemes
• Decomposition constructions for secret-sharing schemes
• Graph decompositions and secret sharing schemes
• How to share a secret
• Improved schemes for visual cryptography
• On the Size of Separating Systems and Families of Perfect Hash Functions
• On the contrast in visual cryptography schemes
• Randomness in distribution protocols
• Some improved bounds on the information rate of perfect secret sharing schemes
• Universally ideal secret-sharing schemes
• Visual cryptography for general access structures
• Zero error capacity under list decoding

Cited in

(8)

• Ideal contrast visual cryptography schemes with reversing
• Visual secret sharing by random grids revisited
• scientific article; zbMATH DE number 1588476 (Why is no real title available?)
• Private visual share-homomorphic computation and randomness reduction in visual cryptography
• ESSVCS: an enriched secret sharing visual cryptography
• Constructions and properties of \(k\) out of \(n\) visual secret sharing schemes
• Randomness recoverable secret sharing schemes
• A discussion on the relationship between probabilistic visual cryptography and random grid

This page was built for publication: Randomness in secret sharing and visual cryptography schemes

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