%0 Journal Article
%T Low Computational Load Anonymous Routing Protocol for Ad-hoc Networks<br>一种低运算量Ad-hoc网络匿名路由协议
%A LIU Fang-bin
%A ZHANG Kun
%A ZHANG Hong
%A <br>刘方斌
%A 张琨
%A 张宏
%J 计算机科学
%D 2011
%I 
%X Nodes in Ad-hoc networks are limited in energy,have poor computational ability and move fast,and public key encryptions have heavy computational load,consume a lot of energy and have long computational cycle time,so public key encryptions are adapted for the Ad-hoc networks.The proposed anonymous routing protocols have a lot of public key encryptions.To reduces public key encryptions,we applied bilinear pairing and Zero Knowledge Proofs into anonymous routing protocol,and proposed a new anonymous routing pr...
%K Bilinear pairing
%K Zero knowledge proofs
%K Energy efficiency
%K Low end-end delay
%K Anonymous routing
%K Ad-hoc networks<br>双线性对，零知识证明，低能耗，低时延，匿名路由，Ad-hoc网络
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=17DDCED190714E79C6BEF1310366A364&yid=9377ED8094509821&vid=16D8618C6164A3ED&iid=708DD6B15D2464E8&sid=B6DA1AC076E37400&eid=8E6AB9C3EBAAE921&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=0