Signatures for network coding

2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings

Volumn , Issue , 2006, Pages 857-863

  Charles, Denis ^a   Jain, Kamal ^a   Lauter, Kristin ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; ENCODING (SYMBOLS); SIGNAL DETECTION;

CONTENT CORRUPTION; MALICIOUS NODES; NETWORK CODING;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 44049100993     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CISS.2006.286587     Document Type: Conference Paper

References (26)

1. Agashe, A.; Lauter, K.; Venkatesan, R.; Constructing elliptic curves with a known number of points over a prime field. In High Primes and Misdemeanours: lectures in honour of the 60th birthday of Hugh Cowie Williams, Fields Institute Communication Series, 42, 1 17, 2002.
2. Ahlswede, R.; Cai, N.; Li, S.-Y. R.; Yeung, W.; Network Information Flow, IEEE Trans. Information Theory, 46(4), 1204 - 1216, 2000.
3. Atkin, A., O., L.; Morain, F.; Elliptic curves and primality proving, Math. Comp., 61, no. 203, 29-68, 1993.
4. Barreto, P. S. L. M.; Lynn B.; Scott M.; Constructing Elliptic Curves with Prescribed Embedding Degrees, Security in Communication Networks -SCN'2002, Lecture Notes in Computer Science 2576, Springer-Verlag, 263-273, 2002.
5. Balasubramanian, R.; Koblitz, N.; The Improbability That an Elliptic Curve Has Subexponential Discrete Log Problem under the Menezes-Okamoto-Vanstone Algorithm, Journal of Cryptoiogy, 11, No. 2, 141-145, 1998.
6. Bellare, M.; Goldreich, O.; Goldwasser, S.; Incremental cryptography : The case of hashing and signing, in Advances in Cryptoiogy CRYPTO'94, Santa Barbara, CA, 1994.
7. Blake, I.; Seroussi, G.; Smart, N.; Elliptic Curves in Cryptography, Lond. Math. Soc., Lecture Note Series, 265, Cambridge University Press, 1999.
8. Boneh, D.; Lynn, B.; Shacham, H.; Short signatures from the Weil pairing, J. of Cryptology, Vol. 17, No. 4, pp. 297-319, 2004.
9. Bosma, W.; Cannon, J.; Handbook of MAGMA functions, Sydney, 2003.
10. Cai, N.; Li, S.-Y. R.; Yeung, W.; Linear Network Coding, IEEE Trans. Information Theory, 49(2), 371-381, 2003.
11. Charles, D.; Lauter K.; Computing modular polynomials, Lond. Math. Soc. Journal of Computation and Mathematics, 8, 195-204, 2005.
12. Chou, P. A.; Jain, K.; Wu, Y.; Practical network coding, in Allerton Conference on Communication, Control, and Computing, Monticello, IL, 2003.
13. Chou, P. A.; Lovász, L.; Jain, K.; Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding, ACM Symposium on Principles of Distributed Computing, Las Vegas, NV, July 2005.
14. C. Cocks, R. G. E. Pinch; Identity-based cryptosystems based on the Weil pairing, unpublished manuscript, 2001.
15. Eisenträger, K.; Lauter, K.; Montgomery, P.; Improved Weil and Tate pairings for elliptic and hyperelliptic curves, In: Algorithmic Number Theory - ANTSVI, Buell (Ed.), Lecture Notes in Computer Science vol. 3076, 169-183, Springer-Verlag, 2004.
16. Galbraith, S.; Pairings, In: Advances in Elliptic Curve Cryptography (Chapter XI), Eds. Ian Blake, Gadiel Seroussi and Nigel Smart, LMS Lecture Note Series, 317, Cambridge University Press, 183-212, 2005.
17. Gkantsidis, C.; Rodriguez, P.; Network coding for large scale content distribution, in IEEE INFOCOM, Miami, 2005.
18. Gkantsidis, C.; Rodriguez, P.; Cooperative security for network coding file distribution, To appear in IEEE IN-FOCOM, Barcelona, April 2006. (Also as Microsoft Research Technical Report, MSR-TR-2004-137)
19. Krohn, M. N.; Freedman, M. J.; Maziéres, D.; On-the-Fly Verification of Rateless Erasure Codes for Efficient Content Distribution, In the Proceedings of the IEEE Symposium on Security and Privacy, Oakland, CA, 2004.
20. 2-extensions, Lecture Notes in Math., 504, Springer-Verlag, 1976.
21. Lenstra, A. K.; Lenstra, H. W., Jr.; Algorithms in number theory, Handbook of theoretical computer science, Vol. A, Elsevier, Amsterdam, 673-715, 1990.
22. Miller, V.; Short programs for functions on curves, unpublished manuscript, 1986.
23. Menezes, A.; Okamoto, T.; Vanstone, S.; Reducing elliptic curve logarithms to logarithms in a finite field IEEE Trans. on Information Theory, 39, 1639-1646, 1993.
24. Miyaji, A.; Nakabayashi, M.; Takano, S.; New explicit conditions of elliptic curve traces for FR-reductions, IEICE Trans., Fundamentals, vol. E84-A, No.5(2001), 1234-1243.
25. Schoof, R.; Elliptic curves over finite fields and Computation of square roots mod p, Math. Comp., Vol. 44, no. 170, 483-494, 1985.
26. Silverman, J.; The Arithmetic of Elliptic Curves, Graduate Texts in Math. Vol. 106, Springer-Verlag, 1986.