Abstract
Barter trade is a growing part of the world economy. Hundreds of thousands of companies in the US alone participate in barter. Barter is also used in other domains, such as resource management in distributed systems. Existing algorithms for finding barter trades require that values of goods are publicly known (whether they are set by a global function or individual utility functions for each user). The fact that each user must reveal her utility function in order to find barter trades is a potential disincentive to using bartering. We present a first step in the creation of a privacy-preserving bartering system. We present algorithms and privacy-preserving protocols in the honest but curious model for determining the existence of win-win trades (and algorithms and protocols for finding such trades). We discuss a number of remaining open problems and extensions for future work.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abraham, D.J., Blum, A., Sandholm, T.: Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges. In: EC 2007: Proceedings of the 8th ACM Conference on Electronic Commerce, pp. 295–304. ACM Press, New York (2007)
Ackemann, T., Gold, R., Mascolo, C., Emmerich, W.: Incentives in peer-to-peer and grid networking. Technical report, University College London (2002)
Ajtai, M., Komlós, J., Szemerédi, E.: An 0(n log n) sorting network. In: STOC 1983: Proceedings of the fifteenth annual ACM symposium on Theory of computing, pp. 1–9. ACM Press, New York (1983)
Bhavsar, V.C., Boley, H., Yang, L.: A weighted tree similarity algorithm for multi-agent system in e-business environments. In: Workshop on Business Agents and the Semantic Web, pp. 53–72 (June 2003)
Canetti, R.: Security and composition of multiparty cryptographic protocols. Journal of Cryptology 13(1), 143–202 (2000)
Cresti, B.: US domestic barter: an empirical investigation. Applied Economics 37(17), 1953–1966 (2005)
Damgård, I., Jurik, M.: A length-flexible threshold cryptosystem with applications. In: Safavi-Naini, R., Seberry, J. (eds.) ACISP 2003. LNCS, vol. 2727, pp. 350–364. Springer, Heidelberg (2003)
Freedman, M., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 1–19. Springer, Heidelberg (2004)
Frikken, K.: Privacy-preserving set union. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol. 4521, pp. 237–252. Springer, Heidelberg (to appear, 2007)
Frikken, K.B., Atallah, M.J.: Privacy preserving route planning. In: WPES 2004: Proceedings of the 2004 ACM workshop on Privacy in the electronic society, pp. 8–15. ACM Press, New York (2004)
Fu, Y., Chase, J., Chun, B., Schwab, S., Vahdat, A.: SHARP: an architecture for secure resource peering. In: SOSP 2003: Proceedings of the Nineteenth ACM Symposium on Operating Systems Principles, pp. 133–148. ACM Press, New York (2003)
Ganesan, P., Seshadri, M.: On cooperative content distribution and the price of barter. In: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (ICDCS 2005), pp. 81–90 (June 2005)
Goethals, B., Laur, S., Lipmaa, H., Mielikainen, T.: On private scalar product computation for privacy-prerving data mining. In: Park, C., Chee, S. (eds.) ICISC 2004. LNCS, vol. 3506, pp. 104–120. Springer, Heidelberg (2005)
Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the nineteenth annual ACM conference on Theory of computing, pp. 218–229 (May 1987)
Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer and System Sciences 28(2), 270–299 (1984)
Haddawy, P., Rujikeadkumjorn, N., Dhananaiyapergse, K., Cheng, C.: Balanced matching of buyers and sellers in e-marketplaces: the barter trade exchange model. In: ICEC 2004, pp. 85–94. ACM Press, New York (2004)
Intervac international home exchange (Last viewed: 10-08-2007), http://www.intervac.com
International reciprocal trade association (Last viewed: 10-08-2007), www.irta.com
Kissner, L., Song, D.: Privacy-preserving set operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 241–257. Springer, Heidelberg (2005), http://www.cs.cmu.edu/~leak/
López, N., Núñez, M., RodrÃguez, I., Rubio, F.: A formal framework for e-barter based on microeconomic theory and process algebras. In: Unger, H., Böhme, T., Mikler, A.R. (eds.) IICS 2002. LNCS, vol. 2346, pp. 217–228. Springer, Heidelberg (2002)
López, N., Núñez, M., RodrÃguez, I., Rubio, F.: A multi-agent system for e-barter including transaction and shipping costs. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol. 3006, pp. 587–594. Springer, Heidelberg (2004)
Marin, D., Schnitzer, M.: The economic institution of international barter. The Economic Journal 112(479), 293–316 (2002)
Mathieu, S.: Match-making in bartering scenarios. Master’s thesis, The University of New Brunswick (December 2005)
Muir, D.: Man trades up from paper clip to house (July 9, 2006), http://www.abcnews.go.com/wnt/story?id=2171378
National association of trade exchanges (Last viewed: 10-08-2007), www.nate.org
Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999)
Peerflix (Lastviewed: 10-08-2007), www.peerflix.com
Read it swap it (Last viewed: 10-08-2007), www.readitswapit.co.uk
Yao, A.C.: How to generate and exchange secrets. In: Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, pp. 162–167 (1986)
Yao, D., Frikken, K.B., Atallah, M.J., Tamassia, R.: Point-based trust: Define how much privacy is worth. In: Ning, P., Qing, S., Li, N. (eds.) ICICS 2006. LNCS, vol. 4307, pp. 190–209. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Frikken, K., Opyrchal, L. (2008). PBS: Private Bartering Systems. In: Tsudik, G. (eds) Financial Cryptography and Data Security. FC 2008. Lecture Notes in Computer Science, vol 5143. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85230-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-85230-8_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85229-2
Online ISBN: 978-3-540-85230-8
eBook Packages: Computer ScienceComputer Science (R0)