Bit-slice auction circuit

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

Volumn 2502, Issue , 2002, Pages 24-38

  Kurosawa, Kaoru ^a   Ogata, Wakaha ^b  

^a IBARAKI UNIVERSITY   (Japan)

^b TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Auction; Bit slice; Circuit; Mix and match; Multiparty protocol

Indexed keywords

NETWORKS (CIRCUITS); SECURITY OF DATA; TIMING CIRCUITS;

AUCTION; AUCTION PROTOCOLS; CIRCUIT EVALUATION; MIX AND MATCH; MULTI-PARTY PROTOCOLS; PRICE AUCTION; SECOND-PRICE AUCTION;

SECURITY SYSTEMS;

EID: 84957041593     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45853-0_2     Document Type: Conference Paper

References (25)

1. [1] M. Abe, “Mix-Networks on permutation networks,” Proc. of Asiacrypt’99, LNCS Vol. 1716, pp. 258–273 (1999).
2. [2] M. Abe and F. Hoshino, “Remarks on Mix-Network Based on Permutation Networks,” Proc. of PKC 2001, pp. 317–324 (2001).
3. [3] M. Abe and K. Suzuki, “M1-st Price Auction Using Homomorphic Encryption,” Proc. of PKC2002, pp. 115–124 (2002).
4. [4] O. Baudron and J. Stern, “Non-Interactive Private Auctions,” Proc. of Financial Cryptography 2001 (2001).
5. [5] M. Ben-Or, S. Goldwasser, and A. Wigderson. “Completeness theorems for noncryptographic fault-tolerant distributed computation,” Proceedings of the twentieth annual ACM Symp. Theory of Computing, STOC, pp. 1–10, May 2–4 (1988).
6. [6] C. Cachin, “Efficient private bidding and auctions with an oblivious third party,” ACM CSS’99, pp. 120–127, ACM (1999).
7. [7] R. Canetti, “Security and composition of multiparty cryptographic protocols,” Journal of Cryptology, Vol. 13, No. 1, pp. 143–202 (2000).
8. [8] D. Chaum, “Untraceable electronic mail, return addresses, and digital pseudonyms,” Communications of the ACM, Vol. 24, pp. 84–88 (1981).
9. [9] D. Chaum, C. Crépeau, and I. Damgåard. “Multiparty unconditionally secure protocols,” Proc. of the twentieth annual ACM Symp. Theory of Computing, STOC, pp. 11–19, May 2–4 (1988).
10. [10] R. Cramer, I. Damgård, and J.B. Nielsen, “Multiparty Computation from Threshold Homomorphic Encryption,” Proc. of Eurocrypt’01, LNCS Vol. 2045, pp. 280–300 (2001).
11. [11] R. Cramer, I. Damgård, and B. Schoenmakers, “Proofs of partial knowledge and simplified design of witness hiding protocols,” Proc. of CRYPTO’94. LNCS Vol. 839, pp. 174–187 (1994).
12. [12] Y. Desmedt and Y. Frankel, “Threshold cryptosystems,” In Proc. of Crypto’89, pp. 307–315.
13. [13] G. Di Crescenzo, “Private selective payment protocols,” In Proc. of Financial Cryptography’00, LNCS Vol. 1962, pp. 72–89 (2000).
14. [14] M. Franklin and M. Reiter, “The Design and Implementation of a Secure Auction Service,” IEEE Trans. on Software Engineering, Vol. 22, No. 5 (1996).
15. [15] R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, “Robust threshold DSS signatures,” In Proc of Eurocrypt’96, LNCS Vol. 1070, pp. 354–371 (1996).
16. [16] O. Goldreich, S. Micali, and A. Wigderson. “How to play any mental game,” In Proceedings of the nineteenth annual ACM Symp. Theory of Computing, STOC, pp. 218–229, May 25–27 (1987).
17. [17] M. Hirt, U. Maurer, and B. Przydatek, “Efficient secure multiparty computation,” Proc. of Asiacrypt’2000, LNCS Vol. 1976, pp. 143–161 (2000).
18. [18] M. Harkavy, J. D. Tygar, and H. Kikuchi, “Electronic auction with private bids,” In Third USENIX Workshop on Electronic Commerce Proceedings, pp. 61–74 (1998).
19. [19] M. Jakobsson and A. Juels, “Millimix: Mixing in small batches,” DIMACS Technical report 99-33 (June 1999).
20. [20] M. Jakobsson and A. Juels, “Mix and Match: Secure Function Evaluation via Ciphertexts,” In Proc. of Asiacrypt 2000, LNCS Vol. 1976, pp. 162–177 (2000).
21. [21] A. Juels and M. Szydlo, “An Two-Server Auction Protocol,” In Proc. of Financial Cryptography 2002, (2002).
22. [22] M. Naor, B. Pinkas, and R. Sumner, “Privacy preserving auctions and mechanism design,” In 1st ACM Conference on Electronic Commerce, pp. 129–140, ACM (1999).
23. [23] K. Sako, “An auction protocol which hides bids of losers,” Proc. of PKC’2000, LNCS Vol. 1751, pp. 422–432 (2000).
24. [24] A. Shamir, “How to Share a Secret,” Communications of the ACM, Vol. 22, pp. 612-613 (1979).
25. [25] A. Yao, “Protocols for secure computations (extended abstract),” Proc. of FOCS’82, pp. 160–164, IEEE Computer Society (1982).