期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
A proactive secret sharing scheme based on Chinese remainder theorem
1
作者 Keju MENG fuyou miao +3 位作者 Yu NING Wenchao HUANG Yan XIONG Chin-Chen CHANG 《Frontiers of Computer Science》 SCIE EI CSCD 2021年第2期133-142,共10页
If an adversary tries to obtain a secret s in a(t,n)threshold secret sharing(SS)scheme,it has to capture no less than t shares instead of the secret s directly.However,if a shareholder keeps a fixed share for a long t... If an adversary tries to obtain a secret s in a(t,n)threshold secret sharing(SS)scheme,it has to capture no less than t shares instead of the secret s directly.However,if a shareholder keeps a fixed share for a long time,an adversary may have chances to filch some shareholders’shares.In a proactive secret sharing(PSS)scheme,shareholders are supposed to refresh shares at fixed period without changing the secret.In this way,an adversary can recover the secret if and only if it captures at least t shares during a period rather than any time,and thus PSS provides enhanced protection to long-lived secrets.The existing PSS schemes are almost based on linear SS but no Chinese Remainder Theorem(CRT)-based PSS scheme was proposed.This paper proposes a PSS scheme based on CRT for integer ring to analyze the reason why traditional CRT-based SS is not suitable to design PSS schemes.Then,an ideal PSS scheme based on CRT for polynomial ring is also proposed.The scheme utilizes isomorphism of CRT to implement efficient share refreshing. 展开更多
关键词 proactive secret sharing Chinese remainder theorem polynomial ring integer ring ISOMORPHISM
原文传递
A simple construction of CRT-based ideal secret sharing scheme and its security extension based on common factor
2
作者 Lei WU fuyou miao +1 位作者 Keju MENG Xu WANG 《Frontiers of Computer Science》 SCIE EI CSCD 2022年第1期155-163,共9页
Secret sharing(SS)is part of the essential techniques in cryptography but still faces many challenges in efficiency and security.Currently,SS schemes based on the Chinese Remainder Theorem(CRT)are either low in the in... Secret sharing(SS)is part of the essential techniques in cryptography but still faces many challenges in efficiency and security.Currently,SS schemes based on the Chinese Remainder Theorem(CRT)are either low in the information rate or complicated in construction.To solve the above problems,1)a simple construction of an ideal(t,n)-SS scheme is proposed based on CRT for a polynomial ring.Compared with Ning’s scheme,it is much more efficient in generating n pairwise coprime modular polynomials during the scheme construction phase.Moreover,Shamir’s scheme is also a special case of our scheme.To further improve the security,2)a common-factor-based(t,n)-SS scheme is proposed in which all shareholders share a common polynomial factor.It enables both the verification of received shares and the establishment of a secure channel among shareholders during the reconstruction phase.As a result,the scheme is resistant to eavesdropping and modification attacks by outside adversaries. 展开更多
关键词 ideal secret sharing Chinese remainder theorem coprime polynomial generation common factor
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部