{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:32:55Z","timestamp":1725496375287},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540770893"},{"type":"electronic","value":"9783540770909"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-77090-9_65","type":"book-chapter","created":{"date-parts":[[2007,11,26]],"date-time":"2007-11-26T12:19:26Z","timestamp":1196079566000},"page":"704-715","source":"Crossref","is-referenced-by-count":7,"title":["A Practical Identity-Based Signature Scheme from Bilinear Map"],"prefix":"10.1007","author":[{"given":"Zhu","family":"Wang","sequence":"first","affiliation":[]},{"given":"Huiyan","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"65_CR1","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"A. Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"key":"65_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/0-387-34799-2_16","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"L. Guillou","year":"1990","unstructured":"Guillou, L., Quisquater, J-J.: A \u201dParadoxical\u201d Identity-Based Signature Scheme Resulting From Zero-Knowledge. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 216\u2013231. Springer, Heidelberg (1990)"},{"key":"65_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/3-540-68339-9_34","volume-title":"Proc. of Eurocrypt\u2019s 1996","author":"M. Bellare","year":"1996","unstructured":"Bellare, M., Rogaway, P.: The Exact Security of Digital Signatures \u2013How to Sign with RSA and Rabin. In: Proc. of Eurocrypt\u2019s 1996. LNCS, pp. 399\u2013416. Springer, Heidelberg (1996)"},{"key":"65_CR4","doi-asserted-by":"crossref","unstructured":"Nyberg, K., Rueppel, R.A., New, A.: Signature Scheme Based on the DSA Giving Message Recovery. In: Proc. of the First ACM Conference on Computer and Communications Security (1993)","DOI":"10.1145\/168588.168595"},{"key":"65_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/BFb0053434","volume-title":"Proc. of Eurocrypt\u2019s 1994","author":"K. Nyberg","year":"1995","unstructured":"Nyberg, K., Rueppel, R.A.: Message Recovery for Signature Schemes Based on the Discrete LogarithmProb lem. In: Proc. of Eurocrypt\u2019s 1994. LNCS, pp. 182\u2013193. Springer, Heidelberg (1995)"},{"key":"65_CR6","first-page":"61","volume":"7","author":"K. Nyberg","year":"1996","unstructured":"Nyberg, K., Rueppel, R.A.: Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem. Designs, Codes and Cryptography\u00a07, 61\u201381 (1996)","journal-title":"Designs, Codes and Cryptography"},{"key":"65_CR7","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Proc. of Asiacrypt\u2019s 1996","author":"A. Miyaji","year":"1996","unstructured":"Miyaji, A.: A Message Recovery Signature Scheme Equivalent to DSA over Elliptic Curves. In: Proc. of Asiacrypt\u2019s 1996. LNCS, pp. 1\u201314. Springer, Heidelberg (1996)"},{"key":"65_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BFb0055741","volume-title":"Proc. of Crypto\u2019s 1998","author":"K. Ohta","year":"1998","unstructured":"Ohta, K., Okamoto, T.: On the Concrete Security Treatment of Signatures Derived from Identification. In: RobVis 2001. LNCS, pp. 354\u2013369. Springer, Heidelberg (1998)"},{"issue":"1","key":"65_CR9","first-page":"197","volume":"E84-A","author":"M. Abe","year":"2001","unstructured":"Abe, M., Okamoto, T.: A Signature Scheme with Message Recovery as Secure as Discrete Logarithm. IEICE Trans. Fundamentals\u00a0E84-A(1), 197\u2013204 (2001)","journal-title":"IEICE Trans. Fundamentals"},{"key":"65_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 514\u2013532. Springer, Heidelberg (2001)"},{"key":"65_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/978-3-540-24632-9_20","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"F. Zhang","year":"2004","unstructured":"Zhang, F., Safavi-Naini, R., Susilo, W.: An Efficient Signature Scheme from Bilinear Pairings and Its Applications. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol.\u00a02947, pp. 277\u2013290. Springer, Heidelberg (2004)"},{"key":"65_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/978-3-540-24676-3_4","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Short Signatures Without Random Oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 56\u201373. Springer, Heidelberg (2004)"},{"key":"65_CR13","series-title":"Lecture Notes in Computer Science","volume-title":"to appear in proceedings of SAC 2002.","author":"F. Hess","year":"2003","unstructured":"Hess, F.: Efficient identity based signature schemes based on pairings. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol.\u00a02595, Springer, Heidelberg (to appear)"},{"key":"65_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology -Crypto\u2019 1984","author":"A. Shamir","year":"1985","unstructured":"Shamir, A.: Identity Based Cryptosystems and Signature Schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, Springer, Heidelberg (1985)"},{"key":"65_CR15","series-title":"Lecture Notes in Computer Science","first-page":"47","volume-title":"Financial Cryptography and Data Security (FC\u201905)","author":"F. Zhang","year":"2005","unstructured":"Zhang, F., Susilo, W., Mu, Y.: Identity-based Partial Message Recovery Signatures (or How to Shorten ID-based Signatures). In: Patrick, A.S., Yung, M. (eds.) FC 2005. LNCS, vol.\u00a03570, pp. 47\u201359. Springer, Heidelberg (2005)"},{"key":"65_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/3-540-68339-9_33","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"D. Pointcheval","year":"1996","unstructured":"Pointcheval, D., Stern, J.: Security Proofs for Signature Schemes. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 387\u2013398. Springer, Heidelberg (1996)"},{"key":"65_CR17","series-title":"Lecture Notes in Computer Science","first-page":"18","volume-title":"PKC 2003","author":"J.C. Cha","year":"2003","unstructured":"Cha, J.C., Cheon, J.H.: An identity-based signature from gap Diffie-Hellman groups. In: PKC 2003. LNCS, vol.\u00a02567, pp. 18\u201330. Springer, Heidelberg (2003)"},{"key":"65_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/11593447_28","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"P.S.L.M. Barreto","year":"2005","unstructured":"Barreto, P.S.L.M., Libert, B., McCullagh, N., Quisquater, J.-J.: Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol.\u00a03788, pp. 515\u2013532. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Emerging Directions in Embedded and Ubiquitous Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77090-9_65","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:12:37Z","timestamp":1558264357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77090-9_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540770893","9783540770909"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77090-9_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}