{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:52:47Z","timestamp":1725533567933},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642026195"},{"type":"electronic","value":"9783642026201"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02620-1_22","type":"book-chapter","created":{"date-parts":[[2009,6,20]],"date-time":"2009-06-20T01:46:36Z","timestamp":1245462396000},"page":"309-326","source":"Crossref","is-referenced-by-count":0,"title":["Fair Threshold Decryption with Semi-Trusted Third Parties"],"prefix":"10.1007","author":[{"given":"Jeongdae","family":"Hong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinil","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jihye","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew K.","family":"Franklin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunsoo","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Asokan, N., Schunter, M., Waidner, M.: Optimistic protocols for fair exchange. In: ACM Conference on Computer and Communications Security, pp. 7\u201317 (1997)","DOI":"10.1145\/266420.266426"},{"issue":"4","key":"22_CR2","doi-asserted-by":"publisher","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. IEEE J. Selected Areas in Communication\u00a018(4), 593\u2013610 (2000)","journal-title":"IEEE J. Selected Areas in Communication"},{"key":"22_CR3","unstructured":"Bao, F., Deng, R.H., Mao, W.: Efficient and practical fair exchange protocols with off-line TTP. In: Proceedings of IEEE Symposium on Security and Privacy, pp. 77\u201385 (May 1998)"},{"issue":"1","key":"22_CR4","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/18.50372","volume":"36","author":"M. Ben-Or","year":"1990","unstructured":"Ben-Or, M., Goldreich, O., Micali, S., Rivest, R.L.: A fair protocol for signing contracts. IEEE Transactions on Information Theory\u00a036(1), 40\u201346 (1990)","journal-title":"IEEE Transactions on Information Theory"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/62212.62213","volume-title":"STOC 1988: Proceedings of the twentieth annual ACM symposium on Theory of computing","author":"M. Ben-Or","year":"1988","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: STOC 1988: Proceedings of the twentieth annual ACM symposium on Theory of computing, pp. 1\u201310. ACM, New York (1988)"},{"issue":"2","key":"22_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/357360.357368","volume":"1","author":"M. Blum","year":"1983","unstructured":"Blum, M.: How to exchange (secret) keys. ACM Trans. Comput. Syst.\u00a01(2), 175\u2013193 (1983)","journal-title":"ACM Trans. Comput. Syst."},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/3-540-39200-9_26","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"D. Boneh","year":"2003","unstructured":"Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and verifiably encrypted signatures from bilinear maps. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 416\u2013432. Springer, Heidelberg (2003)"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-44598-6_15","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"D. Boneh","year":"2000","unstructured":"Boneh, D., Naor, M.: Timed commitments. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 236\u2013254. Springer, Heidelberg (2000)"},{"issue":"1-2","key":"22_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0166-218X(00)00342-5","volume":"111","author":"F. Boudot","year":"2001","unstructured":"Boudot, F., Schoenmakers, B., Traor\u00e9, J.: A fair and efficient solution to the socialist millionaires\u2019 problem. Discrete Applied Mathematics\u00a0111(1-2), 23\u201336 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.\u00a01880, pp. 93\u2013111. Springer, Heidelberg (2000)"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-45146-4_8","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J. Camenisch","year":"2003","unstructured":"Camenisch, J., Shoup, V.: Practical verifiable encryption and decryption of discrete logarithms. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 126\u2013144. Springer, Heidelberg (2003)"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/62212.62214","volume-title":"STOC 1988: Proceedings of the twentieth annual ACM symposium on Theory of computing","author":"D. Chaum","year":"1988","unstructured":"Chaum, D., Cr\u00e9peau, C., Damgard, I.: Multiparty unconditionally secure protocols. In: STOC 1988: Proceedings of the twentieth annual ACM symposium on Theory of computing, pp. 11\u201319. ACM Press, New York (1988)"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty (extended abstract). In: STOC, pp. 364\u2013369 (1986)","DOI":"10.1145\/12130.12168"},{"key":"22_CR14","unstructured":"Cox, B., Tygar, J.D., Sirbu, M.: Netbill security and transaction protocol. In: First USENIX workshop on Electronic Commerce, pp. 77\u201388 (1995)"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/0-387-34805-0_28","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"Y. Desmedt","year":"1990","unstructured":"Desmedt, Y., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 307\u2013315. Springer, Heidelberg (1990)"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-540-71677-8_9","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"Y. Dodis","year":"2007","unstructured":"Dodis, Y., Lee, P.J., Yum, D.H.: Optimistic fair exchange in a multi-user setting. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol.\u00a04450, pp. 118\u2013133. Springer, Heidelberg (2007)"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Reyzin, L.: Breaking and repairing optimistic fair exchange from PODC 2003. In: Digital Rights Management Workshop, pp. 47\u201354 (2003)","DOI":"10.1145\/947380.947387"},{"issue":"4","key":"22_CR18","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem and signature scheme based on discrete logarithms. IEEE Transactions on Information Theory\u00a031(4), 469\u2013472 (1985)","journal-title":"IEEE Transactions on Information Theory"},{"key":"22_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/3-540-45472-1_7","volume-title":"Financial Cryptography","author":"P. Fouque","year":"2001","unstructured":"Fouque, P., Poupard, G., Stern, J.: Sharing decryption in the context of voting of lotteries. In: Frankel, Y. (ed.) FC 2000. LNCS, vol.\u00a01962, pp. 90\u2013104. Springer, Heidelberg (2001)"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Franklin, M.K., Reiter, M.K.: Fair exchange with a semi-trusted third party. In: Proceedings of the 4th ACM Conference on Computer and Communications Security (CCS), pp. 1\u20135 (April 1997)","DOI":"10.1145\/266420.266424"},{"key":"22_CR21","unstructured":"Garay, J.A., MacKenzie, P., Yang, K.: Efficient and secure multi-party computation with faulty majority and complete fairness. Cryptology ePrint Archive, Report 2004\/009 (2004), http:\/\/eprint.iacr.org\/"},{"key":"22_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/11681878_21","volume-title":"Theory of Cryptography","author":"J.A. Garay","year":"2006","unstructured":"Garay, J.A., MacKenzie, P.D., Prabhakaran, M., Yang, K.: Resource fairness and composability of cryptographic protocols. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 404\u2013428. Springer, Heidelberg (2006)"},{"key":"22_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-540-78967-3_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"R. Gennaro","year":"2008","unstructured":"Gennaro, R., Halevi, S., Krawczyk, H., Rabin, T.: Threshold RSA for dynamic and ad-hoc groups. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 88\u2013107. Springer, Heidelberg (2008)"},{"key":"22_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/3-540-68697-5_13","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"R. Gennaro","year":"1996","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust and Efficient Sharing of RSA Functions. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 157\u2013172. Springer, Heidelberg (1996)"},{"issue":"1","key":"22_CR25","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1006\/inco.2000.2881","volume":"164","author":"R. Gennaro","year":"2001","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust threshold DSS signatures. Inf. Comput.\u00a0164(1), 54\u201384 (2001)","journal-title":"Inf. Comput."},{"issue":"1","key":"22_CR26","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s00145-006-0347-3","volume":"20","author":"R. Gennaro","year":"2007","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure distributed key generation for discrete-log based cryptosystems. J. Cryptology\u00a020(1), 51\u201383 (2007)","journal-title":"J. Cryptology"},{"issue":"2","key":"22_CR27","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s001459910011","volume":"13","author":"R. Gennaro","year":"2000","unstructured":"Gennaro, R., Rabin, T., Jarecki, S., Krawczyk, H.: Robust and efficient sharing of RSA functions. J. Cryptology\u00a013(2), 273\u2013300 (2000)","journal-title":"J. Cryptology"},{"key":"22_CR28","unstructured":"Goldreich, O.: Secure multi-party computation (working draft, version 1.2) (2000), http:\/\/www.wisdom.weizmann.ac.il\/oded\/pp.html"},{"key":"22_CR29","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1145\/28395.28420","volume-title":"STOC 1987: Proceedings of the nineteenth annual ACM symposium on Theory of computing","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: STOC 1987: Proceedings of the nineteenth annual ACM symposium on Theory of computing, pp. 218\u2013229. ACM Press, New York (1987)"},{"key":"22_CR30","doi-asserted-by":"crossref","unstructured":"Gordon, S.D., Hazay, C., Katz, J., Lindell, Y.: Complete fairness in secure two-party computation. In: STOC, pp. 413\u2013422 (2008)","DOI":"10.1145\/1374376.1374436"},{"key":"22_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/11535218_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"L. Kissner","year":"2005","unstructured":"Kissner, L., Song, D.: Privacy-preserving set operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 241\u2013257. Springer, Heidelberg (2005)"},{"key":"22_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1011767.1011769","volume-title":"PODC 2004: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing","author":"M. Lepinski","year":"2004","unstructured":"Lepinski, M., Micali, S., Peikert, C., Shelat, A.: Completely fair sfe and coalition-safe cheap talk. In: PODC 2004: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pp. 1\u201310. ACM, New York (2004)"},{"key":"22_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-79263-5_8","volume-title":"Topics in Cryptology \u2013 CT-RSA 2008","author":"A.Y. Lindell","year":"2008","unstructured":"Lindell, A.Y.: Legally-enforceable fairness in secure two-party computation. In: Malkin, T.G. (ed.) CT-RSA 2008. LNCS, vol.\u00a04964, pp. 121\u2013137. Springer, Heidelberg (2008)"},{"key":"22_CR34","doi-asserted-by":"crossref","unstructured":"Luby, M., Micali, S., Rackoff, C.: How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin. In: FOCS, pp. 11\u201321 (1983)","DOI":"10.1109\/SFCS.1983.25"},{"key":"22_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/3-540-39200-9_6","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"B. Pinkas","year":"2003","unstructured":"Pinkas, B.: Fair secure two-party computation. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 87\u2013105. Springer, Heidelberg (2003)"},{"key":"22_CR36","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/73007.73014","volume-title":"STOC 1989: Proceedings of the twenty-first annual ACM symposium on Theory of computing","author":"T. Rabin","year":"1989","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: STOC 1989: Proceedings of the twenty-first annual ACM symposium on Theory of computing, pp. 73\u201385. ACM Press, New York (1989)"},{"key":"22_CR37","doi-asserted-by":"crossref","unstructured":"Santis, A.D., Desmedt, Y., Frankel, Y., Yung, M.: How to share a function securely. In: STOC, pp. 522\u2013533 (1994)","DOI":"10.1145\/195058.195405"},{"issue":"11","key":"22_CR38","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. Commun. ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"22_CR39","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 - EUROCRYPT 2000","author":"V. Shoup","year":"2000","unstructured":"Shoup, V.: Practical threshold signatures. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 207\u2013220. Springer, Heidelberg (2000)"},{"key":"22_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-540-46588-1_4","volume-title":"Public Key Cryptography","author":"J. Zhou","year":"2000","unstructured":"Zhou, J., Deng, R.H., Bao, F.: Some remarks on a fair exchange protocol. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol.\u00a01751, pp. 46\u201357. Springer, Heidelberg (2000)"},{"key":"22_CR41","first-page":"126","volume-title":"An efficient non-repudiation protocol","author":"J. Zhou","year":"1997","unstructured":"Zhou, J., Gollmann, D.: An efficient non-repudiation protocol, pp. 126\u2013132. IEEE Computer Society Press, Los Alamitos (1997)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02620-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T14:52:42Z","timestamp":1685026362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02620-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642026195","9783642026201"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02620-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}