Almost Optimum t-Cheater Identifiable Secret Sharing Schemes

DOI10.1007/978-3-642-20465-4_17zbMath1281.94048OpenAlexW160353554MaRDI QIDQ3003388

Satoshi Obana

Publication date: 27 May 2011

Published in: Advances in Cryptology – EUROCRYPT 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20465-4_17

zbMATH Keywords

Reed-Solomon codesecret sharinguniversal hashcheater identification

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Ramp secret sharing with cheater identification in presence of rushing cheaters ⋮ Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters ⋮ Cheating identifiable secret sharing scheme using symmetric bivariate polynomial ⋮ Disjoint difference families and their applications ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification

This page was built for publication: Almost Optimum t-Cheater Identifiable Secret Sharing Schemes