{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:01:14Z","timestamp":1725566474091},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642140808"},{"type":"electronic","value":"9783642140815"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14081-5_12","type":"book-chapter","created":{"date-parts":[[2010,9,24]],"date-time":"2010-09-24T16:22:49Z","timestamp":1285345369000},"page":"182-199","source":"Crossref","is-referenced-by-count":4,"title":["A Multi-trapdoor Commitment Scheme from the RSA Assumption"],"prefix":"10.1007","author":[{"given":"Ryo","family":"Nishimaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eiichiro","family":"Fujisaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keisuke","family":"Tanaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","first-page":"345","volume-title":"FOCS","author":"B. Barak","year":"2002","unstructured":"Barak, B.: Constant-round coin-tossing with a man in the middle or realizing the shared random string model. In: FOCS, pp. 345\u2013355. IEEE Computer Society, Los Alamitos (2002)"},{"key":"12_CR2","unstructured":"Barak, B.: Non-Black-Box Techniques in Cryptography. PhD thesis, Department of Computer Science and Applied Mathematics, Weizmann Institute of Science (2004)"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/3-540-48071-4_28","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Goldreich, O.: On defining proofs of knowledge. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 390\u2013420. Springer, Heidelberg (1993)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-540-89255-7_9","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"M. Bellare","year":"2008","unstructured":"Bellare, M., Ristov, T.: Hash Functions from Sigma Protocols and Improvements to VSH. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol.\u00a05350, pp. 125\u2013142. Springer, Heidelberg (2008)"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BFb0034843","volume-title":"Advances in Cryptology - ASIACRYPT \u201996","author":"D. Bleichenbacher","year":"1996","unstructured":"Bleichenbacher, D., Maurer, U.: On the Efficiency of One-Time Digital Signatures. In: Kim, K.-c., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol.\u00a01163, pp. 145\u2013158. Springer, Heidelberg (1996)"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","first-page":"363","volume-title":"STACS 96","author":"D. Bleichenbacher","year":"1996","unstructured":"Bleichenbacher, D., Maurer, U.: Optimal Tree-Based One-Time Digital Signature Schemes. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol.\u00a01046, pp. 363\u2013374. Springer, Heidelberg (1996)"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"R. Cramer","year":"1994","unstructured":"Cramer, R., Damg\u00e5rd, I., Schoenmakers, B.: Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 174\u2013187. Springer, Heidelberg (1994)"},{"key":"12_CR8","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1145\/780542.780605","volume-title":"STOC","author":"I. Damg\u00e5rd","year":"2003","unstructured":"Damg\u00e5rd, I., Groth, J.: Non-interactive and reusable non-malleable commitment schemes. In: STOC, pp. 426\u2013437. ACM, New York (2003)"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Di Crescenzo, G., Ishai, Y., Ostrovsky, R.: Non-interactive and non-malleable commitment. In: STOC, pp. 141\u2013150 (1998)","DOI":"10.1145\/276698.276722"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/3-540-44987-6_4","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"G. Crescenzo Di","year":"2001","unstructured":"Di Crescenzo, G., Katz, J., Ostrovsky, R., Smith, A.: Efficient and Non-interactive Non-malleable Commitment. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 40\u201359. Springer, Heidelberg (2001)"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/978-3-540-85174-5_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"Y. Dodis","year":"2008","unstructured":"Dodis, Y., Shoup, V., Walfish, S.: Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 515\u2013535. Springer, Heidelberg (2008)"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D. Dolev","year":"2000","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography. SIAM J. Computing\u00a030, 391\u2013437 (2000)","journal-title":"SIAM J. Computing"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U. Feige","year":"1988","unstructured":"Feige, U., Fiat, A., Shamir, A.: Zero-knowledge proofs of identity. Journal of Cryptology\u00a01, 77\u201394 (1988)","journal-title":"Journal of Cryptology"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/3-540-44598-6_26","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"M. Fischlin","year":"2000","unstructured":"Fischlin, M., Fischlin, R.: Efficient Non-Malleable Commitment Schemes. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 413\u2013431. Springer, Heidelberg (2000)"},{"issue":"4","key":"12_CR15","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/s00145-009-9045-2","volume":"22","author":"M. Fischlin","year":"2009","unstructured":"Fischlin, M., Fischlin, R.: Efficient Non-Malleable Commitment Schemes. Journal of Cryptology\u00a022(4), 530\u2013571 (2009)","journal-title":"Journal of Cryptology"},{"issue":"2","key":"12_CR16","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s00145-005-0307-3","volume":"19","author":"J.A. Garay","year":"2006","unstructured":"Garay, J.A., MacKenzie, P.D., Yang, K.: Strengthening zero-knowledge protocols using signatures. J. Cryptology\u00a019(2), 169\u2013209 (2006); Preliminary version appeared in Eurocrypt 2003","journal-title":"J. Cryptology"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/978-3-540-28628-8_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"R. Gennaro","year":"2004","unstructured":"Gennaro, R.: Multi-trapdoor Commitments and Their Applications to Proofs of Knowledge Secure Under Concurrent Man-in-the-Middle Attacks. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 220\u2013236. Springer, Heidelberg (2004)"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Tools, vol.\u00a01. Cambridge Press, New York (2001)","DOI":"10.1017\/CBO9780511546891"},{"issue":"3","key":"12_CR19","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1145\/116825.116852","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that Yield Nothing But Their Validity, or All Languages in NP Have Zero-Knowledge Proof Systems. Journal of the ACM\u00a038(3), 691\u2013729 (1991); preliminary version appeared in FOCS 1986","journal-title":"Journal of the ACM"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/0-387-34799-2_16","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"L.C. Guillou","year":"1990","unstructured":"Guillou, L.C., Quisquater, J.-J.: A \u201cparadoxical\u201d Indentity-Based Signature Scheme Resulting From Zero-Knowledge. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 216\u2013231. Springer, Heidelberg (1990)"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1007\/978-3-642-03356-8_38","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"S. Hohenberger","year":"2009","unstructured":"Hohenberger, S., Waters, B.: Short and Stateless Signatures from the RSA Assumption. In: Halevi, S. (ed.) Advances in Cryptology - CRYPTO 2009. LNCS, vol.\u00a05677, pp. 654\u2013670. Springer, Heidelberg (2009)"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography. Chapman & Hall\/CRC Press (2007)","DOI":"10.1201\/9781420010756"},{"key":"12_CR23","unstructured":"Kravitz, D.W.: Digital signature algorithm. U.S. Patent 5,231,668 (July 27, 1993)"},{"key":"12_CR24","unstructured":"Lamport, L.: Constructing digital signatures from a one-way function. Technical report, SRI Intl. (1979) CSL 98"},{"key":"12_CR25","first-page":"189","volume-title":"STOC","author":"H. Lin","year":"2009","unstructured":"Lin, H., Pass, R.: Non-malleability amplification. In: STOC, pp. 189\u2013198. ACM, New York (2009)"},{"key":"12_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-540-24676-3_23","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"P.D. MacKenzie","year":"2004","unstructured":"MacKenzie, P.D., Yang, K.: On Simulation-Sound Trapdoor Commitments. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 382\u2013400. Springer, Heidelberg (2004)"},{"issue":"2","key":"12_CR27","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M. Naor","year":"1991","unstructured":"Naor, M.: Bit commitment using pseudorandomness. J. Cryptology\u00a04(2), 151\u2013158 (1991)","journal-title":"J. Cryptology"},{"key":"12_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/978-3-540-85174-5_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"O. Pandey","year":"2008","unstructured":"Pandey, O., Pass, R., Vaikuntanathan, V.: Adaptive One-Way Functions and Applications. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 57\u201374. Springer, Heidelberg (2008)"},{"issue":"2","key":"12_CR29","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1137\/060671553","volume":"38","author":"R. Pass","year":"2008","unstructured":"Pass, R., Rosen, A.: New and Improved Constructions of Nonmalleable Cryptographic Protocols. SIAM J. Comput.\u00a038(2), 702\u2013752 (2008)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"12_CR30","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/357353.357357","volume":"1","author":"A. Shamir","year":"1983","unstructured":"Shamir, A.: On the Generation of Cryptographically Strong Pseudorandom Sequences. ACM Trans. Comput. Syst.\u00a01(1), 38\u201344 (1983)","journal-title":"ACM Trans. Comput. Syst."},{"key":"12_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/11426639_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"B. Waters","year":"2005","unstructured":"Waters, B.: Efficient identity-based encryption without random oracles. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 114\u2013127. Springer, Heidelberg (2005)"}],"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-14081-5_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T13:37:29Z","timestamp":1685799449000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14081-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642140808","9783642140815"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14081-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}