作者: Akshayaram Srinivasan , Prashant Nalini Vasudevan
DOI: 10.1007/978-3-030-26951-7_17
关键词: Set (abstract data type) 、 Bounded function 、 Discrete mathematics 、 Binary logarithm 、 Secrecy 、 Leakage (electronics) 、 Computer science 、 Secret sharing
摘要: A secret sharing scheme allows a dealer to share among set of n parties such that any authorized subset the can recover secret, while unauthorized learns no information about secret. leakage-resilient (introduced in independent works by Goyal and Kumar, STOC ’18 Benhamouda, Degwekar, Ishai Rabin, CRYPTO ’18) additionally requires secrecy hold against every even if they obtain some bounded leakage from other share. The is said be local it computed independently for each So far, only known constructions resilient schemes are threshold access structures very low (O(1)) or high (\(n -o(\log n)\)) thresholds.