{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T16:31:44Z","timestamp":1780763504119,"version":"3.54.1"},"reference-count":36,"publisher":"Chapman and Hall\/CRC","isbn-type":[{"value":"9781420059816","type":"print"},{"value":"9781420059823","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,8,2]]},"DOI":"10.1201\/9781420059823-c2","type":"book-chapter","created":{"date-parts":[[2010,8,4]],"date-time":"2010-08-04T21:25:33Z","timestamp":1280957133000},"page":"49-58","source":"Crossref","is-referenced-by-count":5,"title":["Auctions"],"prefix":"10.1201","author":[{"given":"Felix","family":"Brandt","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"301","published-online":{"date-parts":[[2010,8,4]]},"reference":[{"key":"p_1","doi-asserted-by":"crossref","unstructured":"M. Abe, and K. Suzuki .M+1-st price auction using homomorphic encryption . InProceedings of the 5th International Conference on Public Key Cryptography (PKC), volume2274 of Lecture Notes in Computer Science (LNCS), pages 115-224. Springer-Verlag,2002 .","DOI":"10.1007\/3-540-45664-3_8"},{"key":"p_2","unstructured":"O. Baudron, and J. Stern .Non-interactive private auctions . InProceedings of the 5th Annual Conference on Financial Cryptography (FC), volume2339 of Lecture Notes in Computer Science (LNCS), pages 300-313. Springer-Verlag,2001 ."},{"key":"p_3","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson .Completeness theorems for noncryptographic fault-tolerant distributed computation . InProceedings of the 20th Annual ACM Symposium on the Theory of Computing (STOC), pages1 -10 . ACMPress,1988 .","DOI":"10.1145\/62212.62213"},{"key":"p_4","doi-asserted-by":"crossref","unstructured":"P. Bogetoft, D. L. Christensen, I. Damg\u00e5rd, M. Geisler, T. Jakobsen, M. Kr\u00f8igaard, J. D. Nielsen, J. B. Nielsen, K. Nielsen, J. Pagter, M. I. Schwartzbach, and T. Toft .Secure multiparty computation goes live . InProceedings of the 13th International Conference on Financial Cryptography and Data Security (FC), volume5628 of Lecture Notes in Computer Science (LNCS), pages 325-343. Springer-Verlag,2009 .","DOI":"10.1007\/978-3-642-03549-4_20"},{"key":"p_5","unstructured":"F. Brandt A verifiable, bidder-resolved auction protocol. In R. Falcone, S. Barber, L. Korba, and M. Singh, editors ,Proceedings of the 5th AAMAS Workshop on Deception, Fraud and Trust in Agent Societies (Special Track on Privacy and Protection with Multi-Agent Systems),2002 ."},{"key":"p_6","doi-asserted-by":"crossref","unstructured":"F. Brandt Fully private auctions in a constant number of rounds. In R. N. Wright, editor ,Proceedings of the 7th Annual Conference on Financial Cryptography (FC), volume2742 of Lecture Notes in Computer Science (LNCS), pages 223-238. Springer-Verlag,2003 .","DOI":"10.1007\/978-3-540-45126-6_16"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-006-0001-y"},{"key":"p_8","doi-asserted-by":"crossref","unstructured":"F. Brandt, and T. Sandholm .Efficient privacy-preserving protocols for multi-unit auctions. In A. Patrick and M. Yung, editors ,Proceedings of the 9th International Conference on Financial Cryptography and Data Security (FC), volume3570 of Lecture Notes in Computer Science (LNCS), pages 298-312. Springer-Verlag,2005 .","DOI":"10.1007\/11507840_26"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1145\/1330332.1330338"},{"key":"p_10","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, and I. Damg\u00e5rd .Multi-party unconditionally secure protocols . InProceedings of the 20th Annual ACM Symposium on the Theory of Computing (STOC), pages11 -19 . ACMPress,1988 .","DOI":"10.1145\/62212.62214"},{"key":"p_11","doi-asserted-by":"crossref","unstructured":"B. Chor, and E. Kushilevitz .A zero-one law for Boolean privacy . InProceedings of the 21st Annual ACM Symposium on the Theory of Computing (STOC), pages62 -72 . ACMPress,1989 .","DOI":"10.1145\/73007.73013"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1109\/32.502223"},{"key":"p_13","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson .How to play any mental game or a completeness theorem for protocols with honest majority . InProceedings of the 19th Annual ACM Symposium on the Theory of Computing (STOC), pages218 -229 . ACMPress,1987 .","DOI":"10.1145\/28395.28420"},{"key":"p_14","unstructured":"M. Harkavy, J. D. Tygar, and H. Kikuchi .Electronic auctions with private bids . InProceedings of the 3rd USENIX Workshop on Electronic Commerce, pages61 -74 ,1998 ."},{"key":"p_15","doi-asserted-by":"crossref","unstructured":"M. Jakobsson, and A. Juels .Mix and match: Secure function evaluation via ciphertexts . InProceedings of the 6th Asiacrypt Conference, volume1976 of Lecture Notes in Computer Science (LNCS), pages 162-177. Springer-Verlag,2000 .","DOI":"10.1007\/3-540-44448-3_13"},{"key":"p_16","doi-asserted-by":"crossref","unstructured":"A. Juels, and M. Szydlo .A two-server, sealed-bid auction protocol. In M. Blaze, editor ,Proceedings of the 6th Annual Conference on Financial Cryptography (FC), volume2357 of Lecture Notes in Computer Science (LNCS), pages 72-86. Springer-Verlag,2002 .","DOI":"10.1007\/3-540-36504-4_6"},{"key":"p_17","doi-asserted-by":"crossref","unstructured":"A. Kiayias, and M. Yung .Self-tallying elections and perfect ballot secrecy . InProceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptography (PKC), volume2274 of Lecture Notes in Computer Science (LNCS), pages 141-158. Springer-Verlag,2002 .","DOI":"10.1007\/3-540-45664-3_10"},{"key":"p_18","volume-title":"Auction Theory","author":"Krishna V.","year":"2002"},{"key":"p_19","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz Privacy and communication complexity . InProceedings of the 30th Symposium on Foundations of Computer Science (FOCS), pages416 -421 . IEEEComputer Society Press,1989 .","DOI":"10.1109\/SFCS.1989.63512"},{"key":"p_20","doi-asserted-by":"crossref","unstructured":"H. Lipmaa, N. Asokan, and V. Niemi .Secure Vickrey auctions without threshold trust. In M. Blaze, editor ,Proceedings of the 6th Annual Conference on Financial Cryptography (FC), volume2357 of Lecture Notes in Computer Science (LNCS), pages 87-101. Springer-Verlag,2002 .","DOI":"10.1007\/3-540-36504-4_7"},{"key":"p_21","doi-asserted-by":"crossref","unstructured":"M. Naor, B. Pinkas, and R. Sumner .Privacy preserving auctions and mechanism design . InProceedings of the 1st ACM Conference on Electronic Commerce (ACM-EC), pages129 -139 . ACMPress,1999 .","DOI":"10.1145\/336992.337028"},{"key":"p_22","doi-asserted-by":"publisher","DOI":"10.1007\/BF01384489"},{"key":"p_23","doi-asserted-by":"publisher","DOI":"10.1016\/j.elerap.2008.04.006"},{"key":"p_24","doi-asserted-by":"crossref","unstructured":"D. C. Parkes, M. O. Rabin, and C. Thorpe .Cryptographic combinatorial clock-proxy auctions . InProceedings of the 13th International Conference on Financial Cryptography and Data Security (FC), volume5628 of Lecture Notes in Computer Science (LNCS), pages 305-324. Springer-Verlag,2009 .","DOI":"10.1007\/978-3-642-03549-4_19"},{"key":"p_25","doi-asserted-by":"crossref","unstructured":"B. Pinkas Fair secure two-party computation . InProceedings of the 20th Eurocrypt Conference, volume2656 of Lecture Notes in Computer Science (LNCS), pages 87-105. Springer-Verlag,2003 .","DOI":"10.1007\/3-540-39200-9_6"},{"key":"p_26","doi-asserted-by":"publisher","DOI":"10.1086\/296663"},{"key":"p_27","doi-asserted-by":"publisher","DOI":"10.1086\/261670"},{"key":"p_28","doi-asserted-by":"crossref","unstructured":"K. Sako An auction protocol which hides bids of losers . InProceedings of the 3rd International Conference on Public Key Cryptography (PKC), volume1751 of Lecture Notes in Computer Science (LNCS), pages 422-432. Springer-Verlag,2000 .","DOI":"10.1007\/978-3-540-46588-1_28"},{"key":"p_29","volume-title":"International Journal of Electronic Commerce, Special issue on Intelligent Agents for Electronic Commerce, 4 (3):107-129","author":"Sandholm T.","year":"2000"},{"key":"p_30","doi-asserted-by":"crossref","unstructured":"K. Suzuki, and M. Yokoo .Secure combinatorial auctions by dynamic programming with polynomial secret sharing . InProceedings of the 6th Annual Conference on Financial Cryptography (FC), volume2357 of Lecture Notes in Computer Science (LNCS), pages 44-56. Springer-Verlag,2002 .","DOI":"10.1007\/3-540-36504-4_4"},{"key":"p_31","doi-asserted-by":"crossref","unstructured":"K. Suzuki, and M. Yokoo .Secure generalized Vickrey auction using homomorphic encryption . InProceedings of the 7th Annual Conference on Financial Cryptography (FC), volume2742 of Lecture Notes in Computer Science (LNCS), pages 239-249. Springer-Verlag,2003 .","DOI":"10.1007\/978-3-540-45126-6_17"},{"key":"p_32","doi-asserted-by":"crossref","unstructured":"C. Thorpe, and D. C. Parkes .Cryptographic combinatorial securities exchanges . InProceedings of the 13th International Conference on Financial Cryptography and Data Security (FC), volume5628 of Lecture Notes in Computer Science (LNCS), pages 285-304. Springer-Verlag,2009 .","DOI":"10.1007\/978-3-642-03549-4_18"},{"key":"p_33","doi-asserted-by":"publisher","DOI":"10.2307\/2977633"},{"key":"p_34","doi-asserted-by":"crossref","unstructured":"A. C. Yao Some complexity questions related to distributed computing . InProceedings of the 11th Annual ACM Symposium on the Theory of Computing (STOC), pages209 -213 . ACMPress,1979 .","DOI":"10.1145\/800135.804414"},{"key":"p_35","doi-asserted-by":"crossref","unstructured":"A. C. Yao Protocols for secure computation . InProceedings of the 23th Symposium on Foundations of Computer Science (FOCS), pages160 -164 . IEEEComputer Society Press,1982 .","DOI":"10.1109\/SFCS.1982.38"},{"key":"p_36","doi-asserted-by":"crossref","unstructured":"M. Yokoo, and K. Suzuki .Secure generalized Vickrey auction without third-party servers . InProceedings of the 8th Annual Conference on Financial Cryptography (FC), volume3110 of Lecture Notes in Computer Science (LNCS), pages 132-146. Springer-Verlag,2004 .","DOI":"10.1007\/978-3-540-27809-2_17"}],"container-title":["Chapman & Hall\/CRC Cryptography and Network Security Series","Handbook of Financial Cryptography and Security"],"original-title":[],"language":"en","deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T05:33:20Z","timestamp":1559367200000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.crcnetbase.com\/doi\/abs\/10.1201\/9781420059823-c2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,2]]},"ISBN":["9781420059816","9781420059823"],"references-count":36,"alternative-id":["10.1201\/9781420059823-c2","10.1201\/CHCRYNETSEC","10.1201\/9781420059823"],"URL":"https:\/\/doi.org\/10.1201\/9781420059823-c2","relation":{},"ISSN":["2154-4670"],"issn-type":[{"value":"2154-4670","type":"print"}],"subject":[],"published":{"date-parts":[[2010,8,2]]}}}