An approach to securely identifying beneficial collaboration in decentralized logistics systems

Manufacturing and Service Operations Management

Volumn 10, Issue 1, 2008, Pages 108-125

  Clifton, Chris ^a   Iyer, Ananth ^b   Cho, Richard ^c   Jiang, Wei ^a   Kantarcioglu, Murat ^d   Vaidya, Jaideep ^e  

^a Purdue University   (United States)

^b PURDUE UNIVERSITY   (United States)

^c UNIVERSITY OF NEW BRUNSWICK   (Canada)

^d The University of Texas at Dallas   (United States)

^e RUTGERS UNIVERSITY   (United States)

Author keywords

Algorithm; Collaboration; Cryptography; Incentive compatible; Routing; Space filling curve

Indexed keywords

COLLABORATION; CRYPTOGRAPHIC TECHNIQUES; DELIVERY TASKS; EMPIRICAL DATUM; INCENTIVE COMPATIBLE; LOGISTICS SYSTEMS; MANAGE INFORMATIONS; OPERATIONS MANAGEMENTS; PICK-UP; POTENTIAL EFFICIENCIES; POTENTIAL VALUES; ROUTING; SPACE-FILLING CURVE; TRUCKING COMPANIES;

ROUTING ALGORITHMS; TRUCKS;

CRYPTOGRAPHY;

EID: 61349161743     PISSN: 15234614     EISSN: 15265498     Source Type: Journal    
DOI: 10.1287/msom.1070.0167     Document Type: Article

References (22)

1. Aggarwal, G., N. Mishra, B. Pinkas. 2004. Secure computation of the fcth-ranked element. Proc. IACR Eurocrypt (EUROCRYPT04), Interlaken, Switzerland, 40-55.
2. Atallah, M. J., H. G. Elmongui, V Deshpande, L. B. Schwarz. 2003. Secure supply-chain protocols. IEEE Internat. Conf E-Commerce. Newport Beach, CA, 293-302. http://doi.ieeecomputersociety.org/10.1109/COEC.2003.1210264.
3. Bandler, J. 2003. How seagoing chemical Haulers may have tried to divide market. Wall Street J. (February 20) A1.
4. Bartholdi III, J. J. 2006. Some combinatorial applications of spacefilling curves, http://www2.isye.gatech.edu/~jjb/mow/mow.html.
5. Bartholdi III, J. J., L. K. Platzman. 1982. An O(N log N) planar travelling salesman heuristic based on spacefilling curves. Oper. Res. Lett. 1(4) 121-125.
6. Bartholdi III, J. J., L. K. Platzman. 1988. Heuristics based on space-filling curves for combinatorial problems in Euclidean space. Management Sci. 34(3) 157-160.
7. Diffie, W., M. Hellman. 1976. New directions in cryptography. IEEE Trans. Inform. Theory IT-22(6) 644-654.
8. Dodis, Y., S. Halevi, T. Rabin. 2000. A cryptographic solution to a game theoretic problem. Advances in Cryptology-CRYPTO 2000. Springer-Verlag, Berlin, Germany.
9. Goldreich, O. 2004a. General cryptographic protocols. The Foundations of Cryptography, Vol. 2. Cambridge University Press, New York.
10. Goldreich, O. 2004b. Encryption schemes. The Foundations of Cryptography, Vol. 2. Cambridge University Press, New York.
11. Goldreich, O., S. Micali, A. Wigderson. 1987. How to play any mental game - A completeness theorem for protocols with honest majority. 19th ACM Sympos. Theory Comput. ACM Press, New York, 218-229.
12. Ioannidis, I., A. Grama. 2003. An efficient protocol for Yao's millionaires' problem. Proc. Hawaii Internat. Conf System Sci. (HICSS-36), Waikoloa Village, HI, 205-210.
13. Kalagnanam, J., M. Trumbo, H. S. Lee. 2000. The surplus inventory matching problem in the process industry. Oper. Res. 48(4) 505-516.
14. Keskinocak, P., S. Tayur. 2001. Quantitative analysis for Internetenabled supply chains. Interfaces 31(2) 70-89.
15. Lin, S., B. W. Kernighan. 1973. An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2) 498-516.
16. Menezes, A. J., P. C. van Oorschot, S. A. Vanstone. 1996. Handbook of Applied Cryptography. CRC Press, Boca Raton, FL.
17. Naor, M., B. Pinkas. 1999. Oblivious transfer and polynomial evaluation. Proc. Thirty-First Annual ACM Sympos. Theory Comput. ACM Press, Atlanta, GA, 245-254.
18. Naor, M., B. Pinkas. 2001. Efficient oblivious transfer protocols. Proc. SODA 2001 (SIAM Sympos. Discrete Algorithms), Washington, D.C.
19. NIS. 1988. Data encryption standard (DES). Technical Report FIPS PUB 46-2, National Institutes of Standards and Technology, Gaithersburg, MD. http://www.itl.nist.gov/fipspubs/fip46-2.htm.
20. NIS. 1995. Secure hash standard. Technical Report FIPS PUB 180-1, National Institutes of Standards and Technology, Gaithersburg, MD. http://www.itl.nist.gov/fipspubs/fipl80-1.htm.
21. Wilson, R., R. V. Delaney. 2003. 14th Annual State of Logistics Report©: The case for reconfiguration. National Press Club, Washington, D.C. http://www.uwa.com/supply-a-005.pdf.
22. Yao, A. C. 1986. How to generate and exchange secrets. Proc. 27th IEEE Sympos. Foundations Comput. Sci. IEEE Computer Society Press, Los Alamitos, CA, 162-167.