Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
- 14 April 2015
- book chapter
- Published by Springer Nature
- p. 313-336
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Optimal rate list decoding of folded algebraic-geometric codes over constant-sized alphabets2013
- Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite FieldLecture Notes in Computer Science, 2009
- Founding Cryptography on Oblivious Transfer – Efficiently2008
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors2008
- Secure Computation from Random Error Correcting CodesLecture Notes in Computer Science, 2007
- Linear-Time Encodable/Decodable Codes With Near-Optimal RateIEEE Transactions on Information Theory, 2005
- On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase2001
- Secret Sharing Made Short2001
- General Secure Multi-party Computation from any Linear Secret-Sharing Scheme2000
- How to share a secretCommunications of the ACM, 1979