Efficient VSS free of computational assumption

DOI10.1016/j.jpdc.2011.07.009zbMath1231.68090OpenAlexW1989389920MaRDI QIDQ663418

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

efficiencycomputational assumptionverifiable secret sharing (VSS)

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Publicly Verifiable Secret Sharing
• How to share a secret
• The Round Complexity of Verifiable Secret Sharing Revisited
• Improving the Round Complexity of VSS in Point-to-Point Networks
• Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience
• Coercion-Resistant Electronic Elections
• Public-Key Encryption with Efficient Amortized Updates
• How to Shuffle in Public
• Distributed Provers with Applications to Undeniable Signatures
• A practical and provably secure scheme for publicly verifiable secret sharing and its applications
• Non-interactive Proofs for Integer Multiplication
• Progress in Cryptology – Mycrypt 2005
• How to obtain full privacy in auctions
• A Direct Anonymous Attestation Scheme for Embedded Devices
• Theory of Cryptography