{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T01:12:23Z","timestamp":1779325943380,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540219354","type":"print"},{"value":"9783540246763","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24676-3_35","type":"book-chapter","created":{"date-parts":[[2010,8,4]],"date-time":"2010-08-04T04:33:13Z","timestamp":1280896393000},"page":"590-608","source":"Crossref","is-referenced-by-count":30,"title":["Handcuffing Big Brother: an Abuse-Resilient Transaction Escrow Scheme"],"prefix":"10.1007","author":[{"given":"Stanislaw","family":"Jarecki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vitaly","family":"Shmatikov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Asokan, N., Shoup, V., Waidner, M.: Asynchronous protocols for optimistic fair exchange. In: Proc. IEEE Symposium on Security and Privacy, pp. 86\u201399 (1998)","DOI":"10.1109\/SECPRI.1998.674826"},{"key":"35_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/3-540-45682-1_33","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"M. Bellare","year":"2001","unstructured":"Bellare, M., Boldyreva, A., Desai, A., Pointcheval, D.: Key-privacy in public-key encryption. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 566\u2013582. Springer, Heidelberg (2001)"},{"key":"35_CR3","unstructured":"Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Searchable public key encryption. IACR 2003\/195 (2003)"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Boneh, D.: The decisional Diffie-Hellman problem. In: Proc. 3rd Algorithmic Number Theory Symposium, pp. 48\u201363 (1998)","DOI":"10.1007\/BFb0054851"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Proc. ACM Conference on Computer and Communications Security, pp. 62\u201373 (1993)","DOI":"10.1145\/168588.168596"},{"key":"35_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/BFb0053428","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"M. Bellare","year":"1995","unstructured":"Bellare, M., Rogaway, P.: Optimal asymmetric encryption. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 92\u2013111. Springer, Heidelberg (1995)"},{"key":"35_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/3-540-44448-3_25","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"J. Camenisch","year":"2000","unstructured":"Camenisch, J., Damgard, I.: Verifiable encryption, group encryption, and their applications to group signatures and signature sharing schemes. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 331\u2013345. Springer, Heidelberg (2000)"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Cachin, C., Kursawe, K., Shoup, V.: Random oracles in Constantinople. In: Proc. of PODC 2000, pp. 123\u2013132 (2000)","DOI":"10.1145\/343477.343531"},{"key":"35_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-44987-6_7","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"J. Camenisch","year":"2001","unstructured":"Camenisch, J., Lysyanskaya, A.: An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 93\u2013118. Springer, Heidelberg (2001)"},{"key":"35_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/3-540-36413-7_20","volume-title":"Security in Communication Networks","author":"J. Camenish","year":"2003","unstructured":"Camenish, J., Lysyanskaya, A.: A signature scheme with efficient protocols. In: Cimato, S., Galdi, C., Persiano, G. (eds.) SCN 2002. LNCS, vol.\u00a02576, pp. 268\u2013289. Springer, Heidelberg (2003)"},{"key":"35_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/3-540-48910-X_8","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"J. Camenisch","year":"1999","unstructured":"Camenisch, J., Michels, M.: Proving in zero-knowledge that a number is the product of two safe primes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 107\u2013122. Springer, Heidelberg (1999)"},{"key":"35_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-48071-4_7","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"D. Chaum","year":"1993","unstructured":"Chaum, D., Pedersen, T.: Wallet databases with observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 89\u2013105. Springer, Heidelberg (1993)"},{"key":"35_CR13","unstructured":"Camenisch, J., Stadler, M.: Proof systems for general statements about discrete logarithms. Technical Report TR 260, ETH Z\u00fcrich (March 1997)"},{"key":"35_CR14","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Shoup, V.: Verifiable encryption and decryption of discrete logarithms. In: Proc. of Crypto 2003, pp. 126\u2013144 (2003)","DOI":"10.1007\/978-3-540-45146-4_8"},{"key":"35_CR15","unstructured":"Damgard, I., Fujisaki, E.: An integer commitment scheme based on groups with hidden order. IACR 2001\/064 (2001)"},{"key":"35_CR16","doi-asserted-by":"crossref","unstructured":"Dodis, Y.: Efficient construction of (distributed) verifiable random functions. In: Proc. Public Key Cryptography 2003, pp. 1\u201317 (2003)","DOI":"10.1007\/3-540-36288-6_1"},{"key":"35_CR17","doi-asserted-by":"crossref","unstructured":"Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: Proc. FOCS 1987, pp. 427\u2013438 (1987)","DOI":"10.1109\/SFCS.1987.4"},{"key":"35_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1007\/3-540-48910-X_30","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"M. Fischlin","year":"1999","unstructured":"Fischlin, M.: Pseudorandom function tribe ensembles based on one-way permutations: improvements and applications. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 432\u2013445. Springer, Heidelberg (1999)"},{"key":"35_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/BFb0054115","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"E. Fujisaki","year":"1998","unstructured":"Fujisaki, E., Okamoto, T.: A practical and porvably secure scheme for publicly verifiable secret sharing and its applications. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 32\u201346. Springer, Heidelberg (1998)"},{"key":"35_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/3-540-48910-X_21","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"R. Gennaro","year":"1999","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure distributed key generation for discrete-log based cryptosystems. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 295\u2013310. Springer, Heidelberg (1999)"},{"key":"35_CR21","doi-asserted-by":"crossref","unstructured":"Jarecki, S., Shmatikov, V.: Handcuffing Big Brother: An abuse-resilient transaction escrow scheme. IACR eprint (2004)","DOI":"10.1007\/978-3-540-24676-3_35"},{"key":"35_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1007\/3-540-44750-4_17","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"J. Kilian","year":"1995","unstructured":"Kilian, J., Leighton, F.T.: Fair cryptosystems revisited. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 208\u2013221. Springer, Heidelberg (1995)"},{"key":"35_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/3-540-45708-9_38","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"A. Lysyanskaya","year":"2002","unstructured":"Lysyanskaya, A.: Unique signatures and verifiable random functions from the DH-DDH separation. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 597\u2013612. Springer, Heidelberg (2002)"},{"key":"35_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/3-540-48071-4_9","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"S. Micali","year":"1993","unstructured":"Micali, S.: Fair public-key cryptosystems. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 113\u2013138. Springer, Heidelberg (1993)"},{"key":"35_CR25","doi-asserted-by":"crossref","unstructured":"Micali, S., Rabin, M., Vadhan, S.: Verifiable random functions. In: Proc. FOCS 1999, pp. 120\u2013130 (1999)","DOI":"10.1109\/SFFCS.1999.814584"},{"key":"35_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/3-540-48910-X_23","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"M. Naor","year":"1999","unstructured":"Naor, M., Pinkas, B., Reingold, O.: Distributed pseudo-random functions and KDCs. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 327\u2013346. Springer, Heidelberg (1999)"},{"key":"35_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-44647-8_15","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"V. Shoup","year":"2001","unstructured":"Shoup, V.: OAEP reconsidered. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 239\u2013259. Springer, Heidelberg (2001)"},{"key":"35_CR28","unstructured":"Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: Proc. IEEE Symposium on Security and Privacy, pp. 44\u201355 (2000)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - EUROCRYPT 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24676-3_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:52:07Z","timestamp":1605761527000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24676-3_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540219354","9783540246763"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24676-3_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}