为了解决基于线性码的秘密共享在区块链数据隐私保护中容易受到Tompa-Woll攻击以及子秘密只能单次使用的问题,本文提出了一种基于LCD码的可验证多秘密共享方案。该方案旨在应对不诚实用户通过提供错误子秘密而导致诚实用户无法获取秘密的情况。考虑到秘密重构函数的线性特性和其易受Tompa-Woll攻击的特点,本文采用双变量单向函数进行验证,从而有效抵御不诚实用户的恶意行为,并实现子秘密的多次使用。与其他方案的比较结果表明,该方案在性能上优于现有解决方案。To address the vulnerability of linear code-based secret sharing in blockchain data privacy protection-specifically its susceptibility to Tompa-Woll attacks and the single-use limitation of sub-secrets-this paper proposes a verifiable multi-secret sharing scheme based on LCD codes. The scheme targets the issue where dishonest users can cheat by submitting incorrect sub-secrets, preventing honest users from successfully reconstructing the secret. Given the linear nature of the secret creconstruction function and its vulnerability to Tompa-Woll attacks, this paper utilizes a two-variable one-way function for verification, effectively countering malicious behavior from dishonest users. Additionally, the use of the two-variable one-way function enables the reuse of sub-secrets. Comparative results show that this scheme outperforms existing solutions in terms of performance.
针对医院间共享数据的实际需求,本文基于中国剩余定理结合RSA公钥加密分别设计了指定一个参与者和指定多个参与者的门限秘密共享方案,以实现医疗数据的安全共享。在秘密分发阶段,指定参与者可自主选择秘密份额,且无需在分发者与参与者之间建立安全信道;在秘密重构阶段,必须有特定的参与者参与才能成功恢复原始秘密。对方案的安全性与性能分析表明,所提出方案在效率和安全性上均优于现有方案。In order to meet the practical needs of sharing data between hospitals, this paper proposes a threshold secret sharing scheme for designating one participant and designating multiple participants based on the Chinese remainder theorem combined with RSA public key encryption, so as to realize the secure sharing of medical data. In the secret distribution phase, the designated participants can choose their own secret shares, and there is no need to establish a secure channel between the distributor and the participants;in the secret reconstruction phase, a designated participant must be involved in order to successfully recover the original secret. The analysis of the security and performance of the scheme shows that the proposed scheme is better than the existing scheme in terms of efficiency and security.
为了提高门限签名方案的计算效率,结合Gennaro等(GENNARO R,JAREAKI S,KRAWCZYK H,et al.Secure distributed key generation for discrete-log based cryptosystem.Journal of Cryptology,2007,20(1):51-83)的分布式密钥生成协议和谷科等(谷科,贾维嘉,姜春林.高效安全的基于身份的签名方案.软件学报,2011,22(6):1350-1360)的签名方案,在标准模型下利用双线性对技术构造了一个新的门限签名方案。所提方案没有可信的密钥份额分发中心,每个参与者都可以验证一些必要信息,从而避免了恶意私钥生成中心攻击和公钥份额代换攻击。通过与现有类似的两个门限签名方案对比表明,所提方案减少了双线性对运算,提高了计算效率。
