Anonymous Stochastic Routing

References

• Allioux R (2018) How hard is it for an AI to detect ships on satellite images? Medium (September 12), https://medium.com/earthcube-stories/how-hard-it-is-for-an-ai-to-detect-ships-on-satelliteimages-7265e34aadf0.Google Scholar
• Augenblick N, Bodoh-Creed A (2018) To reveal or not to reveal: Privacy preferences and economic frictions. Games Econom. Behav. 110(July):318–329.Google Scholar
• Bertsekas DP, Tsitsiklis JN (1991) An analysis of stochastic shortest path problems. Math. Oper. Res. 16(3):580–595.Link, Google Scholar
• Blum A, Morgenstern J, Sharma A, Smith A (2015) Privacy-preserving public information for sequential games. Proc. 2015 Conf. Innovations Theoret. Comput. Sci. (ACM, New York), 173–180.Google Scholar
• Calmon FP, Makhdoumi A, Médard M (2015) Fundamental limits of perfect privacy. 2015 IEEE Internat. Sympos. Inform. Theory (IEEE, Piscataway, NJ), 1796–1800.Google Scholar
• Corrigan-Gibbs H, Ford B (2010) Dissent: Accountable anonymous group messaging. Proc. 17th ACM Conf. Comput. Comm. Security (ACM, New York), 340–350.Google Scholar
• Corrigan-Gibbs H, Boneh D, Mazières D (2015) Riposte: An anonymous messaging system handling millions of users. 2015 IEEE Sympos. Security Privacy (IEEE, Piscataway, NJ), 321–338.Google Scholar
• Croucher JS (1978) A note on the stochastic shortest-route problem. Naval Res. Logist. Quart. 25(4):729–732.Google Scholar
• Cummings R, Echenique F, Wierman A (2016) The empirical implications of privacy-aware choice. Oper. Res. 64(1):67–78.Link, Google Scholar
• De Montjoye YA, Hidalgo CA, Verleysen M, Blondel VD (2013) Unique in the crowd: The privacy bounds of human mobility. Sci. Rep. 3(1): Article 1376.Google Scholar
• Dingledine R, Mathewson N, Syverson P (2004) Tor: The second-generation onion router. Technical report, Naval Research Laboratory, Washington, DC.Google Scholar
• Dwork C (2008) Differential privacy: A survey of results. Agrawal M, Du D, Duan Z, Li A, eds. Internat. Conf. Theory Appl. Models Comput. (Springer, Berlin), 1–19.Google Scholar
• Dwork C, Roth A (2014) The algorithmic foundations of differential privacy. Foundations Trends Theoret. Comput. Sci. 9(3–4):211–407.Google Scholar
• Eaton J, Zadeh L (1962) Optimal pursuit strategies in discrete-state probabilistic systems. J. Basic Engrg. 84(1):23–29.Google Scholar
• Economist (2019) The rise of the financial machines. (October 3), https://www.economist.com/leaders/2019/10/03/the-rise-of-the-financial-machines.Google Scholar
• Fanti G, Kairouz P, Oh S, Viswanath P (2015) Spy vs. spy: Rumor source obfuscation. ACM SIGMETRICS Performance Evaluation Rev. 43(1):271–284.Google Scholar
• Flajolet A, Blandin S, Jaillet P (2017) Robust adaptive routing under uncertainty. Oper. Res. 66(1):210–229.Google Scholar
• Goel S, Robson M, Polte M, Sirer E (2003) Herbivore: A scalable and efficient protocol for anonymous communication. Technical report, Cornell University, Ithaca, NY.Google Scholar
• Gradwohl R, Smorodinsky R (2017) Perception games and privacy. Games Econom. Behav. 104(July):293–308.Google Scholar
• Jaillet P, Qi J, Sim M (2016) Routing optimization under uncertainty. Oper. Res. 64(1):186–200.Link, Google Scholar
• Kurose JF, Ross KW (2013) Computer Networking: A Top-Down Approach (Addison Wesley, Boston).Google Scholar
• Kwon A, Corrigan-Gibbs H, Devadas S, Ford B (2017) Atom: Horizontally scaling strong anonymity. Proc. 26th Sympos. Oper. Systems Principles (ACM, New York), 406–422.Google Scholar
• Lindell Y, Pinkas B (2009) Secure multiparty computation for privacy-preserving data mining. J. Privacy Confidentiality 1(1):59–98.Google Scholar
• Luo W, Tay WP, Leng M (2016) Infection spreading and source identification: A hide and seek game. IEEE Trans. Signal Process. 64(16):4228–4243.Google Scholar
• Mayer J, Mutchler P, Mitchell JC (2016) Evaluating the privacy properties of telephone metadata. Proc. Natl. Acad. Sci. USA 113(20):5536–5541.Google Scholar
• Perkins CE (2001) Ad Hoc Networking, 1st ed. (Addison-Wesley, Reading, MA).Google Scholar
• Reiter MK, Rubin AD (1998) Crowds: Anonymity for web transactions. ACM Trans. Inform. System Security 1(1):66–92.Google Scholar
• Rodriguez T D (2018) Satellite-based ground truth for parking availability. Medium (November 5), https://medium.com/parkbob/satellite-based-ground-truth-for-parking-availability-e477c7e1b412.Google Scholar
• Sezer V, Bandyopadhyay T, Rus D, Frazzoli E, Hsu D (2015) Towards autonomous navigation of unsignalized intersections under uncertainty of human driver intent. 2015 IEEE/RSJ Internat. Conf. Intelligent Robots Systems (IEEE, Piscataway, NJ), 3578–3585.Google Scholar
• Shokri R, Shmatikov V (2015) Privacy-preserving deep learning. Proc. 22nd ACM SIGSAC Conf. Comput. Comm. Security (ACM, New York), 1310–1321.Google Scholar
• Tang W, Wang W, Fanti G, Oh S (2020) Privacy-utility tradeoffs in routing cryptocurrency over payment channel networks. Abstracts 2020 SIGMETRICS/Performance Joint Internat. Conf. Measurement Modeling Comput. Systems (ACM, New York), 81–82.Google Scholar
• Tossou AC, Dimitrakakis C (2016) Algorithms for differentially private multi-armed bandits. Proc. 30th AAAI Conf. Artificial Intelligence (AAAI Press, Menlo Park, CA), 2087–2093.Google Scholar
• Tsitsiklis JN, Xu K (2018) Delay-predictability trade-offs in reaching a secret goal. Oper. Res. 66(2):587–596.Link, Google Scholar
• Tsitsiklis JN, Xu K, Xu Z (2018) Private sequential learning. Proc. Machine Learn. Res 75:1–7.Google Scholar
• Valentino-DeVries J, Singer N, Keller MH, Krolik A (2018) Your apps know where you were last night, and they’re not keeping it secret. New York Times (December 10), https://www.nytimes.com/interactive/2018/12/10/business/location-data-privacy-apps.html.Google Scholar
• Vu QH, Lupu M, Ooi BC (2009) Peer-to-Peer Computing: Principles and Applications (Springer Science & Business Media, New York).Google Scholar
• Warren J (2012) Bitmessage: A peer-to-peer message authentication and delivery system. White paper, BitMessage, https://bitmessage.org/bitmessage.pdf.Google Scholar
• Xu K (2018) Query complexity of Bayesian private learning. Bengio S, Wallach H, Larochelle H, Grauman K, Cesa-Bianchi N, Garnett R, eds. Advances in Neural Information Processing Systems, vol. 31 (Curran Associates, Red Hook, NY), 2432–2441.Google Scholar