Table 1 Comparisons between cheating detectable secret sharing schemes

Harn’s scheme[10]

|V|=|S|

Fail

Pieprzyk’s scheme[11]

|V|=|S|

1

\(\epsilon =\frac {1}{p}\)

Sergio’s scheme[12]

\(|V|=2\frac {|S|}{\epsilon }\)

k−1

\(\epsilon =\frac {2}{p}\)

Proposed scheme

\(|V|=\frac {|S|}{\epsilon }\)

k−1

\(\epsilon =\frac {1}{p}\)