Verifiable secret sharing schemes based on non-homogeneous linear recursions and elliptic curves
نویسندگان
چکیده
Inthispaper,wepropose twosecureverifiablemulti-secret sharingschemes thatarebasedonnon-homogeneous linearrecursionsandelliptic curvesoverZN .Suchschemeshavesimpleconstructionandverificationphases.Moreover thesehavevarious techniques for the reconstruction phase. The security of the proposed schemes is based on the security of the ECRSA cryptosystem and the intractability of the ECDLP. 2007 Elsevier B.V. All rights reserved.
منابع مشابه
A Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملLinear Secret Sharing from Algebraic-Geometric Codes
It is well-known that the linear secret-sharing scheme (LSSS) can be constructed from linear error-correcting codes (Brickell [1], R.J. McEliece and D.V.Sarwate [2],Cramer, el.,[3]). The theory of linear codes from algebraic-geometric curves (algebraic-geometric (AG) codes or geometric Goppa code) has been well-developed since the work of V.Goppa and Tsfasman, Vladut, and Zink( see [17], [18] a...
متن کاملPublicly Verifiable Secret Sharing Schemes Using Bilinear Pairings
A non-interactive, simple and efficient publicly verifiable secret sharing (PVSS) is constructed based on the bilinear pairing on elliptic curves, which has all advantages of Schoenmakers’ PVSS in [15]. Moreover, in the scheme’s distribution of shares phase, only using bilinearity of bilinear paring, anybody can verify that the participants received whether correct shares without implementing i...
متن کاملNew efficient and practical verifiable multi-secret sharing schemes
In 2006, Zhao et al. proposed a practical verifiable multi-secret sharing based on Yang et al.’s and Feldman’s schemes. In this paper we propose two efficient, computationally secure ðt; nÞ, and verifiable multi-secret sharing schemes based on homogeneous linear recursion. The first scheme has the advantage of better performance, a new simple construction and various techniques for the reconstr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Communications
دوره 31 شماره
صفحات -
تاریخ انتشار 2008