ID-based Multi-signer Universal Designated Multi-verifier Signature Based on Discrete Logarithm
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. In this paper, we propose an ID-bas...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | บทความวารสาร |
| Language: | English |
| Published: |
Science Faculty of Chiang Mai University
2019
|
| Online Access: | http://it.science.cmu.ac.th/ejournal/dl.php?journal_id=8778 http://cmuir.cmu.ac.th/jspui/handle/6653943832/64050 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| Language: | English |
| Summary: | 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. In this paper, we propose an ID-based multi-signer universal designated multi-verifier signature scheme and prove the security in the random oracle model. In recent years, some good results have been achieved in speeding up the computation of bilinear pairings. However, the computation cost of the pairings is much higher than that of the scalar multiplication in the elliptic curve group. Therefore, it is still significant to design cryptosystem without pairings operation. Taken into the computational costs for signing and verifying, our scheme does not need pairing operations and it is more efficient than previous ones. |
|---|