昨天晚上我终于完成了公钥密码学基于属性加密(Attribute-Based Encryption,ABE)中的一个核心模块:线性秘密分享方案(Linear Secret Sharing Scheme,LSSS)的实现。这个模块的实现是困扰我将近1年的一个问题,我相信也是国内(以及国外)众多公钥密码学研究者一直困扰的问题。所以,我相信此代码会给ABE的研究人员,特别是国内ABE...
We present a novel method for constructing linear secret sharing schemes (LSSS) from linear error correcting codes and linear universal hash functions in a blackbox way. The main advantage of this new construction is that the privacy property of the resulting secret sharing scheme essentially ...
Focusing on scalability, we propose a new form of access policy called block linear secret sharing scheme (BLSSS), a special linear secret sharing scheme(LSSS). BLSSS provides efficient updating interface which greatly improves the scalability of policy. More specifically, there are four advantages...
2 LSSS and Linear Codes Secret sharing schemes are key tools in the study of PSMT. Given a set of n participants P = {1, . . . , n}, the extensively studied threshold schemes (e.g., Shamir's scheme [20]) allow any subset of t + 1 participants to learn a secret s, but do ...
We present a novel method for constructing linear secret sharing schemes (LSSS) from linear error correcting codes and linear universal hash functions in a blackbox way. The main advantage of this new construction is that the privacy property of the resulting secret sharing scheme essentially ...
On codes, matroids and secure multi-party computation from linear secret sharing schemes - Cramer, Daza, et al. - 2005 () Citation Context ... properties. It is well known that a secret sharing scheme from a linear error-correcting code is an LSSS. We ...
strongly multiplicative linear secret sharing schemeStrongly multiplicative linear secret sharing schemes (LSSS) have been a powerful tool for constructing secure multi-party computation protocols. However, it remains open whether or not there exist efficient constructions of strongly multiplicative LSSS from...
In the form of a monotone Boolean formula monotone access structure, an access policy can be interpreted and a linear secret-sharing scheme (LSSS) can be implemented. In recent CP-ABE schemes, LSSS is a matrix whose row represent attributes and there exist a general algorithm which is ...
A notable variant of our RABIPFE scheme also yields the first efficient registered ABE (RABE) system for LSSS access policies in asymmetric prime-order bilinear groups. Conclusively, demonstrating feasibility, we formulated an RFE blueprint that supports general functionalities and an infinite user ...