A new \((t,n)\) multi-secret sharing scheme based on Shamir's secret sharing

DOI10.1016/j.amc.2004.06.120zbMath1089.94029OpenAlexW2079631812MaRDI QIDQ2570757

Yu-Min Wang, Liaojun Pang

Publication date: 28 October 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2004.06.120

zbMATH Keywords

Secret sharingThreshold schemeMulti-secret sharing

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (14)

An efficient and secure multi-secret sharing scheme with general access structures ⋮ Memory leakage-resilient secret sharing schemes ⋮ ZCZ -- achieving \(n\)-bit SPRP security with a minimal number of tweakable-block-cipher calls ⋮ Source-location privacy full protection in wireless sensor networks ⋮ Verifiable multi-secret sharing based on LFSR sequences ⋮ Constructing ideal secret sharing schemes based on Chinese remainder theorem ⋮ RATIONAL MULTI-SECRET SHARING SCHEME IN STANDARD POINT-TO-POINT COMMUNICATION NETWORKS ⋮ Efficient verifiable multi-secret sharing scheme based on hash function ⋮ 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 ⋮ New efficient and practical verifiable multi-secret sharing schemes ⋮ An ideal multi-secret sharing scheme based on MSP ⋮ Unnamed Item ⋮ An Ideal and Perfect (t, n) Multi-secret Sharing Scheme Based on Finite Geometry

Cites Work

• Unnamed Item
• A \((t,n)\) multi-secret sharing scheme
• How to share a secret
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A method for obtaining digital signatures and public-key cryptosystems

This page was built for publication: A new \((t,n)\) multi-secret sharing scheme based on Shamir's secret sharing