Constructing disjoint paths for secure communication

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2848, Issue , 2003, Pages 181-195

  Bagchi, Amitabha ^a   Chaudhary, Amitabh ^a   Goodrich, Michael T ^a   Xu, Shouhuai ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BANDWIDTH; DISTRIBUTED COMPUTER SYSTEMS; SECURE COMMUNICATION;

ALGORITHMIC SOLUTIONS; BANDWIDTH EFFICIENT; DISJOINT PATHS; EDGE DISJOINT PATHS; MALICIOUS ADVERSARIES; ON-LINE ALGORITHMS; PATH COLORINGS; SECURITY APPLICATION;

COLOR;

EID: 34548353311     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39989-6_13     Document Type: Article

References (32)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network Flows. Prentice Hall, New Jersey, 1993.
2. Y. Aumann and Y. Rabani. Improved bounds for all-optical routing. In Proc. of the 6th ACM-SIAM Symposium on Discrete Algorithms, pages 567-576, 1995.
3. A. Bagchi, A. Chaudhary, M.T. Goodrich, and S. Xu. Constructing disjoint paths for secure communication (full version). Available online at http://www.ics.uci.edu/∼bagchi/pub.html.
4. A. Bagchi, A. Chaudhary, and P. Kolman. Short length Menger's theorem and reliable optical routing. In Proc. of the 15th Annual Symp. on Parallel Algorithms and Architectures, pages 246-247, 2003.
5. A. Bagchi, A. Chaudhary, P. Kolman, and C. Scheideler. Algorithms for fault-tolerant routing in circuit-switched networks. In Proc. 14th ACM Symp. on Parallel Algorithms and Architectures, pages 265-274, 2002.
6. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computing (extended abstract). In Proc. of 20th Annual Symposium on the Theory of Computing, pages 1-10, 1988.
7. R. Blom. An optimal class of symmetric key generation systems. In Proc. of EUROCRYPT '84, pages 335-338, 1984.
8. C. Blundo, A. D. Santis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung. Perfectly-secure key distribution for dynamic conferences. In CRYPTO'92, pages 471-486, 1992.
9. D. Boneh and M. Franklin. Identity-based encryption from weil pairing. In Proc. of CRYPTO 2001, pages 213-229, 2001.
10. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
11. R.G. Busaker and P.J. Gowen. A procedure for determining minimal-cost flows by doubling scaling. Technical Report ORO Technical Report 15, Operational Research Office, Johns Hopkins University, Baltimore, MD, 1961.
12. D. Chaum, C. Crepeau, and I. Damgard. Multiparty unconditionally secure protocols. In Proc. of 20th Annual Symposium on the Theory of Computing, pages 11-19, 1988.
13. R. Dial. Algorithm 360: Shortest path forest with topological ordering. Comm. ACM, pages 632-633, 1969.
14. D. Dolev, C. Dwork, O. Waarts, and M. Yung. Perfectly secure message transmission. JACM, 40(1):17-47, 1993.
15. J. Edmonds and R.M. Karp. Theoretical improvements in algorithmic efficiency for network low problems. J. ACM, 19:248-264, 1972.
16. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Proc. of CRYPTO'86, pages 186-194, 1986.
17. M. Franklin and R. Wright. Secure communication in minimal connectivity models. In Proc. of EUROCRYPT'98, pages 346-360, 1998.
18. Z. Galil and X. Yu. Short length versions of Menger's theorem. In Proc. of the 27th Annual ACM Symposium on Theory of Computing, pages 499-508, 1995.
19. L. Gong. Increasing availability and security of an authentication service. IEEE J. Selected Areas in Communications, 11(5):657-662, 1993.
20. M. Iri. A new method for solving transportation-network problems. Journal of the Operations Research Society of Japan, 3:27-87, 1960.
21. W.S. Jewell. Optimal flow through networks. Technical Report Interim Technical Report 8, Operation Research Center, MIT, Cambridge, MA, 1958.
22. J. Kleinberg. Approximation Algorithms for Disjoint Paths Problems. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 1996.
23. S.G. Kolliopoulos and C. Stein. Approximating disjoint-path problems using greedy algorithms and packing integer programs. In Proc. of the 6th International Integer Programming and Combinatorial Optimization Conference (IPCO), pages 153-168, 1998.
24. P. Kolman and C. Scheideler. Improved bounds for the unsplittable flow problem. In Proc. of the 13th ACM-SIAM Symposium on Discrete Algorithms, pages 184-193, 2002.
25. M. Kumar, P. Goundan, K. Srinathan, and C. Pandu Rangan. On perfectly secure communication over arbitrary networks. In Proc. of 21st Annual ACM Symposium on the Principles of Distributed Computing, pages 193-202, 2002.
26. T. Leighton and S. Micali. Secret-key agreement without public-key cryptography (extended abstract). In Proc. of CRYPTO '93, pages 456-479, 1993.
27. R. McEliece and D. Sarwate. On sharing secrets and Reed-Solomon codes. Comm. ACM, 24(9):583-584, 1981.
28. Y. Rabani. Path coloring on the mesh. In Proc. of the 37th Annual IEEE Symposium on Foundations of Computer Science, pages 400-409, 1996.
29. P. Raghavan and E. Upfal. Efficient routing in all-optical networks. In Proc. of the 26th Annual Symposium on the Theory of Computing, pages 133-143, 1994.
30. A. Shamir. How to share a secret. Comm. ACM, 22(11): 612-613, 1979.
31. A. Shamir. Identity-based cryptosystems and signature schemes. In Proc. of CRYPTO '84, pages 47-53, 1984.
32. N. Tomizava. On some techniques useful for solution of transportation network problems. Networka, 1:173-194, 1972.