On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
- 2 August 2001
- book chapter
- Published by Springer Nature
- p. 503-523
- https://doi.org/10.1007/3-540-44647-8_30
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On span programsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient Multiparty Protocols Using Circuit RandomizationPublished by Springer Nature ,2001
- Authentication Theory/Coding TheoryPublished by Springer Nature ,2000
- Authentication theory and hypothesis testingIEEE Transactions on Information Theory, 2000
- General Secure Multi-party Computation from any Linear Secret-Sharing SchemePublished by Springer Nature ,2000
- Secret sharing schemes with detection of cheaters for a general access structurePublished by Springer Nature ,1999
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptographyPublished by Association for Computing Machinery (ACM) ,1998
- Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)Published by Association for Computing Machinery (ACM) ,1997
- Completeness theorems for non-cryptographic fault-tolerant distributed computationPublished by Association for Computing Machinery (ACM) ,1988
- How to share a secretCommunications of the ACM, 1979