{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T18:31:29Z","timestamp":1768069889388,"version":"3.49.0"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,5,28]],"date-time":"2009-05-28T00:00:00Z","timestamp":1243468800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1007\/s00145-009-9044-3","type":"journal-article","created":{"date-parts":[[2009,5,27]],"date-time":"2009-05-27T15:26:29Z","timestamp":1243437989000},"page":"572-615","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["New Approaches for Deniable Authentication"],"prefix":"10.1007","volume":"22","author":[{"given":"Mario","family":"Di Raimondo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rosario","family":"Gennaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,5,28]]},"reference":[{"key":"9044_CR1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/BFb0055736","volume-title":"Advances in Cryptology, Proc. of CRYPTO \u201998","author":"Y. Aumann","year":"1998","unstructured":"Y. Aumann, M. Rabin, Authentication, enhanced security and error correcting codes, in Advances in Cryptology, Proc. of CRYPTO \u201998. LNCS, vol. 1462 (Springer, Berlin, 1998), pp. 299\u2013303"},{"key":"9044_CR2","unstructured":"Y. Aumann, M. Rabin, Efficient deniable authentication of long messages, in International Conference on Theoretical Computer Science in Honor of Professor Manuel Blum\u2019s 60th Birthday, April 20\u201324, 1998. Available from: \n                    http:\/\/www.cs.cityu.edu.hk\/dept\/video.html"},{"key":"9044_CR3","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1007\/3-540-69053-0_33","volume-title":"Advances in Cryptology, Proceedings of EUROCRYPT \u201997","author":"N. Bari\u0107","year":"1997","unstructured":"N. Bari\u0107, B. Pfitzmann, Collision-free accumulators and fail-stop signature schemes without trees, in Advances in Cryptology, Proceedings of EUROCRYPT \u201997. LNCS, vol. 1233 (Springer, Berlin, 1997), pp. 480\u2013494"},{"key":"9044_CR4","first-page":"419","volume-title":"Proc. of 30th Symposium on Theory of Computing (STOC)","author":"M. Bellare","year":"1998","unstructured":"M. Bellare, R. Canetti, H. Krawczyk, A modular approach to the design and analysis of authentication and key exchange protocols, in Proc. of 30th Symposium on Theory of Computing (STOC) (ACM, New York, 1998), pp. 419\u2013428"},{"key":"9044_CR5","series-title":"LNCS","first-page":"56","volume-title":"Advances in Cryptology, Proc. of EUROCRYPT \u201904","author":"D. Boneh","year":"2004","unstructured":"D. Boneh, X. Boyen, Short signatures without random oracles, in Advances in Cryptology, Proc. of EUROCRYPT \u201904. LNCS, vol. 3027 (Springer, Berlin, 2004), pp. 56\u201373"},{"issue":"2","key":"9044_CR6","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"G. Brassard, D. Chaum, C. Cre\u2019peau, Minimum disclosure proofs of knowledge. J. Comput. Syst. Sci.\n                           37(2), 156\u2013189 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"9044_CR7","first-page":"639","volume-title":"Proc. of 28th Symposium on Theory of Computing (STOC)","author":"R. Canetti","year":"1996","unstructured":"R. Canetti, U. Feige, O. Goldreich, M. Naor, Adaptively secure multi-party computation, in Proc. of 28th Symposium on Theory of Computing (STOC) (ACM, New York, 1996), pp. 639\u2013648"},{"issue":"2","key":"9044_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"L. Carter","year":"1979","unstructured":"L. Carter, M.N. Wegman, Universal classes of hash functions. J. Comput. Syst. Sci.\n                           18(2), 143\u2013154 (1979)","journal-title":"J. Comput. Syst. Sci."},{"key":"9044_CR9","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/3-540-68697-5_14","volume-title":"Advances in Cryptology, Proceedings of CRYPTO \u201996","author":"R. Cramer","year":"1996","unstructured":"R. Cramer, I. Damgard, New generation of secure and practical RSA-based signatures, in Advances in Cryptology, Proceedings of CRYPTO \u201996. LNCS, vol. 1109 (Springer, Berlin, 1996), pp. 173\u2013185"},{"key":"9044_CR10","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BFb0055717","volume-title":"Advances in Cryptology, Proc. of CRYPTO \u201998","author":"R. Cramer","year":"1998","unstructured":"R. Cramer, V. Shoup, A practical public-key cryptosystem secure against adaptive chosen ciphertexts attacks, in Advances in Cryptology, Proc. of CRYPTO \u201998. LNCS, vol. 1462 (Springer, Berlin, 1998), pp. 13\u201325"},{"key":"9044_CR11","doi-asserted-by":"crossref","unstructured":"R. Cramer, V. Shoup, Signature scheme based on the strong RSA assumption, in Proc. of 6th ACM Conference of Computer and Communication Security (1999)","DOI":"10.1145\/319709.319716"},{"key":"9044_CR12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/3-540-46035-7_4","volume-title":"Advances in Cryptology, Proc. of EUROCRYPT \u201902","author":"R. Cramer","year":"2002","unstructured":"R. Cramer, V. Shoup, Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption, in Advances in Cryptology, Proc. of EUROCRYPT \u201902. LNCS, vol. 2332 (Springer, Berlin, 2002), pp. 45\u201364"},{"key":"9044_CR13","unstructured":"I. Damg\u00e5rd, J. Groth, Non-interactive and reusable non-malleable commitment schemes. in Proc. of 35th ACM Symp. on Theory of Computing (STOC\u201903), (2003), pp.\u00a0426\u2013437"},{"key":"9044_CR14","unstructured":"G. Di Crescenzo, Y. Ishai, R. Ostrovsky, Non-interactive and non-malleable commitment. in Proc. of 30th ACM Symp. on Theory of Computing (STOC\u201998), (1998), pp.\u00a0141\u2013150"},{"key":"9044_CR15","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/3-540-44987-6_4","volume-title":"Proc. of EUROCRYPT 2001","author":"G. Di Crescenzo","year":"2001","unstructured":"G. Di Crescenzo, J. Katz, R. Ostrovsky, A. Smith, Efficient and non-interactive non-malleable commitment, in Proc. of EUROCRYPT 2001. LNCS, vol. 2045 (Springer, Berlin, 2001), pp. 40\u201359"},{"issue":"6","key":"9044_CR16","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie, M.E. Hellman, New directions in cryptography. IEEE Trans. Inf. Theory\n                           22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9044_CR17","first-page":"400","volume-title":"ACM Conference on Computer and Communications Security (CCS\u201906)","author":"M. Di Raimondo","year":"2006","unstructured":"M. Di Raimondo, R. Gennaro, H. Krawczyk, Deniable authentication and key exchange, in ACM Conference on Computer and Communications Security (CCS\u201906) (ACM Press, New York, 2006), pp. 400\u2013409"},{"issue":"2","key":"9044_CR18","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D. Dolev","year":"2000","unstructured":"D. Dolev, C. Dwork, M. Naor, Non-Malleable cryptography. SIAM J. Comput.\n                           30(2), 391\u2013437 (2000)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"9044_CR19","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1145\/1039488.1039489","volume":"51","author":"C. Dwork","year":"2004","unstructured":"C. Dwork, M. Naor, A. Sahai, Concurrent zero-knowledge. J. ACM\n                           51(6), 851\u2013898 (2004). Preliminary version in STOC\u201998","journal-title":"J. ACM"},{"key":"9044_CR20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/3-540-39200-9_11","volume-title":"Advances in Cryptology, Proc. of EUROCRYPT \u201903","author":"J. Garay","year":"2003","unstructured":"J. Garay, P. MacKenzie, K. Yang, Strengthening zero-knowledge protocols using signatures, in Advances in Cryptology, Proc. of EUROCRYPT \u201903. LNCS, vol. 2656 (Springer, Berlin, 2003), pp. 177\u2013194"},{"key":"9044_CR21","series-title":"LNCS","volume-title":"Advances in Cryptology, Proc. of CRYPTO \u201904","author":"R. Gennaro","year":"2004","unstructured":"R. Gennaro, Multi-trapdoor commitments and their applications to proofs of knowledge secure under concurrent man-in-the-middle attacks, in Advances in Cryptology, Proc. of CRYPTO \u201904. LNCS, vol. 3152 (Springer, Berlin, 2004)"},{"key":"9044_CR22","unstructured":"R. Gennaro, V. Shoup, A note on an encryption scheme of Kurosawa and Desmedt, \n                    http:\/\/eprint.iacr.org\/2004\/194\/"},{"key":"9044_CR23","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/3-540-48910-X_9","volume-title":"Advances in Cryptology, Proc. of EUROCRYPT \u201999","author":"R. Gennaro","year":"1999","unstructured":"R. Gennaro, S. Halevi, T. Rabin, Secure hash-and-sign signatures without the random oracle, in Advances in Cryptology, Proc. of EUROCRYPT \u201999. LNCS, vol. 1592 (Springer, Berlin, 1999), pp. 123\u2013139"},{"issue":"3","key":"9044_CR24","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s001459900010","volume":"9","author":"O. Goldreich","year":"1996","unstructured":"O. Goldreich, A. Kahan, How to construct constant-round zero-knowledge proof systems for NP. J.\u00a0Cryptol.\n                           9(3), 167\u2013190 (1996)","journal-title":"J.\u00a0Cryptol."},{"key":"9044_CR25","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, A. Wigderson, Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems, in Proc. of 27th IEEE Annual Symposium on the Foundations of Computer Science, vol. 38, no. 1, July 1991, pp.\u00a0691\u2013729","DOI":"10.1145\/116825.116852"},{"issue":"2","key":"9044_CR26","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser, S. Micali, Probabilistic encryption. J. Comput. Syst. Sci.\n                           28(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"9044_CR27","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali, R. Rivest, A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput.\n                           17(2), 281\u2013308 (1988)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9044_CR28","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"S. Goldwasser, S. Micali, C. Rackoff, The knowledge complexity of interactive proof-systems. SIAM J. Comput.\n                           18(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"key":"9044_CR29","unstructured":"P. Gutman, Secure deletion of data from magnetic and solid-state memory, in Sixth USENIX Security Symposium Proceedings, San Jose, California, July 22\u201325, 1996"},{"key":"9044_CR30","doi-asserted-by":"crossref","unstructured":"D. Harkins, D. Carrel, (eds.) The Internet Key Exchange (IKE), RFC 2409, Nov. 1998","DOI":"10.17487\/rfc2409"},{"key":"9044_CR31","unstructured":"J. Herranz, D. Hofheinz, E. Kiltz, The Kurosawa\u2013Desmedt Key Encapsulation Is Not Chosen-Ciphertext Secure. IACR Cryptology ePrint Arhive, Report 2006\/207. Available at \n                    http:\/\/eprint.iacr.org\/2006\/207"},{"key":"9044_CR32","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/3-540-68339-9_13","volume-title":"Advances in Cryptology, Proc. of EUROCRYPT \u201996","author":"M. Jakobsson","year":"1996","unstructured":"M. Jakobsson, K. Sako, R. Impagliazzo, Designated verifier proofs and their applications, in Advances in Cryptology, Proc. of EUROCRYPT \u201996. LNCS, vol. 1070 (Springer, Berlin, 1996), pp. 143\u2013154"},{"key":"9044_CR33","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-39200-9_13","volume-title":"Advances in Cryptology, Proc. of EUROCRYPT \u201903","author":"J. Katz","year":"2003","unstructured":"J. Katz, Efficient and non-malleable proofs of plaintext knowledge and applications, in Advances in Cryptology, Proc. of EUROCRYPT \u201903. LNCS, vol. 2656 (Springer, Berlin, 2003), pp. 211\u2013228"},{"key":"9044_CR34","unstructured":"H. Krawczyk, SKEME: a versatile secure key exchange mechanism for Internet, in IEEE Symposium on Network and Distributed System Security (SNDSS \u201996) (1996)"},{"key":"9044_CR35","series-title":"LNCS","first-page":"400","volume-title":"Advances in cryptology, Proc. of CRYPTO \u201903","author":"H. Krawczyk","year":"2003","unstructured":"H. Krawczyk, SIGMA: The \u2018SiGn-and-MAC\u2019 approach to authenticated Diffie\u2013Hellman and its use in the IKE protocols, in Advances in cryptology, Proc. of CRYPTO \u201903. LNCS, vol. 2729 (Springer, Berlin, 2003), pp. 400\u2013425. Available at \n                    http:\/\/www.research.ibm.com\/security\/sigma.ps"},{"key":"9044_CR36","unstructured":"H. Krawczyk, T. Rabin, Chameleon hashing and signatures, in Proc. of Network and Distributed Systems Security Symposium (NDSS) 2000 (Internet Society, 2000), pp.\u00a0143\u2013154"},{"key":"9044_CR37","series-title":"LNCS","first-page":"426","volume-title":"Advances in Cryptology, Proc. of CRYPTO \u201904","author":"K. Kurosawa","year":"2004","unstructured":"K. Kurosawa, Y. Desmedt, A new paradigm of hybrid encryption scheme, in Advances in Cryptology, Proc. of CRYPTO \u201904. LNCS, vol. 3152 (Springer, Berlin, 2004), pp. 426\u2013442"},{"key":"9044_CR38","unstructured":"L. Lamport, Constructing digital signatures from a one-way function. Technical Report SRI Intl. CSL 98 (1979)"},{"key":"9044_CR39","series-title":"LNCS","first-page":"382","volume-title":"Advances in Cryptology, Proc. of EUROCRYPT \u201904","author":"P. MacKenzie","year":"2004","unstructured":"P. MacKenzie, K. Yang, On simulation-sound commitments, in Advances in Cryptology, Proc. of EUROCRYPT \u201904. LNCS, vol. 3027 (Springer, Berlin, 2004), pp. 382\u2013400"},{"key":"9044_CR40","unstructured":"W. Mao, K.G. Paterson, On the plausible deniability feature of Internet protocols. Manuscript"},{"key":"9044_CR41","series-title":"LNCS","first-page":"481","volume-title":"Advances in Cryptology, Proc. of CRYPTO \u201902","author":"M. Naor","year":"2002","unstructured":"M. Naor, Deniable ring authentication, in Advances in Cryptology, Proc. of CRYPTO \u201902. LNCS, vol. 2442 (Springer, Berlin, 2002), pp. 481\u2013498"},{"key":"9044_CR42","first-page":"427","volume-title":"Proc. of 22nd Symposium on Theory of Computing (STOC)","author":"M. Naor","year":"1990","unstructured":"M. Naor, M. Yung, Public-key cryptosystems provably secure against chosen ciphertext attacks, in Proc. of 22nd Symposium on Theory of Computing (STOC) (ACM, New York, 1990), pp. 427\u2013437"},{"key":"9044_CR43","series-title":"LNCS","first-page":"316","volume-title":"Advances in Cryptology, Proc. of CRYPTO \u201903","author":"R. Pass","year":"2003","unstructured":"R. Pass, On deniability in the common reference string and random oracle model, in Advances in Cryptology, Proc. of CRYPTO \u201903. LNCS, vol. 2729 (Springer, Berlin, 2003), pp. 316\u2013337"},{"issue":"2","key":"9044_CR44","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"R. Rivest, A. Shamir, L. Adelman, A method for obtaining digital signature and public key cryptosystems. Commun. ACM\n                           21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"9044_CR45","series-title":"LNCS","first-page":"552","volume-title":"Advances in Cryptology, Proc. of ASIACRYPT\u00a0\u201901","author":"R. Rivest","year":"2001","unstructured":"R. Rivest, A. Shamir, Y. Tauman, How to leak a secret, in Advances in Cryptology, Proc. of ASIACRYPT\u00a0\u201901. LNCS, vol. 2248 (Springer, Berlin, 2001), pp. 552\u2013565"},{"key":"9044_CR46","doi-asserted-by":"crossref","unstructured":"A. Shamir, On the generation of cryptographically strong pseudorandom sequences, in ACM Transactions on Computer Systems (TOCS), vol. 1, no. 1, (ACM, New York, 1983), pp. 38\u201344","DOI":"10.1145\/357353.357357"},{"key":"9044_CR47","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/3-540-45539-6_19","volume-title":"Advances in Cryptology, Proc. of EUROCRYPT \u201900","author":"V. Shoup","year":"2000","unstructured":"V. Shoup, Using hash functions as a hedge against chosen ciphertext attack, in Advances in Cryptology, Proc. of EUROCRYPT \u201900. LNCS, vol. 1807 (Springer, Berlin, 2000), pp. 275\u2013288"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-009-9044-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-009-9044-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-009-9044-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-009-9044-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:42:27Z","timestamp":1586335347000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-009-9044-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,28]]},"references-count":47,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["9044"],"URL":"https:\/\/doi.org\/10.1007\/s00145-009-9044-3","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,5,28]]},"assertion":[{"value":"30 May 2006","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2009","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 May 2009","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}