000171024 001__ 171024
000171024 005__ 20181203022524.0
000171024 0247_ $$2doi$$a10.1002/cpe.1684
000171024 02470 $$2ISI$$a000294568800007
000171024 037__ $$aARTICLE
000171024 245__ $$aA cryptographically t-private auction system
000171024 269__ $$a2011
000171024 260__ $$c2011
000171024 336__ $$aJournal Articles
000171024 520__ $$aWe present a cryptographically t-private protocol for electronic auctions whose low resource demands make it viable for practical use. Our construction is based on Yao's garbled circuits and pseudorandom number generators (PRNGs). Our protocol involves a field of (t +1)(2) parties for the generation of the garbled circuit and permits an arbitrary large number of bidders. The computational requirements are low: Only t + 1 parties of the field have to use the PRNG, the remaining parties execute only primitive computations (XOR, permutations and sharing). The bidders have to stay active for one round of communication, independent of each other. Each bidder has to compute only t +1 XOR-operations. We present an implementation and evaluate its performance. The observed running time of our protocol is linear in the size of the auction circuit and the number of bidders and, as expected, grows quadratically in the parameter t. Copyright (C) 2010 John Wiley & Sons, Ltd.
000171024 6531_ $$amultiparty private computation
000171024 6531_ $$agarbled circuits
000171024 6531_ $$aprivate auctions
000171024 700__ $$uUniv Lubeck, Inst Theoret Informat, D-23538 Lubeck, Germany$$aHinkelmann, Markus
000171024 700__ $$aJakoby, Andreas
000171024 700__ $$uUniv Augsburg, D-8900 Augsburg, Germany$$aMoebius, Nina
000171024 700__ $$0243345$$g185682$$uEcole Polytech Fed Lausanne, Lausanne, Switzerland$$aRompf, Tiark
000171024 700__ $$aStechert, Peer$$uRBZ Tech Kiel, Kiel, Germany
000171024 773__ $$j23$$tConcurrency And Computation-Practice & Experience$$q1399-1413
000171024 909C0 $$xU10409$$0252187$$pLAMP
000171024 909CO $$pIC$$particle$$ooai:infoscience.tind.io:171024
000171024 917Z8 $$x166927
000171024 937__ $$aEPFL-ARTICLE-171024
000171024 973__ $$rREVIEWED$$sPUBLISHED$$aEPFL
000171024 980__ $$aARTICLE