An Approach to Securely Identifying Beneficial Collaboration in Decentralized Logistics Systems

References

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