An Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves

نویسندگان

  • Khadijeh Eslami Department of Pure Mathematics, Faculty of Mathematical Sciences, University of Kashan, Kashan, Iran
  • Mojtaba Bahramian Department of Pure Mathematics, Faculty of Mathematical Sciences, Uuniversity of Kashan, Kashan, I. R. Iran 8731753153
چکیده مقاله:

‎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 logarithm problem (ECDLP) by using generalized Jacobian of elliptic curves‎. ‎The proposed scheme has all the benefits of Shao and Cao‎, ‎however‎, ‎our scheme no need to a secure channel‎. ‎Furthermore‎, ‎we exploit the techniques via elliptic curves to perform the scheme‎. ‎This can be very important‎ ‎because the hardness of discrete logarithm problem on elliptic curves increases security of the proposed scheme‎.  

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An efficient threshold verifiable multi-secret sharing

In 2004, C.-C. Yang, T.-Y. Chang and M.-S. Hwang proposed an efficient multi-secret sharing scheme based on two-variable one-way function and Shamir's secret sharing. In order to add the verifiable property into previous scheme, J. Shao and Z. Cao proposed an efficient (t,n) verifiable multi-secret sharing based on YCH [C.-C. Yang, T.-Y. Chang, M.-S. Hwang, A (t,n) multi-secret sharing scheme, ...

متن کامل

A Verifiable Threshold Quantum Secret Sharing Scheme Using Interpolation Method

Verifiable secret sharing schemes are important in cloud computing environments. Thus a key can be distributed over many servers by threshold secret sharing mechanism. The key is then reconstructed when needed. Secret sharing has also been suggested for sensor networks where the links are liable to be tapped by sending the data in shares which makes the task of the eavesdropper harder. The secu...

متن کامل

A practical verifiable multi-secret sharing scheme

C.-C. Yang, T.-Y. Chang, M.-S. Hwang [C.-C. Yang, T.-Y. Chang, M.-S. Hwang, A (t,n) multi-secret sharing scheme, Applied Mathematics and Computation 151 (2004) 483–490] proposed an efficient multi-secret sharing scheme based on a two-variable one-way function in 2004. But the scheme doesn't have the property of verification. A practical verifiable multi-secret sharing scheme, which is based on ...

متن کامل

Novel verifiable multi-secret sharing scheme using bilinear pairing

Secret sharing schemes as basic building blocks for many applications in distributed systems should be efficient and robust to any possible attacks. Based on bilinear pairing, this paper will propose a new (t, n) threshold verifiable multi-secret sharing scheme and a GGOC verifiable multi-secret sharing scheme that improve the security and minimizes the number of published values.

متن کامل

An improvement on the Lin-Wu (t, n) threshold verifiable multi-secret sharing scheme

Lin and Wu [IEE Proc. Comput. Digit. Tech. 146 (1999) 264] have proposed an efficient ðt; nÞ threshold verifiable multi-secret sharing (VMSS) scheme based on the factorization problem and the discrete logarithm modulo a large composite problem. In their scheme, the dealer can arbitrarily give any set of multiple secrets to be shared, and only one reusable secret shadow is to be kept by every pa...

متن کامل

Threshold Multi Secret Sharing Using Elliptic Curve and Pairing

Secret Sharing techniques are now the building blocks of several security protocols. A (t, n) threshold secret sharing scheme is one in which t or more participant can join together to retrieve the secret.Traditional single secret sharing schemes are modified and generalized to share multiple secrets.Use of elliptic curve and pairing in secret sharing is gaining more importance.In this paper we...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 4  شماره 2

صفحات  45- 55

تاریخ انتشار 2018-07-22

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023