{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:33:27Z","timestamp":1725514407933},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725039"},{"type":"electronic","value":"9783540725046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72504-6_44","type":"book-chapter","created":{"date-parts":[[2007,7,22]],"date-time":"2007-07-22T11:36:39Z","timestamp":1185104199000},"page":"486-498","source":"Crossref","is-referenced-by-count":0,"title":["t-Private and Secure Auctions"],"prefix":"10.1007","author":[{"given":"Markus","family":"Hinkelmann","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Jakoby","sequence":"additional","affiliation":[]},{"given":"Peer","family":"Stechert","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"44_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/11429647_4","volume-title":"Structural Information and Communication Complexity","author":"A. Beimel","year":"2005","unstructured":"Beimel, A.: On Private Computation in Incomplete Networks. In: Pelc, A., Raynal, M. (eds.) SIROCCO 2005. LNCS, vol.\u00a03499, pp. 18\u201333. Springer, Heidelberg (2005)"},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: 20th STOC, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"44_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/3-540-45708-9_13","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"M. Bl\u00e4ser","year":"2002","unstructured":"Bl\u00e4ser, M., et al.: Private Computation \u2013 k-Connected versus 1-Connected Networks. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 194\u2013209. Springer, Heidelberg (2002)"},{"key":"44_CR4","unstructured":"Brandt, F.: Secure and Private Auctions without Auctioneers. Technical Report FKI-245-02, Institut f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen (2002)"},{"key":"44_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/978-3-540-45126-6_16","volume-title":"Financial Cryptography","author":"F. Brandt","year":"2003","unstructured":"Brandt, F.: Fully Private Auctions in a Constant Number of Rounds. In: Wright, R.N. (ed.) FC 2003. LNCS, vol.\u00a02742, pp. 223\u2013238. Springer, Heidelberg (2003)"},{"key":"44_CR6","doi-asserted-by":"crossref","unstructured":"Cachin, C.: Efficient Private Bidding and Auctions with an Oblivious Third Party. In: 6th ACM Conference on Computer and Communications Security, pp. 120\u2013127 (1999)","DOI":"10.1145\/319709.319726"},{"key":"44_CR7","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: 20th STOC, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"44_CR8","doi-asserted-by":"crossref","unstructured":"Chor, B., et al.: Verifiable secret sharing and achieving simultaneity in the presence of faults. In: 26th FOCS, pp. 383\u2013395 (1985)","DOI":"10.1109\/SFCS.1985.64"},{"issue":"1","key":"44_CR9","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1137\/0404004","volume":"4","author":"B. Chor","year":"1991","unstructured":"Chor, B., Kushilevitz, E.: A zero-one law for boolean privacy. SIAM J. Disc. Math.\u00a04(1), 36\u201347 (1991)","journal-title":"SIAM J. Disc. Math."},{"key":"44_CR10","unstructured":"Chui, K., Zwick, R.: Auction on the Internet - A Preliminary Study, Manuscript. Technical report, Hong Kong University of Science and Technology, Department of Marketing (1999)"},{"key":"44_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1007\/11535218_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"I.B. Damg\u00e5rd","year":"2005","unstructured":"Damg\u00e5rd, I.B., Ishai, Y.: Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 378\u2013394. Springer, Heidelberg (2005)"},{"issue":"5","key":"44_CR12","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1109\/32.502223","volume":"22","author":"M. Franklin","year":"1996","unstructured":"Franklin, M., Reiter, M.: The Design and Implementation of a Secure Auction Service. IEEE Transactions on Software Engineering\u00a022(5), 302\u2013312 (1996)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"44_CR13","doi-asserted-by":"crossref","unstructured":"Franklin, M., Yung, M.: Secure hypergraphs: Privacy from partial broadcast. In: 27th STOC, pp. 36\u201344 (1995)","DOI":"10.1145\/225058.225077"},{"key":"44_CR14","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Widgerson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: 19th STOC, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"44_CR15","unstructured":"Harkavy, M., Kikuchi, H., Tygar, J.: Electronic Auctions with Private Bids. In: 3rd USENIX Workshop on Electronic Commerce, pp. 61\u201374 (1998)"},{"key":"44_CR16","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E.: Randomizing Polynomials: A New Representation with Application to Round-Efficient Secure Computation. In: 41st FOCS, pp. 294\u2013304 (2000)","DOI":"10.1109\/SFCS.2000.892118"},{"key":"44_CR17","series-title":"Lecture Notes in Computer Science","first-page":"244","volume-title":"Automata, Languages and Programming","author":"E. Kushilevitz","year":"2002","unstructured":"Kushilevitz, E., Ishai, Y.: Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials. In: Widmayer, P., et al. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 244\u2013256. Springer, Heidelberg (2002)"},{"key":"44_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-44448-3_13","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"M. Jakobsson","year":"2000","unstructured":"Jakobsson, M., Juels, A.: Mix and Match: Secure Function evaluation via Ciphertexts. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 162\u2013177. Springer, Heidelberg (2000)"},{"key":"44_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-36504-4_6","volume-title":"Financial Cryptography","author":"A. Juels","year":"2003","unstructured":"Juels, A., Szydlo, M.: A Two-Server, Sealed-Bid Auction Protocol. In: Blaze, M. (ed.) FC 2002. LNCS, vol.\u00a02357, pp. 72\u201386. Springer, Heidelberg (2003)"},{"key":"44_CR20","unstructured":"Kikuchi, H., Harkavy, M., Tygar, J.: Multi-round Anonymous Auction Protocols. In: 1st IEEE Workshop on Dependable and Real-Time E-Commerce Systems, pp. 62\u201369 (1998)"},{"key":"44_CR21","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Micali, S., Ostrovsky, R.: Reducibility and Completeness In Multi-Party Private Computations. In: 35th FOCS, pp. 478\u2013489 (1994)","DOI":"10.1109\/SFCS.1994.365743"},{"key":"44_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/3-540-45853-0_2","volume-title":"Computer Security - ESORICS 2002","author":"K. Kurosawa","year":"2002","unstructured":"Kurosawa, K., Ogata, W.: Bit-Slice Auction Circuit. In: Gollmann, D., Karjoth, G., Waidner, M. (eds.) ESORICS 2002. LNCS, vol.\u00a02502, pp. 24\u201338. Springer, Heidelberg (2002)"},{"issue":"1","key":"44_CR23","first-page":"129","volume":"58","author":"E. Kushilevitz","year":"1999","unstructured":"Kushilevitz, E., Ostrovsky, R., Ros\u00e9n, A.: Characterizing linear size circuits in terms of privacy. JCSS\u00a058(1), 129\u2013136 (1999)","journal-title":"JCSS"},{"key":"44_CR24","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B., Sumner, R.: Privacy Preserving Auctions and Mechanism Design. In: 1st ACM Conference on Electronic Commerce, pp. 129\u2013139 (1999)","DOI":"10.1145\/336992.337028"},{"key":"44_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/3-540-36504-4_5","volume-title":"Financial Cryptography","author":"K. Omote","year":"2003","unstructured":"Omote, K., Miyaji, A.: A Second-price Sealed-bid Auction with Verifiable Discriminant of p 0-th Root. In: Blaze, M. (ed.) FC 2002. LNCS, vol.\u00a02357, pp. 57\u201371. Springer, Heidelberg (2003)"},{"issue":"11","key":"44_CR26","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to Share a Secret. Communic. of the ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Communic. of the ACM"},{"key":"44_CR27","doi-asserted-by":"crossref","unstructured":"Sadeghi, A., Schunter, M., Steinbrecher, S.: Private Auctions with Multiple Rounds and Multiple Items. In: 13th IEEE DEXA, pp. 423\u2013427 (2002)","DOI":"10.1109\/DEXA.2002.1045932"},{"key":"44_CR28","unstructured":"Stechert, P.: Dynamic Private Auctions. Diplomarbeit, Institut f\u00fcr Theoretische Infomatik, Universit\u00e4t zu L\u00fcbeck, Germany (January 2005)"},{"key":"44_CR29","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: 23rd FOCS, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"44_CR30","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets. In: 27th FOCS, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72504-6_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T09:38:15Z","timestamp":1619516295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72504-6_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540725039","9783540725046"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72504-6_44","relation":{},"subject":[]}}