{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T23:42:57Z","timestamp":1769298177985,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540244547","type":"print"},{"value":"9783540305804","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30580-4_15","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T19:51:09Z","timestamp":1278359469000},"page":"216-233","source":"Crossref","is-referenced-by-count":4,"title":["The Sampling Twice Technique for the RSA-Based Cryptosystems with Anonymity"],"prefix":"10.1007","author":[{"given":"Ryotaro","family":"Hayashi","sequence":"first","affiliation":[]},{"given":"Keisuke","family":"Tanaka","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Bellare, M., Boldyreva, A., Desai, A., Pointcheval, D.: Key-Privacy in Public-Key Encryption. In: [18], pp. 566\u2013582; Full version of this paper, available via http:\/\/www-cse.ucsd.edu\/users\/mihir\/","DOI":"10.1007\/3-540-45682-1_33"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Optimal Asymmetric Encryption \u2013 How to Encrypt with RSA. In: [19], pp. 92\u2013111","DOI":"10.1007\/BFb0053428"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/3-540-44647-8_16","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"E. Fujisaki","year":"2001","unstructured":"Fujisaki, E., Okamoto, T., Pointcheval, D., Stern, J.: RSA-OAEP is secure under the RSA assumption. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 260\u2013274. Springer, Heidelberg (2001)"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Krawczyk, H.: SKEME: A Versatile Secure Key Exchange Mechanism for Internet. In: Proceedings of the 1996 Internet Society Symposium on Network and Distributed System Security, San Diego, CA, USA, pp. 114\u2013127 (1996)","DOI":"10.1109\/NDSS.1996.492418"},{"key":"15_CR5","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 \u2013 EUROCRYPT 2001","author":"J. Camenisch","year":"2001","unstructured":"Camenisch, J., Lysyanskaya, A.: Efficient Non-Transferable Anonymous Multi- Show Credential System with Optional Anonymity Revocation. In: Pfitzmann, B. (ed.) Advances in Cryptology \u2013 EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 93\u2013118. Springer, Heidelberg (2001)"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-540-46588-1_28","volume-title":"Public Key Cryptography","author":"K. Sako","year":"2000","unstructured":"Sako, K.: An auction protocol which hides bids of losers. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol.\u00a01751, pp. 422\u2013432. Springer, Heidelberg (2000)"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/0-387-34805-0_20","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"D. Chaum","year":"1990","unstructured":"Chaum, D., van Antwerpen, H.: Undeniable signatures. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 212\u2013216. Springer, Heidelberg (1990)"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1007\/3-540-46877-3_41","volume-title":"Advances in Cryptology - EUROCRYPT \u201990","author":"D. Chaum","year":"1991","unstructured":"Chaum, D.: Zero-knowledge undeniable signatures. In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol.\u00a0473, pp. 458\u2013464. Springer, Heidelberg (1991)"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Chaum, D.: Designated Confirmer Signatures. In: [19], pp. 86\u201391","DOI":"10.1007\/BFb0053427"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-36563-X_6","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"S.D. Galbraith","year":"2003","unstructured":"Galbraith, S.D., Mao, W.: Invisibility and anonymity of undeniable and confirmer signatures. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 80\u201397. Springer, Heidelberg (2003)"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/3-540-49264-X_12","volume-title":"Advances in Cryptology - EUROCRYPT \u201995","author":"Y.G. Desmedt","year":"1995","unstructured":"Desmedt, Y.G.: Securing traceability of ciphertexts - towards a secure software key escrow system. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol.\u00a0921, pp. 147\u2013157. Springer, Heidelberg (1995)"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Rivest, R.L., Shamir, A., Tauman, Y.: How to Leak a Secret. In:[18], 552\u2013565","DOI":"10.1007\/3-540-45682-1_32"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-540-24632-9_21","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"R. Hayashi","year":"2004","unstructured":"Hayashi, R., Okamoto, T., Tanaka, K.: An RSA family of trap-door permutations with a common domain and its applications. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol.\u00a02947, pp. 291\u2013304. Springer, Heidelberg (2004)"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-45760-7_14","volume-title":"Topics in Cryptology - CT-RSA 2002","author":"S.D. Galbraith","year":"2002","unstructured":"Galbraith, S.D., Mao, W., Paterson, K.G.: RSA-based undeniable signatures for general moduli. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol.\u00a02271, pp. 200\u2013217. Springer, Heidelberg (2002)"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/3-540-68339-9_13","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"M. Jakobsson","year":"1996","unstructured":"Jakobsson, M., Sako, K., Impagliazzo, R.: Designated verifier proofs and their applications. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 143\u2013154. Springer, Heidelberg (1996)"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/BFb0052232","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"R. Gennaro","year":"1997","unstructured":"Gennaro, R., Krawczyk, H., Rabin, T.: RSA-based undeniable signatures. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 132\u2013149. Springer, Heidelberg (1997)"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/3-540-45708-9_30","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"E. Bresson","year":"2002","unstructured":"Bresson, E., Stern, J., Szydlo, M.: Threshold ring signatures and applications to ad-hoc groups. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 465\u2013480. Springer, Heidelberg (2002)"},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","volume-title":"ASIACRYPT 2001","year":"2001","unstructured":"Boyd, C. (ed.): ASIACRYPT 2001. LNCS, vol.\u00a02248. Springer, Heidelberg (2001)"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","volume-title":"EUROCRYPT 1994","year":"1994","unstructured":"De Santis, A. (ed.): EUROCRYPT 1994. LNCS, vol.\u00a0950. Springer, Heidelberg (1994)"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography - PKC 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30580-4_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:24:23Z","timestamp":1605759863000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30580-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540244547","9783540305804"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30580-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}