Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Albrecht, M., Gentry, C., Halevi, S., Katz, J.: Attacking Cryptographic Schemes Based on “Perturbation Polynomials”. In: The 16th ACM Conference on Computer and Communication Security - CCS 2009, pp. 1–10. ACM Press (2009)
2. Balenson, D., McGrew, D., Sherman, A.: Key Management for Large Dynamic Groups: One-Way Function Trees and Amortized Initialization. In: IETF Internet Draft (August 2000),
http://tools.ietf.org/html/draft-irtf-smug-groupkeymgmt-oft-00
3. Bellare, M., Kilian, J., Rogaway, P.: The Security of the Cipher Block Chaining Message Authentication Code. Journal of Computer and System Sciences 61(3), 362–399 (2000)
4. Lecture Notes in Computer Science;C. Blundo,1993
5. Chan, H., Perrig, A.: Security and Privacy in Sensor Networks. IEEE Computer Magazine 36(10), 103–105 (2003)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献