| Summary: | 碩士 === 淡江大學 === 資訊工程學系碩士班 === 99 === For the anonymous applications, Chen et al. proposed a designated-verifier linkable ring signature scheme with “one-out-of-n” signer anonymity, where n is the number of ring members. In their scheme, the computational cost of each designated-verifier linkable ring signature is proportional to n. The maximum signer anonymity should be one-out-of-maximum anonymity that each one is hidden among all possible users, so n should be the total number of users. Due to the computational cost, Chen et al.’s scheme is an inefficient solution when n is very large. Moreover, the strong linkability also damages the signer anonymity. To efficiently provide one-out-of-maximum signer anonymity and remove the damage caused by strong linkability, our strong designated-verifier weak-linkable ring signature scheme is proposed. Due to the performance analysis, our scheme is more efficient than Chen et al.’s scheme, although our signer anonymity is stronger than Chen et al.’s signer anonymity. Moreover, the message may leak some sensitive identity data, this thesis also proposed a strong designated-verifier weak-linkable ring signcryption scheme to provide indistinguishable message confidentiality. Moreover, our security properties are proved in the random oracle model.
|
|---|
