Efficient verifiable encryption (and fair exchange) of digital signatures
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Efficient Identity Based Signature Schemes Based on Pairings
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
An Identity-Based Signature from Gap Diffie-Hellman Groups
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
An ID-Based verifiable encrypted signature scheme based on hess’s scheme
CISC'05 Proceedings of the First SKLOIS conference on Information Security and Cryptology
Verifiably encrypted signature scheme without random oracles
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
| Hi-index | 0.00 |
A verifiably encrypted signature can convince the verifier that a given cipher-text is the encryption of a signature on a given message. It is often used as a building block to construct optimistic fair exchange. In this paper, first we define a stronger unforgeable model, then give a variant of Cha-Cheon's signature [8] and construct a verifiably encrypted signature based on this variant scheme. Finally, the scheme is proven to secure in random oracle model. In comparison with Gu et. al's verifiably encrypted signature scheme, our scheme is more efficient with respect to the size of signature and computation cost of signature.