On Homomorphic Signatures for Network Coding
暂无分享,去创建一个
[1] Mihir Bellare,et al. Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.
[2] Rudolf Ahlswede,et al. Network information flow , 2000, IEEE Trans. Inf. Theory.
[3] R. Koetter,et al. The benefits of coding over routing in a randomized setting , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..
[4] Hovav Shacham,et al. Short Signatures from the Weil Pairing , 2001, J. Cryptol..
[5] David Mazières,et al. On-the-fly verification of rateless erasure codes for efficient content distribution , 2004, IEEE Symposium on Security and Privacy, 2004. Proceedings. 2004.
[6] Kamal Jain,et al. Signatures for Network Coding , 2006, 2006 40th Annual Conference on Information Sciences and Systems.
[7] Jonathan Katz,et al. Signing a Linear Subspace: Signature Schemes for Network Coding , 2009, IACR Cryptol. ePrint Arch..
[8] Yong Guan,et al. An Efficient Signature-Based Scheme for Securing Network Coding Against Pollution Attacks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.
[9] T. Ho,et al. On Linear Network Coding , 2010 .