A practical implementation of secure auctions based on multiparty integer computation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4107 LNCS, Issue , 2006, Pages 142-147

  Bogetoft, Peter ^a   Damgård, Ivan ^b   Jakobsen, Thomas ^b   Nielsen, Kurt ^a   Pagter, Jakob ^b   Toft, Tomas ^b  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CRIME; CRYPTOGRAPHY; INTEGER PROGRAMMING; KNOWLEDGE BASED SYSTEMS; PROBLEM SOLVING;

INTEGER COMPUTATION; SECURITY ENGINEERING; THRESHOLD CRYPTOGRAPHY;

SECURITY OF DATA;

EID: 33750056675     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11889663_10     Document Type: Conference Paper

References (21)

1. ALGESHEIMER, J., CAMENISCH, J., AND SHOUP, V. Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. In Advances in Cryptology - CRYPTO 2002 (Berlin, 2002), M. Yung, Ed., Springer-Verlag, pp. 417-432.
2. BOGETOFT, P., AND NIELSEN, K. Work in progress. 2005.
3. BRANDT, F. Cryptographic protocols for secure second-price auctions. Lecture Notes in Computer Science 2182 (2001), 154-
4. BRANDT, F., AND SANDHOLM, T. Efficient privacy-preserving protocols for multiunit auctions. In Proceedings of the 9th International Conference on Financial Cryptography and Data Security (FC) (2005), A. Patrick and M. Yung, Eds., Lecture Notes in Computer Science (LNCS), Springer.
5. CANETTI, R. Universally composable security: A new paradigm for cryptographic protocols, http://eprint.iacr.org/2000/067, 2005.
6. CRAMER, R., DAMGÅRD, I., AND ISHAI, Y. Share conversion, pseudorandom secret-sharing and applications to secure computation. In Proceedings of the Second Theory of Cryptography Conference (2005), pp. 342-362.
7. DAMGÅRD, L, AND TOFT, T. Work in progress. 2005.
8. DAMGÅRD, I. B., GRAMER, R., AND NIELSEN, J. B. Multiparty computation from threshold homomorphic encryption. In Advances in Cryptology - EuroCrypt 2001 Proceedings (2001), B. Pfitzmann, Ed., vol. 2045, pp. 280-300.
9. FEIGENBAUM, J., PINKAS, B., RYGER, R. S., AND JAIN, F. S. Secure Computation of Surveys. In EU Workshop on Secure Multiparty Protocols (2004).
10. FRANKLIN, M., AND REITER, M. The Design and Implementation of a Secure Auction Service. In Proc. IEEE Symp. on Security and Privacy (Oakland, Ca, 1995), IEEE Computer Society Press, pp. 2-14.
11. FROM, S. L., AND JAKOBSEN, T. Secure Multi-Party Computation on Integers. Master's thesis, Department of Computer Science, University of Aarhus, 2006. In preparation.
12. GOLDREICH, O., MICALI, S., AND WIGDERSON, A. How to play any mental gamer or a completeness theorem for protocols with honest majority. In 19th Symp. on Theory of Computing (STOC) (1987), ACM, pp. 218-229.
13. I.DAMGÅRD. N. ITZI, J.NIELSEN, AND T.TOFT. How to split a shared secret into shared bits in constant-round. The Eprint archive, nr. 2005/140 www.iacr.org (2005).
14. KLEMPERER, P. Auction theory: A guide to the literature. Journal of Economic Survey 13, 3 (1999), 227-286.
15. LIPMAA, H., ASOKAN, N., AND NIEMI, V. Secure vickrey auctions without threshold trust. In Financial Cryptography 2002 (2002), vol. 2357 of Lecture Notes in Computer Science.
16. MALKHI, D., NISAN, N., PINKAS, B., AND SELLA, Y. Fairplay - A Secure Two-Party Computation System. In Proceedings of the 13th USENIX Security Symposium (2004), pp. 287-302.
17. NAOR, M., PINKAS, B., AND SUMNER, R. Privacy preserving auctions and mechanism design. In 1st ACM Conf. on Electronic Commerce (1999), ACM, pp. 129-139.
18. NAUTZ, D. Optimal bidding in multi-unit auctions with many bidders. Economics Letters 48 (1995), 301-306.
19. SHAMIR, A. How to share a secret. Communications of the ACM 22, 11 (November 1979), 612-613.
20. T.TOFT. Secure integer computation with application in economics. Progress Report, available from author, tomas@daimi.au.dk (2005).
21. WANG, C., LEUNG, H., AND WANG, Y. Secure double auction protocols with full privacy protection. In Information Security and Cryptography - ICISC 2003: 6th International Conference (2003).