移動(dòng)自組網(wǎng)絡(luò)中相鄰節(jié)點(diǎn)間通信的匿名安全-資料下載頁
2025-05-02 12:29本頁面
【正文】 02108.[3 ] K. ElKhatib, L. Korba, R. Song, and G. Yee. Secure dynamic distributed routing algorithm for ad hoc wireless networks. In International Conference on Parallel Processing Workshops (ICPPW’03),2003.[4 ] J. Kong and X. Hong. ANODR: ANonymous on demand routing with untraceable routes for mobile adhoc networks. In Fourth ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc’03), pages 291–302, 2003.[5 ] Bo Zhu, Zhiguo Wan, Mohan S. Kankanhalli, Feng Bao, Robert H. Deng. Anonymous Secure Routing in Mobile Adhoc Networks. In Proceedings of the 4th ACM international symposium on Mobile ad hoc networking amp。 puting, pages 291302. ACM Press, 2003.[6 ] D. Boneh and M. Franklin. Identifybased Encryption from The Weil Pairing. In Proc. CRYPTO 01, SpringerVerlag, 2001.[7 ] P. S. L. M. Barreto, H. Y. Kim, B. Bynn, and M. Scott. Efficient Algorithms for PairingBased Cryptosystems. In Proc. CRYPTO 02, Springer Verlag, August 2002.[8] D. Balfanz, G. Durfee, and N. Shankar et al. Secure Handshakes from PairingBased Key Agreements. IEEE Symposium on Security amp。 Privacy, May 2003.[9] Donggang Liu Peng Ning Kun Sun. Efficient SelfHealing Group Key Distribution with Revocation Capability. Conference on Computer and Communications Security Proceedings of the 10th ACM conference on Computer and munictions security,pages 231240, 2003. [10] . Space/time Tradeoffs in Hash Coding with Allowable Errors. CACM, 1970[11] Michael Mitzenmacher. Compressed Bloom Filters. Proc. of the 20th Annual ACM Symposium on Princles of Distributed Computing, 2001.7 /
教學(xué)教案相關(guān)推薦
鄂ICP備17016276號(hào)-1