Identity-based aggregate and verifiably encrypted signatures from bilinear pairing

Lecture Notes in Computer Science

Volumn 3483, Issue IV, 2005, Pages 1046-1054

  Cheng, Xiangguo ^a   Liu, Jingmei ^a   Wang, Xinmei ^a  

^a XIDIAN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SCIENCE; CRYPTOGRAPHY;

AGGREGATE SIGNATURES; BILINEAR PAIRING; VERIFIABLY ENCRYPTED SIGNATURES;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 24944433217     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11424925_109     Document Type: Conference Paper

References (13)

1. Shamir, A.: Identity-Based Cryptosystems and Signature Schemes. In: Advance in cryptology-Crypto'84, Lecture Notes in Computer Science, Vol. 196, Springer-Verlag, Berlin Heidelberg New York (1987), 47-53.
2. Boneh, D., Franklin, M.: Identity Based Encryption from the Weil Pairing. In: Advance in cryptology-Crypto'01, Lecture Notes in Computer Science, Vol. 2139, Springer-Verlag, Berlin Heidelberg New York (2001), 213-229.
3. Cha, J.C., Cheon, J.H.: An Identity-Based Signature from Gap Diffie-Hellman Groups. In: Advance in Public Key Cryptography-PKC 2003, Lecture Notes in Computer Science, Vol. 2139, Springer-Verlag, Berlin Heidelberg New York (2003), 18-30.
4. Yi, X.: An Identity-Based Signature Scheme from the Weil Pairing. IEEE Communications Letters, Vol. 7(2), 2003, 76-78.
5. Hess, F.: Efficient Identity Based Signature Schemes Based on Pairings. In: Proceeding of Select Areas in Cryptography, SAC 2002, Springer-Verlag (2003), 310-324.
6. Boneh, D., Lynn, B., Shacham, H.: Short Signatures from the Weil Pairing. In: Advance in cryptology-Asiacrypt'01, Lecture Notes in Computer Science, Vol. 2248, Springer-Verlag, Berlin Heidelberg New York (2001), 514-532.
7. Zhang, F., Safavi, R., Susilo, W.: An Efficient Signature Scheme from Bilinear Pairings and Its Applications. In: Advance in Public Key Cryptography-PKC 2004, Lecture Notes in Computer Science, Vol. 2947, Springer-Verlag, Berlin Heidelberg New York (2004), 227-290.
8. Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and Verifiably Encrypted Signatures from Bilinear Maps. In: Advance in cryptology-Eurocrypt'03, Lecture Notes in Computer Science, Vol. 2656, Springer-Verlag, Berlin Heidelberg New York (2003), 272-293.
9. Asokan, N., Shoup, V., Waidner, M.: Optimistic Fair Exchange of Digital Signatures. IEEE J. Selected Areas in Comm., Vol. 18(4), 2000, 593-610.
10. Bao, F., Deng, R., Mao, W.: Efficient and Practical Fair Exchange Protocols with Offline TTP. In: Proceedings of IEEE Symposium on Security and Privacy, 1998, 77-85.
11. Poupard, G., Stern, J.: Fair Encryption of RSA Keys. In: Advance in cryptology-Eurocrypt'00, Lecture Notes in Computer Science, Vol. 1807, Springer-Verlag, Berlin Heidelberg New York (2000), 172-189.
12. Zhang, F., Safavi, R., Susilo, W.: Efficient Verifiably Encrypted Signature and Partially Blind Signature from Bilinear Pairings. In: Indocrypt'03, Lecture Notes in Computer Science, Vol. 2904, Springer-Verlag, Berlin Heidelberg New York (2003), 191-204.
13. Pointcheval, D., Stern, J.: Security Arguments for Digital Signatures and Blind Signatures. J. Cryptology, Vol. 13(3), 2000, 361-396.