Randomness in secret sharing and visual cryptography schemes

DOI10.1016/j.tcs.2003.12.018zbMath1045.94016OpenAlexW2024970437MaRDI QIDQ1826638

Alfredo De Santis, Annalisa De Bonis

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

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

Related Items (2)

Ideal contrast visual cryptography schemes with reversing ⋮ Private Visual Share-Homomorphic Computation and Randomness Reduction in Visual Cryptography

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Randomness in distribution protocols
• Some improved bounds on the information rate of perfect secret sharing schemes
• Constructions and properties of \(k\) out of \(n\) visual secret sharing schemes
• On the contrast in visual cryptography schemes
• Graph decompositions and secret sharing schemes
• Visual cryptography for general access structures
• On the Size of Separating Systems and Families of Perfect Hash Functions
• How to share a secret
• Zero error capacity under list decoding
• Decomposition constructions for secret-sharing schemes
• Contrast Optimal Threshold Visual Cryptography Schemes
• Universally ideal secret-sharing schemes
• Improved schemes for visual cryptography

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