• 沒有找到結果。

Cryptanalysis of Nonrepudiable Threshold Proxy Signature Schemes with Known Signers

N/A
N/A
Protected

Academic year: 2022

Share "Cryptanalysis of Nonrepudiable Threshold Proxy Signature Schemes with Known Signers"

Copied!
1
0
0

加載中.... (立即查看全文)

全文

(1)

題名: Cryptanalysis of Nonrepudiable Threshold Proxy Signature Schemes with

Known Signers

作者: Hwang;Shin-Jia and Chen;Chiu-Chin

貢獻者: Department of Computer Science and Information Engineering, TamKang University;Department of Information Management, Chaoyang

University of Technology Wufeng

關鍵詞: Digital signature;proxy signature;threshold proxy signature 日期: 2002-05-16

上傳時間: 2009-12-08T07:38:23Z 出版者: 亞洲大學

摘要: In 2000, Hwang et al. proposed a nonrepudiable threshold proxy

signature scheme to improve Sun’s scheme. In this paper, a new attack is proposed to show that, both in Hwang et al.’s and Sun’s schemes, the threshold proxy signatures can be forged by the cooperation of only one proxy signer and the original signer.

參考文獻

相關文件

In this paper, we provide new decidability and undecidability results for classes of linear hybrid systems, and we show that some algorithms for the analysis of timed automata can

6 《中論·觀因緣品》,《佛藏要籍選刊》第 9 冊,上海古籍出版社 1994 年版,第 1

Only the fractional exponent of a positive definite operator can be defined, so we need to take a minus sign in front of the ordinary Laplacian ∆.. One way to define (− ∆ ) − α 2

Write the following problem on the board: “What is the area of the largest rectangle that can be inscribed in a circle of radius 4?” Have one half of the class try to solve this

Teachers may consider the school’s aims and conditions or even the language environment to select the most appropriate approach according to students’ need and ability; or develop

Now, nearly all of the current flows through wire S since it has a much lower resistance than the light bulb. The light bulb does not glow because the current flowing through it

In this paper, we extended the entropy-like proximal algo- rithm proposed by Eggermont [12] for convex programming subject to nonnegative constraints and proposed a class of

In summary, the main contribution of this paper is to propose a new family of smoothing functions and correct a flaw in an algorithm studied in [13], which is used to guarantee