Efficient Pairing-Based Threshold Proxy Signature Scheme with Known Signers

摘要

Since threshold proxy signature has been proposed, all threshold proxy signature schemes are based on the discrete logarithm problems in the modular multiplicative group which has an element g with a large prime order. Nowadays this kind of threshold proxy signature schemes become more and more complex and time-consuming for security and specific requirement. In this paper, we propose a (bilinear) pairing-based threshold proxy signature scheme with known signers, analyze its security and check the following properties the proposed scheme has: non-repudiation, unforgeability, identifiability, distinguishability, verifiability, prevention of misuse of proxy signing right, etc. Moreover, we point out that the proposed scheme is of great efficiency by comparing it with Sun's and Hsu et al.'s scheme.%Nuo tada, kai slenkstinio igaliotojo parašas buvo pasiulytas, visos slenkstinio igaliotojo parašo schemos yra grindžiamos diskretaus logaritmo uždaviniais modulineje multiplikacineje grupeje, kuri turi g elementa su dideliu pirminiu skaičiumi. Dabar šio tipo parašo schemos tampa vis sudetingesnes ir, kad užtikrinus sauguma ir specifinius reikalavimus, sunaudojama daug laiko. Siame straipsnvje siulomas poravimu grista slenkstinio igaliotojo parašo schema su žinomais pasirašiusiaisiais, analizuojamos ir tikrinamos šitokios jos savvbes: neišsižadejimo, padirbinejimo, tapatumo nustatymo, atskiriamumo, patikrinamumo, apsisaugojimo nuo klaidingo parašo teisiu naudojimo ir kt. Be to, mes parodome, kad pasiulytoji schema yra efektyvesne nei ta, kuria pasiule Sun, Hsu ir kiti.