出版社：University of Malaya * Faculty of Computer Science and Information Technology
摘要：Motivated by the need to have secure strong designate verifier signatures (SDVS) even in the presence of quantum computers, a postquantum latticebased SDVS scheme is proposed based on the hardness of the short integer solution problem (SIS) and the learning with errors problem (LWE). The proposed SDVS scheme utilizes the Bonsai trees and preimage sampleable function primitives to generate the designate verifier signature (DVS). In this construction, the un forgeability is based on the hardness of the SIS problem which is proven in the random oracle model and the nontransferability is based on the hardness of the LWE problem. As an application of the proposed SDVS scheme, we design a strong designate verifier ring signature scheme (SDVRS) which satisfies nontransferability. It is proven that the identity of the signer is unconditionally protected not only for any thirdparty but also for the designate verifier. Under the hardness of the SIS problem, the proposed SDVRS scheme is proven to be existentially unforgeable in the random oracle model.
关键词：Strong designate verifier signature; Strong designate verifier ring signature; Latticebased cryptography; Preimage sampleable function; Bonsai trees; Short integer solution problem.
Loading...
