Abstract
Secure distributed computing addresses the problem of performing a computation with a number of mutually distrustful participants, in such a way that each of the participants has only limited access to the information needed for doing the computation. Over the past two decades, a number of solutions requiring no trusted third party have been developed using cryptographic techniques. The disadvantage of these cryptographic solutions is the excessive communication overhead they incur.
In this paper, we use one of the SDC protocols for one particular application: second price auctions, in which the highest bidder acquires the item for sale at the price of the second highest bidder. The protocol assures that only the name of the highest bidder and the amount of the second highest bid are revealed. All other information is kept secret (the amount of the highest bid, the name of the second highest bidder, ...). Although second price auctions may not seem very important, small variations on this theme are used by many public institutions: e.g., a call for tenders, where contract is given to the lowest offer (or the second lowest).
The case study serves two purposes: we show that SDC protocols can be used for these kind of applications, and secondly, we assess the network overhead and how well these applications scale. To overcome the communication overhead, we use mobile agents and semi-trusted hosts.
Chapter PDF
Similar content being viewed by others
Keywords
References
M. Abadi and J. Feigenbaum, “Secure circuit evaluation, a protocol based on hiding information from an oracle,” Journal of Cryptology, 2(1), p. 1–12, 1990
R. Cramer. “An introduction to secure computation”, in LNCS 1561, pp 16–62, 1999.
M. Franklin, “Complexity and security of distributed protocols,” Ph. D. thesis, Computer Science Department of Columbia University, New York, 1993
M. Franklin and S. Haber, “Joint encryption and message-efficient secure computation,” Journal of Cryptology, 9(4), p. 217–232, Autumn 1996
S. Loureiro and R. Molva, “Privacy for Mobile Code”, Proceedings of the workshop on Distributed Object Security, OOPSLA’ 99, p. 37–42.
G. Neven, F. Piessens, B. De Decker, “On the Practical Feasibility of Secure Distributed Computing: a Case Study”, Information Security for Global Information Infrastructures (S. Qing, J. Eloff, ed.), Kluwer Academic Publishers, 2000, pp. 361–370.
G. Neven, E. Van Hoeymissen, B. De Decker, F. Piessens, “Enabling Secure Distributed Computations: Semi-trusted Hosts and Mobile Agents”, to appear in Networking and Information Systems Journal 3 (2001).
N. Nisan, “Algorithms for selfish agents”, Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 1999, p. 1–15.
T. Sander and C. Tschudin, “On software protection via function hiding”, Proceedings of the second workshop on Information Hiding, Portland, Oregon, USA, April 1998.
T. Sander and C. Tschudin, ‘Towards mobile cryptography”, Proceedings of the 1998 IEEE Symposium on Security and Privacy, Oakland, California, May 1998.
T. Sander, A. Young, M. Yung, “Non-Interactive CryptoComputing for NC 1”, preprint.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 IFIP International Federation for Information Processing
About this paper
Cite this paper
De Decker, B., Neven, G., Piessens, F., Van Hoeymissen, E. (2001). Second Price Auctions. In: Zieliński, K., Geihs, K., Laurentowski, A. (eds) New Developments in Distributed Applications and Interoperable Systems. DAIS 2001. IFIP International Federation for Information Processing, vol 70. Springer, Boston, MA. https://doi.org/10.1007/0-306-47005-5_19
Download citation
DOI: https://doi.org/10.1007/0-306-47005-5_19
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-7923-7481-7
Online ISBN: 978-0-306-47005-9
eBook Packages: Springer Book Archive