## AI generates interpretation videos

AI extracts and analyses the key points of the paper to generate videos automatically

Go Generating

## AI Traceability

AI parses the academic lineage of this thesis

Generate MRT

# Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography

Combinatorics, Probability & Computing, no. 3 (2003): 285-299

Cited by: 56|Views14
EI
Full Text
Bibtex

Abstract

This paper shows that the largest possible contrast $C_{k,n}$ in a $k$-out-of-$n$ secret sharing scheme is approximately $4^{-(k-1)}$. More precisely, we show that $4^{-(k-1)} \leq C_{k,n} \leq 4^{-(k-1)}n^k/(n(n-1)\cdots(n-(k-1)))$. This implies that the largest possible contrast equals $4^{-(k-1)}$ in the limit when $n$ approaches infin...More

Code:

Data:

Author