{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T16:52:34Z","timestamp":1770223954549,"version":"3.49.0"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319990729","type":"print"},{"value":"9783319990736","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99073-6_5","type":"book-chapter","created":{"date-parts":[[2018,8,10]],"date-time":"2018-08-10T18:09:38Z","timestamp":1533924578000},"page":"87-110","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":51,"title":["Strain: A Secure Auction for Blockchains"],"prefix":"10.1007","author":[{"given":"Erik-Oliver","family":"Blass","sequence":"first","affiliation":[]},{"given":"Florian","family":"Kerschbaum","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,8]]},"reference":[{"key":"5_CR1","unstructured":"Accenture: How blockchain can bring greater value to procure-to-pay processes (2017). https:\/\/www.accenture.com"},{"issue":"5","key":"5_CR2","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1109\/MSP.2016.97","volume":"14","author":"DW Archer","year":"2016","unstructured":"Archer, D.W., Bogdanov, D., Pinkas, B., Pullonen, P.: Maturity and performance of programmable secure computation. IEEE Secur. Priv. 14(5), 48\u201356 (2016)","journal-title":"IEEE Secur. Priv."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., et al.: Zerocash: decentralized anonymous payments from Bitcoin. In: Symposium on Security and Privacy, Berkeley, CA, USA, pp. 459\u2013474 (2014)","DOI":"10.1109\/SP.2014.36"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Benhamouda, F., Halevi, S., Halevi, T.: Supporting private data on Hyperledger Fabric with secure multiparty computation. In: International Conference on Cloud Engineering, pp. 357\u2013363 (2018)","DOI":"10.1109\/IC2E.2018.00069"},{"key":"5_CR5","unstructured":"Blum, M.: Coin flipping by telephone. In: Advances in Cryptology: A Report on CRYPTO 1981, Santa Barbara, California, USA, 24\u201326 August, pp. 11\u201315 (1981)"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/BFb0052253","volume-title":"Advances in Cryptology\u2014CRYPTO 1997","author":"D Boneh","year":"1997","unstructured":"Boneh, D., Franklin, M.: Efficient generation of shared RSA keys (extended abstract). In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 425\u2013439. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052253"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/3-540-46885-4_33","volume-title":"Advances in Cryptology\u2014EUROCRYPT 1989","author":"J Bos","year":"1990","unstructured":"Bos, J., den Boer, B.: Detection of disrupters in the DC protocol. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 320\u2013327. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-46885-4_33"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. 2742, pp. 223\u2013238. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45126-6_16"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Brandt, F.: Auctions. In: Rosenberg, B. (ed.) Handbook of Financial Cryptography and Security, pp. 49\u201358. Chapman and Hall\/CRC (2010)","DOI":"10.1201\/9781420059823-c2"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Cachin, C.: Efficient private bidding and auctions with an oblivious third party. In: Conference on Computer and Communications Security, Singapore, pp. 120\u2013127 (1999)","DOI":"10.1145\/319709.319726"},{"issue":"1","key":"5_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D Chaum","year":"1988","unstructured":"Chaum, D.: The dining cryptographers problem: unconditional sender and recipient untraceability. J. Cryptol. 1(1), 65\u201375 (1988)","journal-title":"J. Cryptol."},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-48071-4_7","volume-title":"Advances in Cryptology\u2014CRYPTO 1992","author":"D Chaum","year":"1993","unstructured":"Chaum, D., Pedersen, T.P.: Wallet databases with observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 89\u2013105. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_7"},{"key":"5_CR13","unstructured":"Couteau, G., Peters, T., Pointcheval, D.: Encryption switching protocols. Cryptology ePrint Archive, Report 2015\/990 (2015). http:\/\/eprint.iacr.org\/2015\/990"},{"key":"5_CR14","unstructured":"Damg\u00e5rd, I.: On $$\\varSigma $$-protocols (2010). http:\/\/www.cs.au.dk\/~ivan\/Sigma.pdf"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-540-73458-1_30","volume-title":"Information Security and Privacy","author":"I Damg\u00e5rd","year":"2007","unstructured":"Damg\u00e5rd, I., Geisler, M., Kr\u00f8igaard, M.: Efficient and secure comparison for on-line auctions. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol. 4586, pp. 416\u2013430. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73458-1_30"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/3-540-46766-1_37","volume-title":"Advances in Cryptology\u2014CRYPTO 1991","author":"Y Desmedt","year":"1992","unstructured":"Desmedt, Y., Frankel, Y.: Shared generation of authenticators and signatures (extended abstract). In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 457\u2013469. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_37"},{"issue":"5","key":"5_CR17","doi-asserted-by":"publisher","first-page":"587","DOI":"10.3233\/JCS-150535","volume":"23","author":"J Dreier","year":"2015","unstructured":"Dreier, J., Dumas, J.-G., Lafourcade, P.: Brandt\u2019s fully private auction protocol revisited. J. Comput. Secur. 23(5), 587\u2013610 (2015)","journal-title":"J. Comput. Secur."},{"key":"5_CR18","unstructured":"Ethereum. White Paper (2017). https:\/\/github.com\/ethereum\/wiki\/wiki\/"},{"key":"5_CR19","unstructured":"Etherscan. The Ethereum Block Explorer (2017). https:\/\/etherscan.io\/"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology\u2014CRYPTO 1986","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/3-540-45353-9_33","volume-title":"Topics in Cryptology\u2014CT-RSA 2001","author":"M Fischlin","year":"2001","unstructured":"Fischlin, M.: A cost-effective pay-per-multiplication comparison method for millionaires. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol. 2020, pp. 457\u2013471. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45353-9_33"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-662-46803-6_10","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"J Garay","year":"2015","unstructured":"Garay, J., Kiayias, A., Leonardos, N.: The Bitcoin backbone protocol: analysis and applications. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 281\u2013310. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_10"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption and how to play mental poker keeping secret all partial information. In: STOCS, pp. 365\u2013377 (1982)","DOI":"10.1145\/800070.802212"},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-39200-9_13","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2003","author":"J Katz","year":"2003","unstructured":"Katz, J.: Efficient and non-malleable proofs of plaintext knowledge and applications. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 211\u2013228. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_13"},{"key":"5_CR25","unstructured":"Katz, J., Yung, M.: Threshold cryptosystems based on factoring. Cryptology ePrint Archive, Report 2001\/093 (2001). http:\/\/eprint.iacr.org\/2001\/093"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Kosba, A.E., Miller, A., Shi, E., Wen, Z., Papamanthou, C.: Hawk: the blockchain model of cryptography and privacy-preserving smart contracts. In: IEEE Symposium on Security and Privacy, San Jose, USA, pp. 839\u2013858 (2016)","DOI":"10.1109\/SP.2016.55"},{"key":"5_CR27","unstructured":"Lindell, Y.: How to simulate it \u2013 a tutorial on the simulation proof technique. Cryptology ePrint Archive, Report 2016\/046 (2016). http:\/\/eprint.iacr.org\/2016\/046"},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-662-48000-7_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"Y Lindell","year":"2015","unstructured":"Lindell, Y., Pinkas, B., Smart, N.P., Yanai, A.: Efficient constant round multi-party computation combining BMR and SPDZ. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 319\u2013338. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_16"},{"key":"5_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-662-53641-4_21","volume-title":"Theory of Cryptography","author":"Y Lindell","year":"2016","unstructured":"Lindell, Y., Smart, N.P., Soria-Vazquez, E.: More efficient constant-round multi-party computation from BMR and SHE. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9985, pp. 554\u2013581. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53641-4_21"},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: ACM Conference on Electronic Commerce, pp. 129\u2013139 (1999)","DOI":"10.1145\/336992.337028"},{"key":"5_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/BFb0028500","volume-title":"Information and Communications Security","author":"W Ogata","year":"1997","unstructured":"Ogata, W., Kurosawa, K., Sako, K., Takatani, K.: Fault tolerant anonymous channel. In: Han, Y., Okamoto, T., Qing, S. (eds.) ICICS 1997. LNCS, vol. 1334, pp. 440\u2013444. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0028500"},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"Reiter, M.K., Wang, X.: Fragile mixing. In: Proceedings of the 11th ACM Conference on Computer and Communications Security, CCS 2004, pp. 227\u2013235 (2004)","DOI":"10.1145\/1030083.1030114"},{"key":"5_CR33","unstructured":"Reuters. Ukrainian ministry carries out first blockchain transactions (2017). https:\/\/www.reuters.com"},{"key":"5_CR34","doi-asserted-by":"crossref","unstructured":"Sander, T., Young, A.L., Yung, M.: Non-interactive CryptoComputing For NC$$^1$$. In: FOCS, pp. 554\u2013567 (1999)","DOI":"10.1109\/SFFCS.1999.814630"},{"key":"5_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-45539-6_15","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2000","author":"V Shoup","year":"2000","unstructured":"Shoup, V.: Practical threshold signatures. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 207\u2013220. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_15"},{"key":"5_CR36","unstructured":"Strain. Source Code (2017). https:\/\/github.com\/strainprotocol\/"},{"key":"5_CR37","unstructured":"Tual, S.: What are State Channels? (2017). https:\/\/www.stephantual.com"},{"key":"5_CR38","unstructured":"University of Bristol. Multiparty computation with SPDZ online phase and MASCOT offline phase (2017). https:\/\/github.com\/bristolcrypto\/SPDZ-2"},{"key":"5_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-319-39028-4_9","volume-title":"Open Problems in Network Security","author":"M Vukoli\u0107","year":"2016","unstructured":"Vukoli\u0107, M.: The quest for scalable blockchain fabric: proof-of-work vs. BFT replication. In: Camenisch, J., Kesdo\u011fan, D. (eds.) iNetSec 2015. LNCS, vol. 9591, pp. 112\u2013125. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39028-4_9"},{"key":"5_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/3-540-46885-4_32","volume-title":"Advances in Cryptology\u2014EUROCRYPT 1989","author":"M Waidner","year":"1990","unstructured":"Waidner, M.: Unconditional sender and recipient untraceability in spite of active attacks. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 302\u2013319. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-46885-4_32"},{"key":"5_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1007\/3-540-46885-4_69","volume-title":"Advances in Cryptology\u2014EUROCRYPT 1989","author":"M Waidner","year":"1990","unstructured":"Waidner, M., Pfitzmann, B.: The dining cryptographers in the disco: unconditional sender and recipient untraceability with computationally secure serviceability. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, p. 690. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-46885-4_69"}],"container-title":["Lecture Notes in Computer Science","Computer Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99073-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T08:58:59Z","timestamp":1751792339000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-99073-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319990729","9783319990736"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99073-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"8 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESORICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Research in Computer Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Barcelona","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/esorics2018.upc.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}