An ID-based verifiable encrypted signature scheme based on Hess's scheme

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3822 LNCS, Issue , 2005, Pages 42-52

  Gu, Chunxiang ^a   Zhu, Yuefei ^a  

^a INFORMATION ENGINEERING UNIVERSITY   (China)

Author keywords

Bilinear pairings; Fair exchange; ID based cryptography; Verifiably encrypted signatures

Indexed keywords

COMPUTER PRIVACY; DATA PRIVACY; ELECTRONIC COMMERCE; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; MATHEMATICAL MODELS; SECURITY OF DATA;

ENCRYPTED SIGNATURE; ID-BASED SIGNATURE; OPTIMISTIC FAIR EXCHANGE PROTOCOLS; SECURITY MODELS;

CRYPTOGRAPHY;

EID: 33744934238     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11599548_4     Document Type: Conference Paper

References (17)

1. Shamir, A.: Identity-based cryptosystems and signature schemes. In: Advances in Cryptology - CRYPTO'84. Lecture Notes in Computer Science, Vol. 196. Springer-Verlag, Berlin Heidelberg New York (1984) 47-53.
2. Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. In: Advances in Cryptology- CRYPTO 2001. Lecture Notes in Computer Science, Vol. 2139. Springer-Verlag, Berlin Heidelberg New York (2001) 213-229.
3. Hess, P.: Efficient identity based signature schemes based on pairings. In: Selected Areas in Cryptography 9th Annual International Workshop, SAC 2002. Lecture Notes in Computer Science, Vol. 2595. Springer-Verlag, Berlin Heidelberg New York (2003) 310-324.
4. Cha, J.C., Cheon, J.H.: An identity-based signature from gap Diffie-Hellman groups. In: Public Key Cryptography - PKC 2003. Lecture Notes in Computer Science, Vol. 2567. Springer-Verlag, Berlin Heidelberg New York (2003) 18-30.
5. Yi,X.: An identity-based signature scheme from the Weil pairing. In: IEEE Communications Letters 7(2)(2003), pp. 76-78.
6. Paterson, K.G.: ID-Based Signatures from Pairings on Elliptic Curves. In: Electron. Lett., Vol.38, No.18, 2002, pp.1025-1026.
7. Zhang, F., Kim, K.: Efficient ID-based blind signature and proxy signature from bilinear pairings. In: ACISP 03. Lecture Notes in Computer Science, Vol. 2727. Springer-Verlag, Berlin Heidelberg New York (2003) 312-323.
8. Gu, C.X., Zhu, Y.F.: Provable Security of ID-baaed Proxy Signature Schemes. In: Proc. 2005 International Conference on Computer Networks and Mobile Computing (ICCNMC'05). Lecture Notes in Computer Science, Vol. 3619. Springer-Verlag, Berlin Heidelberg New York (2005) 1277-1286.
9. Asokan, N., Shoup, V., Waidner, M.: Optimistic fair exchange of signatures. In: Advances in Cryptology - EUROCRYPT 1998. Lecture Notes in Computer Science vol. 1403. Springer-Verlag, Berlin Heidelberg New York (1998) 591-606.
10. Camenisch, J., Shoup, V.: Practical verifiable encryption and decryption of discrete logarithms. In: Advances in Cryptology - CRYPTO 2003, Lecture Notes in Computer Science vol. 2729. Springer-Verlag, Berlin Heidelberg New York (2003) 195-211.
11. Poupard, G., Stern, J.: Fair encryption of RSA keys. In: Proc. of Eurocrypt 2000, Lecture Notes in Computer Science vol. 1807. Springer-Verlag, Berlin Heidelberg New York (2000) 172-189.
12. Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and Verifiably Encrypted Signature from Bilinear Maps. In: Eurocrypt 2003. Lecture Notes in Computer Science, Vol. 2248. Springer-Verlag, Berlin Heidelberg New York (2003) 514-532.
13. Li, M.D., Yang, Y.X., Ma, C.G., Cai, M.C.: A scheme of fair exchange of signatures based on bilinear aggregate signatures. In: Journal of China Institute of Communications, 25(12):59-64. Dec. 2005.
14. Dodis, Y., Reyzin, L., Breaking and reparing optimistic fair exchange from PODC 2003. In: Proc. of the 2003 ACM Workshop on Digital Rights Management. ACM Press, New York (2003) 47-54.
15. Nenadic, A., Zhang, N., Cheetham, B., Goble, C.: An RSA-based Security Protocol for Certified E-goods Delivery. In: Proc. IEEE International Conference on Information Technology, ITCC 2004, Las Vegas, USA, IEEE Computer Society (2004), 22-28.
16. Ateniese, G.: Verifiable Encryption of Digital Signatures and Applications. In: ACM Transactions on Information and System Security, Vol. 7, No. 1, February 2004, Pages 1C20.
17. Sakai, Y., Sakurai, K.: Efficient Scalar Multiplications on Elliptic Curves without Repeated Doublings and Their Practical Performance. In: ACISP 2000. Lecture Notes in Computer Science, Vol. 1841. Springer-Verlag, Berlin Heidelberg New York (2000) 59-73.