ACM Home Page
Please provide us with feedback. Feedback
A verifiably encrypted signature scheme with strong unforgeability
Full text PdfPdf (135 KB)
Source ACM International Conference Proceeding Series; Vol. 304 archive
Proceedings of the 2nd international conference on Scalable information systems table of contents
Suzhou, China
SESSION: Security II table of contents
Article No. 66  
Year of Publication: 2007
ISBN:978-1-59593-757-5
Author
Jianhong Zhang  North China University of Technology, Beijing, China
Sponsors
SIGARCH: ACM Special Interest Group on Computer Architecture
SIGIR: ACM Special Interest Group on Information Retrieval
SIGMULTIMEDIA: ACM Special Interest Group on Multimedia
Publisher
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 52,   Citation Count: 0
Additional Information:

abstract   references   index terms  

Tools and Actions: Review this Article  

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
L. Boneh. D, Gentry. C and Shacham. H. Aggregate and Verifiably Encrypted Signatures from Bilinear Maps. Springer-Verlag, Berlin, Germany, 2003.
 
2
C. Gu and Y. Zhu. An identity-based verifiable encrypted signatures scheme based on hess scheme. In CICC 2005, LNCS 3822, pages 42--52. Springer -verlag, Nov 2005.
 
3
F. Zhang and R. Safavi-Naini. Efficient Verifiably Encrypted Signature and Partially Blind Signature from Bilinear Pairings. Springer-verlag, New York, 2003.
4
 
5
M. Gorantla and A. Saxena. Verifiably encrypted without random oracle. In ICDCIT 2005, LNCS 3816, pages 357--363. Springer -verlag, Nov 2005.
 
6
 
7
 
8
 
9
V. N. Asokan and V. Waidner. Optimistic fair exchange of digital signature (extended abstract). In Cryptology-Eurocrypt'98, LNCS 1403, pages 591--606. Springer -verlag, May 1998.