• 정보보호학회논문지
• /
• 제23권1호
• /
• pp.45-56
• /
• 2013

강한 지정된 검증자 서명은 서명자가 검증자를 지정하여 서명을 생성하며, 이렇게 생성된 서명은 지정된 검증자만이 서명자로부터 생성되었는지를 확신할 수 있다. 추가적으로, 지정된 검증자 이외의 어떤 누구도 이렇게 생성된 서명이 어떤 서명자에 의해 생성된 서명인지를 알아낼 수 없다는 특징을 가진다. 본 논문에서 우리는 사용자의 공개키가 ID라는 장점을 가지는 ID 기반의 강한 지정된 검증자 서명 기법을 제안한다. 우리가 제안하는 기법은 ID 기반의 강한 지정된 검증자 서명 분야에서 최초로 래티스에서 설계되었으며, 따라서 양자 컴퓨팅 환경에서도 안전하며 높은 연산 효율성을 가진다.

• ETRI Journal
• /
• 제34권2호
• /
• pp.235-244
• /
• 2012

An identity-based strong designated verifier signature scheme provides restricted verifiability only for a verifier designated by a signer and proper privacy for the signer. In this paper, we show that strong designated verifier signature schemes do not satisfy the self-unverifiability requirement in the sense that not only exposure of the verifier's secret key but also of the signer's secret key enables an attacker to verify signatures, which should have been the exclusive right of the verifier. We also present a generic method to construct a strong identity-based designated verifier signature scheme with self-unverifiability from identity-based key encapsulation and identity-based key sharing schemes. We prove that a scheme constructed from our method achieves unforgeability, non-transferability, and self-unverifiability if the two underlying components are secure. To show the advantage of our method, we present an example that outputs short signatures and we analyze its performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권11호
• /
• pp.5625-5641
• /
• 2017

Certificateless public key cryptography resolves the certificate management problem in traditional public key cryptography and the key escrow problem in identity-based cryptography. In recent years, some good results have been achieved in speeding up the computation of bilinear pairing. However, the computation cost of the pairing is much higher than that of the scalar multiplication over the elliptic curve group. Therefore, it is still significant to design cryptosystem without pairing operations. A multi-signer universal designated multi-verifier signature scheme allows a set of signers to cooperatively generate a public verifiable signature, the signature holder then can propose a new signature such that only the designated set of verifiers can verify it. Multi-signer universal designated multi-verifier signatures are suitable in many different practical applications such as electronic tenders, electronic voting and electronic auctions. In this paper, we propose a certificateless multi-signer universal designated multi-verifier signature scheme and prove the security in the random oracle model. Our scheme does not use pairing operation. To the best of our knowledge, our scheme is the first certificateless multi-signer universal designated multi-verifier signature scheme.