{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:12Z","timestamp":1760202612799,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137075"},{"type":"electronic","value":"9783642137082"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13708-2_20","type":"book-chapter","created":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T11:56:06Z","timestamp":1277294166000},"page":"329-348","source":"Crossref","is-referenced-by-count":14,"title":["Deniable Internet Key Exchange"],"prefix":"10.1007","author":[{"given":"Andrew C.","family":"Yao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunlei","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/978-3-540-28628-8_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"M. Bellare","year":"2004","unstructured":"Bellare, M., Palacio, A.: The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 273\u2013289. Springer, Heidelberg (2004)"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-540-30539-2_4","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"M. Bellare","year":"2004","unstructured":"Bellare, M., Palacio, A.: Towards Plaintext-Aware Public-Key Encryption without Random Oracles. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol.\u00a03329, pp. 48\u201362. Springer, Heidelberg (2004)"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","first-page":"273","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"M. Bellare","year":"1994","unstructured":"Bellare, M., Rogaway, P.: Entity Authentication and Key Distribution. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 273\u2013289. Springer, Heidelberg (1994)"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In: ACM Conference on Computer and Communications Security, pp. 62\u201373 (1993)","DOI":"10.1145\/168588.168596"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Canetti, R., Feige, U., Goldreich, O., Naor, M.: Adaptively Secure Multi-Party Computation. In: ACM Symposium on Theory of Computing, pp. 639\u2013648 (1996)","DOI":"10.1145\/237814.238015"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-44987-6_28","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"R. Canetti","year":"2001","unstructured":"Canetti, R., Krawczyk, H.: Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, p. 453. Springer, Heidelberg (2001)"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-45708-9_10","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"R. Canetti","year":"2002","unstructured":"Canetti, R., Krawczyk, H.: Security Analysis of IKE\u2019s Signature-Based Key-Exchange Protocol. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 143\u2013161. Springer, Heidelberg (2002)"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Canetti, R., Kilian, J., Petrank, E., Rosen, A.: Black-Box Concurrent Zero-Knowledge Requires \u03a9\u0303(log n) Rounds. In: ACM STOC 2001, pp. 570\u2013579 (2001)","DOI":"10.1145\/380752.380852"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/3-540-46766-1_36","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"I. Damg\u00e5rd","year":"1992","unstructured":"Damg\u00e5rd, I.: Towards Practical Public-Key Systems Secure Against Chosen Ciphertext Attacks. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 445\u2013456. Springer, Heidelberg (1992)"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/11761679_18","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"A. Dent","year":"2006","unstructured":"Dent, A.: Cramer-Shoup Encryption Scheme is Plantext Aware in the Standard Model. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 289\u2013307. Springer, Heidelberg (2006)"},{"key":"20_CR11","first-page":"112","volume-title":"Proc. of 12nd ACM Conference on Computer and Communications Security (ACM CCS\u201905)","author":"M. Raimondo Di","year":"2005","unstructured":"Di Raimondo, M., Gennaro, R.: New Approaches for Deniable Authentication. In: Proc. of 12nd ACM Conference on Computer and Communications Security (ACM CCS\u201905), pp. 112\u2013121. ACM Press, New York (2005)"},{"key":"#cr-split#-20_CR12.1","doi-asserted-by":"crossref","unstructured":"Di Raimondo, M., Gennaro, R., Krawczyk, H.: Deniable Authentication and Key Exchange. In: ACM CCS'06, pp. 466-475 (2006)","DOI":"10.1145\/1180405.1180454"},{"key":"#cr-split#-20_CR12.2","unstructured":"Full version appears in Cryptology ePrint Archive Report No. 2006\/280"},{"issue":"6","key":"20_CR13","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New Directions in Cryptography. IEEE Transactions on Information Theory\u00a022(6), 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-642-00457-5_10","volume-title":"Theory of Cryptography","author":"Y. Dodis","year":"2009","unstructured":"Dodis, Y., Katz, J., Smith, A., Walfish, S.: Composability and On-line Deniability of Authentication. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 146\u2013162. Springer, Heidelberg (2009)"},{"issue":"2","key":"20_CR15","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 Journal on Computing\u00a030(2), 391\u2013437 (2000); Preliminary version in ACM Symposium on Theory of Computing, pp. 542\u2013552 (1991)","journal-title":"SIAM Journal on Computing"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M., Sahai, A.: Concurrent Zero-Knowledge. In: ACM Symposium on Theory of Computing, pp. 409\u2013418 (1998)","DOI":"10.1145\/276698.276853"},{"key":"20_CR17","unstructured":"FIPS Pub 186-2, Digital Signature Standard (DSS), Federal Information Processing Standards Publication 186-2, US Department of Commerce\/National Institute of Standard and Technology, Githersburg, Maryland, USA (January 27, 2000)"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to Play Any Mental Game. In: ACM Symposium on Theory of Computing, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof-Systems. In: ACM Symposium on Theory of Computing, pp. 291\u2013304 (1985)","DOI":"10.1145\/22145.22178"},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1007\/BFb0055744","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"S. Hada","year":"1998","unstructured":"Hada, S., Tanaka, T.: On the Existence of 3-Round Zero-Knowledge Protocols. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 408\u2013423. Springer, Heidelberg (1998)"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Harkins, D., Carreal, D. (eds.): The Internet Key-Exchange (IKE), RFC 2409 (November 1998)","DOI":"10.17487\/rfc2409"},{"key":"20_CR22","unstructured":"Kaufman, C.: Internet Key Exchange (IKEv2) Protocol. The Internet Engineering Task Force: INTERNET-DRAFT (October 2002)"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Kent, S., Atkinson, R.: Security Architecture for the Internet Protocol. Request for Comments 2401 (1998)","DOI":"10.17487\/rfc2401"},{"key":"20_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-540-45146-4_24","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"H. Krawczyk","year":"2003","unstructured":"Krawczyk, H.: SIGMA: the \u201cSIGn-and-MAc\u201d Approach to Authenticated Diffie-Hellman and Its Use in the IKE-Protocols. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 400\u2013425. Springer, Heidelberg (2003)"},{"key":"20_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1007\/11535218_33","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"H. Krawczyk","year":"2005","unstructured":"Krawczyk, H.: HMQV: A High-Performance Secure Diffie-Hellman Protocol. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 546\u2013566. Springer, Heidelberg (2005)"},{"key":"20_CR26","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1023\/A:1022595222606","volume":"28","author":"L. Law","year":"2003","unstructured":"Law, L., Menezes, A., Qu, M., Solinas, J., Vanstone, S.: An Efficient Protocol for Authenticated Key Agreement. Designs, Codes and Cryptography\u00a028, 119\u2013134 (2003)","journal-title":"Designs, Codes and Cryptography"},{"key":"20_CR27","doi-asserted-by":"crossref","unstructured":"Lindell, Y.: General Composition and Universal Composability in Secure Multi-Party Computation. In: IEEE Symposium on Foundations of Computer Science, pp. 394\u2013403 (2003)","DOI":"10.1109\/SFCS.2003.1238213"},{"issue":"2","key":"20_CR28","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/s00145-007-9015-5","volume":"21","author":"Y. Lindell","year":"2008","unstructured":"Lindell, Y.: Lower Bounds and Impossibility Results for Concurrenet Self Composition. Journal of Cryptology\u00a021(2), 200\u2013249 (2008)","journal-title":"Journal of Cryptology"},{"key":"20_CR29","volume-title":"Modern Cryptography: Theory and Practice","author":"W. Mao","year":"2004","unstructured":"Mao, W.: Modern Cryptography: Theory and Practice. Prentice Hall PTR, Englewood Cliffs (2004)"},{"key":"20_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/3-540-68697-5_21","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"U. Maurer","year":"1996","unstructured":"Maurer, U., Wolf, S.: Diffie-hellman oracles. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 268\u2013282. Springer, Heidelberg (1996)"},{"key":"20_CR31","unstructured":"Menezes, A.: Another Look at HMQV. Cryptology ePrint Archive, Report No. 2005\/205"},{"issue":"2","key":"20_CR32","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1145\/972639.972643","volume":"1","author":"M. Naor","year":"2004","unstructured":"Naor, M., Reingold, O.: Number-Theoretic Constructions of Efficient Pseudo-Random Functions. Journal of the ACM\u00a01(2), 231\u2013262 (2004)","journal-title":"Journal of the ACM"},{"key":"20_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-45708-9_8","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J.B. Nielsen","year":"2002","unstructured":"Nielsen, J.B.: Separating random oracle proofs from complexity theoretic proofs: The non-committing encryption case. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 111\u2013126. Springer, Heidelberg (2002)"},{"key":"20_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-44586-2_8","volume-title":"Public Key Cryptography","author":"T. Okamoto","year":"2001","unstructured":"Okamoto, T., Pointcheval, D.: The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 104\u2013118. Springer, Heidelberg (2001)"},{"key":"20_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-540-45146-4_19","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"R. Pass","year":"2003","unstructured":"Pass, R.: On Deniabililty in the Common Reference String and Random Oracle Models. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 316\u2013337. Springer, Heidelberg (2003)"},{"key":"20_CR36","doi-asserted-by":"crossref","unstructured":"Pass, R., Rosen, A.: New and Improved Constructions of Non-Malleable Cryptographic Protocols. In: ACM Symposium on Theory of Computing, pp. 533\u2013542 (2005)","DOI":"10.1145\/1060590.1060670"},{"key":"20_CR37","doi-asserted-by":"crossref","unstructured":"Pass, R., Rosen, A.: Concurrent Non-Malleable Commitments. In: IEEE Symposium on Foundations of Computer Science, pp. 563\u2013572 (2005)","DOI":"10.1109\/SFCS.2005.27"},{"key":"20_CR38","doi-asserted-by":"crossref","unstructured":"Stinson, D.R., Wu, J.: An Efficient and Secure Two-Flow Zero-Knowledge Identification Protocol. Cryptology ePring Archive, Report 2006\/337","DOI":"10.1515\/JMC.2007.010"},{"key":"20_CR39","unstructured":"Stinson, D.R., Wu, J.: A Zero-Knowledge Identification and Key Agreement Protocol. Cryptology ePring Archive, Report 2007\/116"},{"key":"20_CR40","unstructured":"Yao, A.C., Yung, M., Zhao, Y.: Adaptive Concurrent Non-Malleability with Bare Public-Keys. Cryptology ePrint Archive, Report 2010\/107"},{"key":"20_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/11681878_2","volume-title":"Theory of Cryptography","author":"M. Yung","year":"2006","unstructured":"Yung, M., Zhao, Y.: Interactive Zero-Knowledge with Restricted Random Oracles. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 21\u201340. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13708-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T05:28:29Z","timestamp":1740202109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13708-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137075","9783642137082"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13708-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}