{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:50:34Z","timestamp":1725864634323},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662534250"},{"type":"electronic","value":"9783662534267"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53426-7_11","type":"book-chapter","created":{"date-parts":[[2016,9,3]],"date-time":"2016-09-03T08:49:15Z","timestamp":1472892555000},"page":"143-157","source":"Crossref","is-referenced-by-count":2,"title":["Optimal Fair Computation"],"prefix":"10.1007","author":[{"given":"Rachid","family":"Guerraoui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingjing","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,4]]},"reference":[{"issue":"4","key":"11_CR1","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1109\/49.839935","volume":"18","author":"N Asokan","year":"2000","unstructured":"Asokan, N., Shoup, V., Waidner, M.: Optimistic fair exchange of digital signatures. Sel. Areas Commun. IEEE J. 18(4), 593\u2013610 (2000)","journal-title":"Sel. Areas Commun. IEEE J."},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/3-540-44598-6_6","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"C Cachin","year":"2000","unstructured":"Cachin, C., Camenisch, J.L.: Optimistic fair secure computation. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 93\u2013111. Springer, Heidelberg (2000)"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty. In: STOC 1986, pp. 364\u2013369 (1986)","DOI":"10.1145\/12130.12168"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Micali, S.: Simple and fast optimistic protocols for fair electronic exchange. In: PODC (2003)","DOI":"10.1145\/872035.872038"},{"key":"11_CR5","unstructured":"Knuth, D.E.: Open problems with a computational flavor, mimeographed notes for a seminar on combinatorics (1971)"},{"key":"11_CR6","unstructured":"Newey, M.C.: Notes on a problem involving permutations as subsequences. Technical Report (1973)"},{"issue":"12","key":"11_CR7","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1016\/j.ipl.2011.03.018","volume":"111","author":"E Z\u0103linescu","year":"2011","unstructured":"Z\u0103linescu, E.: Shorter strings containing all k-element permutations. Inf. Process. Lett. 111(12), 605\u2013608 (2011)","journal-title":"Inf. Process. Lett."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Radomirovi\u0107, S.: A construction of short sequences containing all permutations of a set as subsequences. Electron. J. Comb. 19(4) (2012). Paper 31","DOI":"10.37236\/2859"},{"issue":"2","key":"11_CR9","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0097-3165(76)90057-1","volume":"21","author":"D Kleitman","year":"1976","unstructured":"Kleitman, D., Kwiatkowski, D.: A lower bound on the length of a sequence containing all permutations as subsequences. J. Comb. Theor. Ser. A 21(2), 129\u2013136 (1976)","journal-title":"J. Comb. Theor. Ser. A"},{"issue":"2","key":"11_CR10","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0012-365X(74)90116-2","volume":"10","author":"L Adleman","year":"1974","unstructured":"Adleman, L.: Short permutation strings. Discrete Math. 10(2), 197\u2013200 (1974)","journal-title":"Discrete Math."},{"issue":"2","key":"11_CR11","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0012-365X(75)90004-7","volume":"11","author":"P Koutas","year":"1975","unstructured":"Koutas, P., Hu, T.: Shortest string containing all permutations. Discrete Math. 11(2), 125\u2013132 (1975)","journal-title":"Discrete Math."},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/3-540-44448-3_25","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"JL Camenisch","year":"2000","unstructured":"Camenisch, J.L., Damg\u00e5rd, I.B.: Verifiable encryption, group encryption, and their applications to separable group signatures and signature sharing schemes. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 331\u2013345. Springer, Heidelberg (2000)"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Mauw, S., Radomirovi\u0107, S., Dashti, M.: Minimal message complexity of asynchronous multi-party contract signing. In: CSF (2009)","DOI":"10.1109\/CSF.2009.15"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Kordy, B., Radomirovi\u0107, S.: Constructing optimistic multi-party contract signing protocols. In: CSF (2012)","DOI":"10.1109\/CSF.2012.23"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/978-3-662-46666-7_9","volume-title":"Principles of Security and Trust","author":"S Mauw","year":"2015","unstructured":"Mauw, S., Radomirovi\u0107, S.: Generalizing multi-party contract signing. In: Focardi, R., Myers, A. (eds.) POST 2015. LNCS, vol. 9036, pp. 156\u2013175. Springer, Heidelberg (2015)"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Pfitzmann, B., Schunter, M., Waidner, M.: Optimal efficiency of optimistic contract signing. In: PODC 1998, pp. 113\u2013122 (1998)","DOI":"10.1145\/277697.277717"},{"key":"11_CR17","unstructured":"Schunter, M.: Optimistic fair exchange. Ph.D. dissertation, Universit\u00e4t des Saarlandes (2000). http:\/\/scidok.sulb.uni-saarland.de\/volltexte\/2004\/233"},{"issue":"1","key":"11_CR18","doi-asserted-by":"crossref","first-page":"3:1","DOI":"10.1145\/2168260.2168263","volume":"7","author":"MT Dashti","year":"2012","unstructured":"Dashti, M.T.: Efficiency of optimistic fair exchange using trusted devices. ACM Trans. Auton. Adapt. Syst. 7(1), 3:1\u20133:18 (2012)","journal-title":"ACM Trans. Auton. Adapt. Syst."},{"issue":"3","key":"11_CR19","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C Schnorr","year":"1991","unstructured":"Schnorr, C.: Efficient signature generation by smart cards. J. Cryptology 4(3), 161\u2013174 (1991)","journal-title":"J. Cryptology"},{"key":"11_CR20","unstructured":"Kravitz, D.: Digital signature algorithm. US Patent 5,231,668 (1993)"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Advances in Cryptology - CRYPTO \u201986","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)"},{"key":"11_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1007\/3-540-46877-3_38","volume-title":"Advances in Cryptology - EUROCRYPT \u201990","author":"H Ong","year":"1991","unstructured":"Ong, H., Schnorr, C.-P.: Fast signature generation with a fiat shamir-like scheme. In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol. 473, pp. 432\u2013440. Springer, Heidelberg (1991)"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","first-page":"216","volume-title":"Advances in Cryptology \u2014 CRYPTO\u201988","author":"LC Guillou","year":"2000","unstructured":"Guillou, L.C., Quisquater, J.-J.: A \u201cparadoxical\u201d indentity-based signature scheme resulting from zero-knowledge. In: Goldwasser, S. (ed.) Advances in Cryptology \u2014 CRYPTO\u201988. LNCS, vol. 403, pp. 216\u2013231. Springer, Heidelberg (2000)"},{"key":"11_CR24","unstructured":"Guerraoui, R., Wang, J.: Optimal fair computation. Technical Report (2016). http:\/\/infoscience.epfl.ch\/record\/219171"},{"key":"11_CR25","series-title":"Basic Applications","volume-title":"Foundations of Cryptography","author":"G Oded","year":"2009","unstructured":"Oded, G.: Foundations of Cryptography. Basic Applications, vol. 2. Cambridge University Press, New York (2009)"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Dierks, T.: The transport layer security (tls) protocol version 1.2 (2008)","DOI":"10.17487\/rfc5246"},{"issue":"1","key":"11_CR27","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptology 13(1), 143\u2013202 (2000)","journal-title":"J. Cryptology"},{"issue":"2","key":"11_CR28","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Theory and application of trapdoor functions. In: SFCS 1982, pp. 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"},{"key":"11_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/978-3-642-00457-5_2","volume-title":"Theory of Cryptography","author":"SD Gordon","year":"2009","unstructured":"Gordon, S.D., Katz, J.: Complete fairness in multi-party computation without an honest majority. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 19\u201335. Springer, Heidelberg (2009)"},{"key":"11_CR31","unstructured":"Gordon, S.D., Hazay, C., Katz, J., Lindell, Y.: Complete fairness in secure two-party computation. J. ACM"},{"key":"11_CR32","doi-asserted-by":"crossref","DOI":"10.1201\/9781439821916","volume-title":"Handbook of Applied Cryptography","author":"AJ Menezes","year":"1996","unstructured":"Menezes, A.J., Vanstone, S.A., Oorschot, P.C.V.: Handbook of Applied Cryptography. CRC Press Inc., Boca Raton (1996)"},{"key":"11_CR33","unstructured":"I. 9594\u20138. Information technology - open systems interconnection - the directory: Authentication framework (1995). (equivalent to ITU-T Recommendation X.509, 1993)"},{"key":"11_CR34","doi-asserted-by":"crossref","unstructured":"Ateniese, G.: Efficient verifiable encryption (and fair exchange) of digital signatures. In: CCS 1999, pp. 138\u2013146 (1999)","DOI":"10.1145\/319709.319728"},{"key":"11_CR35","unstructured":"Alaraj, A.M.: Simple and efficient contract signing protocol. CoRR, vol. abs\/1204.1646 (2012). http:\/\/arxiv.org\/abs\/1204.1646"},{"key":"11_CR36","volume-title":"Introduction to Reliable Distributed Programming","author":"R Guerraoui","year":"2006","unstructured":"Guerraoui, R., Rodrigues, L.: Introduction to Reliable Distributed Programming. Springer, New York (2006)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53426-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,25]],"date-time":"2020-09-25T19:29:16Z","timestamp":1601062156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53426-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662534250","9783662534267"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53426-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}