鑑於網路與密碼技術的成熟，許多商業機制的研究已經受到重視，如何將國軍採購 作業導入安全的系統運作，減少弊端，値得研究。在過去的數十年中，有許多根基於私 密金鑰密碼理論的電子採購系統被提出，雖然這些系統執行效率有改善，但是他們皆無 法提供隱私性保障的功能。因此，在考慮電子資料安全性的同時亦需顧慮到使用者的隱 私性問題。由於群數對密碼演算法具有簡潔及效率之優點，近來研究密碼學領域的專家 學家，發表諸多植基於橢圓曲線上的雙線性群數對的應用於密碼學領域的期刊上。本研 冗的目的在於整合背包理論(Knapsack)及Gap Diffie-Hellman難題來實現盲簽章的可行性 探討並導入國軍電子採購作業構想，期待後續系統的開發及研討。

The ratio of military procurement to government budget is high every year. A model to e-valuate the efficiency of procurement performance is an important issue. Blind signatures enable users to obtain valid signatures for a message without revealing its content to the signer. Recently the bilinear pairings such as Weil or Tate pairings on elliptic curves have found various applications in cryptography. We present a new verifiable blind signature based on knapsack and bi-linear pairings for military procurement system. It is best to compare systems based on the best knowledge currently available. Only then can less tangible factors, like guessing the likelihood of new developments in mathematics be considered. The proposed scheme has all of the advantages of a blind signature scheme and overcomes drawbacks such as impracticality assumption. The security of the proposed method is analyzed and presented.