Linear VSS and distributed commitments based on secret sharing and pairwise checks

DOI10.1007/3-540-45708-9_36MaRDI QIDQ4409143zbMATH OpenFDO

Authors Serge Fehr, Ueli M. Maurer

Publication date 30 June 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2442/24420565.htm

zbMATH Keywords

distributed-commitment schemessecret sharingverifiable secret sharing

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Computational verifiable secret sharing revisited
• General secure multi-party computation from any linear secret-sharing scheme
• Coding and Cryptography
• On verification in secret sharing
• Non-interactive and information-theoretic secure verifiable secret sharing

Cited in

(5)

• Secure multi-party computation made simple
• General secure multi-party computation from any linear secret-sharing scheme
• Coding and Cryptography
• VSS Made Simpler
• Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures

This page was built for publication: Linear VSS and distributed commitments based on secret sharing and pairwise checks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4409143)