شماره ركورد كنفرانس :
4329
عنوان مقاله :
Secret Sharing Scheme
پديدآورندگان :
Eslami Khadijeh saraeslami@gmail.com Department of Pure Mathematics, Faculty of Mathematical Sciences, University of Kashan, Kashan, I. R. Iran , Bahramian Mojtaba bahramianh@kashanu.ac.ir Department of Pure Mathematics, Faculty of Mathematical Sciences, University of Kashan, Kashan, I. R. Iran
تعداد صفحه :
5
كليدواژه :
Cryptography , Secret Sharing Scheme.
سال انتشار :
1395
عنوان كنفرانس :
نهمين كنفرانس ملي نظريه گروههاي ايراني
زبان مدرك :
انگليسي
چكيده فارسي :
Let t and n be positive integers, t ≤ n. A (t;n)- threshold scheme is a method of sharing a secret s among a set of n participants in such a way that any t participants can compute the value of the secret, but no group of t -1 or fewer can do so. In this paper we review some old secret sharing schemes and then we introduce a secret sharing scheme using groups.
كشور :
ايران
لينک به اين مدرک :
بازگشت