| dc.contributor | 國立政治大學資訊科學系 | en_US |
| dc.creator (作者) | 左瑞麟 | zh_TW |
| dc.date (日期) | 2009-04 | en_US |
| dc.date.accessioned | 27-May-2010 16:51:52 (UTC+8) | - |
| dc.date.available | 27-May-2010 16:51:52 (UTC+8) | - |
| dc.date.issued (上傳時間) | 27-May-2010 16:51:52 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/39857 | - |
| dc.description.abstract (摘要) | Short signature schemes are useful for systems where signatures are typed in by a human or for systems with low-bandwidth channels and/or low-computation power such as PDAs or cell phones. In this paper, a new short signature scheme is proposed. Our scheme is more efficient than Zhang et al.`s scheme and BLS scheme. Based on the hardness of k-CAA Problem, we provide a rigorous proof for our scheme in the random oracle model. © 2009 IEEE. | - |
| dc.language | zh-TW | en_US |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | ITNG 2009 - 6th International Conference on Information Technology: New Generations,417-422 | en_US |
| dc.subject (關鍵詞) | Applied cryptography; Cell phone; Computation power; Information security; Low-bandwidth; Random Oracle model; Short signatures; Cellular telephone systems; Cryptography; Information technology; Telecommunication equipment; Network security | - |
| dc.title (題名) | Efficient Short Signatures from Pairing | en_US |
| dc.type (資料類型) | conference | en |
| dc.identifier.doi (DOI) | 10.1109/ITNG.2009.176 | - |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1109/ITNG.2009.176 | - |
