Strong \((n, t, n)\) verifiable secret sharing scheme

DOI10.1016/j.ins.2010.04.016zbMath1285.94067OpenAlexW2102371935MaRDI QIDQ991242

Changlu Lin, Lein Harn

Publication date: 2 September 2010

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2010.04.016

zbMATH Keywords

secret sharingverifiable secret sharing\(t\)-consistencymultiple dealers

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (12)

Memory leakage-resilient secret sharing schemes ⋮ ZCZ -- achieving \(n\)-bit SPRP security with a minimal number of tweakable-block-cipher calls ⋮ A non-interactive \((t, n)\)-publicly verifiable multi-secret sharing scheme ⋮ Constructing ideal secret sharing schemes based on Chinese remainder theorem ⋮ New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures ⋮ Secure multiparty computation of solid geometric problems and their applications ⋮ Attacks to some verifiable multi-secret sharing schemes and two improved schemes ⋮ Two verifiable multi secret sharing schemes based on nonhomogeneous linear recursion and LFSR public-key cryptosystem ⋮ An ideal multi-secret sharing scheme based on MSP ⋮ Tightly coupled multi-group threshold secret sharing based on Chinese remainder theorem ⋮ A novel secret sharing scheme based on minimal linear codes ⋮ An Ideal and Perfect (t, n) Multi-secret Sharing Scheme Based on Finite Geometry

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improvement on the Lin-Wu \((t,n)\) threshold verifiable multi-secret sharing scheme
• Preface (to the special issue on general secure multiparty computation)
• New efficient and practical verifiable multi-secret sharing schemes
• Secure multi-party computation made simple
• Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
• A new efficient \((t,n)\) verifiable multi-secret sharing (VMSS) based on YCH scheme
• How to share a secret
• The Round Complexity of Verifiable Secret Sharing Revisited
• Improving the Round Complexity of VSS in Point-to-Point Networks
• Remarks on the multiple assignment secret sharing scheme
• Theory of Cryptography

This page was built for publication: Strong \((n, t, n)\) verifiable secret sharing scheme