TY - GEN
T1 - Cheating immune secret sharing
AU - Zhang, Xian-Mo
AU - Pieprzyk, Josef
PY - 2001
Y1 - 2001
N2 - We consider secret sharing with binary shares. This model allows us to use the well developed theory of cryptographically strong boolean functions. We prove that for given secret sharing, the average cheating probability over all cheating and original vectors, i.e., ρ = 1/n · 2-n Σnc=1 Σα∈Vn ρc,α, satisfies ρ ≥ 1/2, and the equality holds ⇔ ρc,α satisfies ρc,α =1/2 for every cheating vector δc and every original vector α. In this case the secret sharing is said to be cheating immune. We further establish a relationship between cheating-immune secret sharing and cryptographic criteria of boolean functions. This enables us to construct cheating-immune secret sharing.
AB - We consider secret sharing with binary shares. This model allows us to use the well developed theory of cryptographically strong boolean functions. We prove that for given secret sharing, the average cheating probability over all cheating and original vectors, i.e., ρ = 1/n · 2-n Σnc=1 Σα∈Vn ρc,α, satisfies ρ ≥ 1/2, and the equality holds ⇔ ρc,α satisfies ρc,α =1/2 for every cheating vector δc and every original vector α. In this case the secret sharing is said to be cheating immune. We further establish a relationship between cheating-immune secret sharing and cryptographic criteria of boolean functions. This enables us to construct cheating-immune secret sharing.
UR - http://www.scopus.com/inward/record.url?scp=29244431868&partnerID=8YFLogxK
U2 - 10.1007/3-540-45600-7_16
DO - 10.1007/3-540-45600-7_16
M3 - Conference proceeding contribution
AN - SCOPUS:29244431868
SN - 3540428801
VL - 2229
T3 - Lecture notes in computer science
SP - 144
EP - 149
BT - Information and communications security
A2 - Qing, Sihan
A2 - Okamoto, Tatsuaki
A2 - Zhou, Jianying
PB - Springer, Springer Nature
CY - New York
T2 - International Conference on Information and Communications Security (3rd : 2001)
Y2 - 13 November 2001 through 16 November 2001
ER -