Abstract
A secure calculation of common data R ∩S without disclosing R or S is useful for many applications and has been widely studied. However, proposed solutions assume all participants act “semi-honest”, which means participants may neither stop the protocol execution nor fake database content. In this contribution, we focus on a malicious participant behavior and prove that an atomic exchange of common data is not possible under the assumption of malicious participants. However, we propose mechanisms that not only reduce the damage in case a participant alters the exchange protocol, but also give a means to impede database content faking.
This is a preview of subscription content, log in via an institution to check access.
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
Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: STOC 1999: Proceedings of the thirty-first annual ACM symposium on Theory of computing, pp. 245–254. ACM Press, New York (1999)
Huberman, B.A., Franklin, M., Hogg, T.: Enhancing privacy and trust in electronic communities. In: ACM Conference on Electronic Commerce, pp. 78–86 (1999)
Agrawal, R., Terzi, E.: On honesty in sovereign information sharing. In: 10th International Conference on Extending Database Technology, Munich, Germany, pp. 240–256 (2006)
Agrawal, R., Evfimievski, A.V., Srikant, R.: Information sharing across private databases. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, San Diego, California, USA, pp. 86–97 (2003)
Akkoyunlu, E.A., Ekanadham, K., Huber, R.V.: Some constraints and tradeoffs in the design of network communications. SIGOPS Oper. Syst. Rev. 9, 67–74 (1975)
Gray, J.: Notes on data base operating systems. In: Flynn, M.J., Jones, A.K., Opderbeck, H., Randell, B., Wiehle, H.R., Gray, J.N., Lagally, K., Popek, G.J., Saltzer, J.H. (eds.) Operating Systems. LNCS, vol. 60, pp. 393–481. Springer, Heidelberg (1978)
Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transactions on Information Theory IT-22, 644–654 (1976)
Gamal, T.E.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 10–18. Springer, Heidelberg (1985)
Goldwasser, S., Micali, S.: Probabilistic encryption & how to play mental poker keeping secret all partial information. In: STOC 1982: Proceedings of the fourteenth annual ACM symposium on Theory of computing, pp. 365–377. ACM Press, New York (1982)
Shamir, A., Rivest, R., Adleman, L.: Mental poker. Technical Report LCS/TR-125 (1979)
Yao, A.C.: Protocols for secure computations. In: Proceedings of the 21st Annual IEEE Symposium on the Foundations of Computer Science, Chicago, pp. 160–164. IEEE, Los Alamitos (1982)
Du, W., Atallah, M.J.: Secure multi-party computation problems and their applications: A review and open problems. In: New Security Paradigms Workshop, Cloudcroft, New, Mexico, USA, pp. 11–20 (2001)
Clifton, C., Kantarcioglu, M., Lin, X., Vaidya, J., Zhu, M.: Tools for privacy preserving distributed data mining (2003)
Goldreich, O.: Secure multi-party computation. Working Draft (2000)
Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: STOC 1987: Proceedings of the nineteenth annual ACM conference on Theory of computing, pp. 218–229. ACM Press, New York (1987)
Kissner, L., Song, D.X.: Privacy-preserving set operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 241–257. Springer, Heidelberg (2005)
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)
Ajmani, S., Morris, R., Liskov, B.: A trusted third-party computation service. Technical Report MIT-LCS-TR-847. MIT (2001)
Jefferies, N., Mitchell, C.J., Walker, M.: A proposed architecture for trusted third party services. In: Cryptography: Policy and Algorithms, pp. 98–104 (1995)
Asokan, N., Schunter, M., Waidner, M.: Optimistic protocols for fair exchange. In: CCS 1997: Proceedings of the 4th ACM conference on Computer and communications security, pp. 7–17. ACM Press, New York (1997)
Asokan, N., Shoup, V., Waidner, M.: Asynchronous protocols for optimistic fair exchange. In: Proceedings of the IEEE Symposium on Research in Security and Privacy, pp. 86–99 (1998)
Franklin, M.K., Reiter, M.K.: Fair exchange with a semi-trusted third party (extended abstract). In: ACM Conference on Computer and Communications Security, pp. 1–5 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Böttcher, S., Obermeier, S. (2006). Sovereign Information Sharing Among Malicious Partners. In: Jonker, W., Petković, M. (eds) Secure Data Management. SDM 2006. Lecture Notes in Computer Science, vol 4165. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11844662_2
Download citation
DOI: https://doi.org/10.1007/11844662_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38984-2
Online ISBN: 978-3-540-38987-3
eBook Packages: Computer ScienceComputer Science (R0)