Efficient VSS free of computational assumption

DOI10.1016/J.JPDC.2011.07.009MaRDI QIDQ663418zbMATH OpenOpenAlexFDO

Authors Kun Peng

Publication date 14 February 2012

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2011.07.009

zbMATH Keywords

computational assumptionefficiencyverifiable secret sharing (VSS)

Mathematics Subject Classification ID

Distributed systems (68M14) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 176544
• Efficient verifiable multi-secret sharing scheme based on hash function
• Computational verifiable secret sharing revisited
• Asynchronous computational VSS with reduced communication complexity
• Theory of Cryptography

Cites work

• A Direct Anonymous Attestation Scheme for Embedded Devices
• A practical and provably secure scheme for publicly verifiable secret sharing and its applications
• Coercion-resistant electronic elections
• Communication efficient perfectly secure VSS and MPC in asynchronous networks with optimal resilience
• Distributed Provers with Applications to Undeniable Signatures
• How to obtain full privacy in auctions
• How to share a secret
• How to Shuffle in Public
• scientific article; zbMATH DE number 1618056 (Why is no real title available?)
• scientific article; zbMATH DE number 1676641 (Why is no real title available?)
• scientific article; zbMATH DE number 4039795 (Why is no real title available?)
• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 1418293 (Why is no real title available?)
• scientific article; zbMATH DE number 1424186 (Why is no real title available?)
• Improving the Round Complexity of VSS in Point-to-Point Networks
• Non-interactive Proofs for Integer Multiplication
• Progress in Cryptology – Mycrypt 2005
• Public-Key Encryption with Efficient Amortized Updates
• Publicly verifiable secret sharing
• The Round Complexity of Verifiable Secret Sharing Revisited
• Theory of Cryptography

Cited in

(2)

• scientific article; zbMATH DE number 176544 (Why is no real title available?)
• VSS Made Simpler

This page was built for publication: Efficient VSS free of computational assumption

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