{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:38:18Z","timestamp":1725485898557},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540007166"},{"type":"electronic","value":"9783540365525"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36552-4_30","type":"book-chapter","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T23:22:37Z","timestamp":1181172157000},"page":"433-450","source":"Crossref","is-referenced-by-count":0,"title":["Speeding Up Secure Sessions Establishment on the Internet"],"prefix":"10.1007","author":[{"given":"Yaron","family":"Sella","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,3,14]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"P. Beguin, and J-J. Quisquater. Fast server-aided RSA signatures secure against active attacks. In Proceedings of Crypto 95, pages 57\u201369, 1995. 435","DOI":"10.1007\/3-540-44750-4_5"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"M. Bellare, J. Garay, and T. Rabin. Fast batch verification for modular exponentiation and digital signatures. In Proceedings of Eurocrypt 98, pages 236\u2013250, 1998. 448","DOI":"10.1007\/BFb0054130"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"M. Bellare, and P. Rogaway. Optimal Assymetric Encryption-How to Encrypt with RSA. In Advances in Cryptology Eurocrypt 94, pages 92\u2013111, 1994. 434, 437","DOI":"10.1007\/BFb0053428"},{"key":"30_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/BFb0054851","volume-title":"The decision Diffie-Hellman problem","author":"D. Boneh","year":"1998","unstructured":"D. Boneh. The decision Diffie-Hellman problem. In Proceedings of the Third Algorithmic Number Theory Symp., LNCSVol. 1423, pages 48\u201363, 1998. 436"},{"issue":"1","key":"30_CR5","first-page":"1","volume":"5","author":"D. Boneh","year":"2002","unstructured":"D. Boneh, and H. Shacham. Fast variants of RSA. In RSA Laboratories Cryptobytes, Volume 5 No. 1, pages 1\u20138, Winter\/Spring 2002. 438","journal-title":"RSA Laboratories Cryptobytes"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"E. F. Brickell, D. M. Gordon, K. S. McCurley, and D. Wilson. Fast exponentiation with precomputation. In Proceedings of Eurocrypt 92, pages 200\u2013207, 1992. 434","DOI":"10.1007\/3-540-47555-9_18"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"C. Coup\u2019e, P. Nguyen, and J. Stern. The Effiectiveness of Lattice Attacks Against Low-Exponent RSA. In Proceedings of PKC\u201999, pages 204\u2013218, 1999.","DOI":"10.1007\/3-540-49162-7_16"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"T. Dierks, and C. Allen. RFC 2246: The TLS Protocol Version 1. January 1999. http:\/\/www.ietf.org\/rfc\/rfc2246.txt 433","DOI":"10.17487\/rfc2246"},{"issue":"6","key":"30_CR9","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie, and M. Hellman. New directions in Cryptography. IEEE Transactions on Information Theory, Volume 22, No. 6, pages 644\u2013654, 1976. 433","journal-title":"IEEE Transactions on Information Theory"},{"key":"30_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey, and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York, 1979. 444"},{"key":"30_CR11","unstructured":"S. Hong, J. Shin, H. Lee-Kwang, and H. Yoon. A new approach to server-aided secret computation. In Proceedings of the 1st International Conference on Information Security and Cryptology-ICISC\u201998, pages 33\u201345, 1998. 435"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"B. Kaliski, and J. Staddon. RFC 2437: PKCS #1-RSA Cryptography Specifications Version 2.0. October 1998. http:\/\/www.ietf.org\/rfc\/rfc2437.txt 434","DOI":"10.17487\/rfc2437"},{"key":"30_CR13","unstructured":"S. Kent, and R. Atkinson. Security Architecture for the Internet Protocol. RFC2401, http:\/\/www.ietf.org\/rfc\/rfc2401.txt 433"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"C.H. Lim, and P. J. Lee. More fiexible exponentiation with precomputation. In Proceedings of Crypto 94, pages 95\u2013107, 1994. 434","DOI":"10.1007\/3-540-48658-5_11"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"C.H. Lim, and P. J. Lee. Security and Performance of server-aided RSA computation protocols. In Proceedings of Crypto 95, pages 70\u201383, 1995. 435","DOI":"10.1007\/3-540-44750-4_6"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"T. Matsumoto, H. Imai, C. S. Laih, and S.M. Yen. On verifiable implicit asking protocol for RSA computation. In Proceedings of Auscrypt 92, pages 296\u2013307, 1993. 435","DOI":"10.1007\/3-540-57220-1_70"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"T. Matsumoto, K. Kato, and H. Imai. Speeding up Secret Computations with Insecure Auxiliary Devices. In Proceedings of Crypto 88, pages 497\u2013506, 1990. 435","DOI":"10.1007\/0-387-34799-2_35"},{"key":"30_CR18","unstructured":"A. J. Menezes, P. C. Van Oorschot, and S.A. Vanstone. Handbook of Applied Cryptography, CRC Press, 1997. 433"},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"J. Merkle. Multi-Round Passive Attacks on Server-Aided RSA Protocols. In Proceedings of CCS\u2019 00, pages 102\u2013107, 2000. 435","DOI":"10.1145\/352600.352616"},{"key":"30_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/3-540-45537-X_13","volume-title":"Selected Areas in Cryptography (SAC) 2001","author":"B. M\u00f6ller","year":"2001","unstructured":"B. M\u00f6ller. Algorithms for Multi-Exponentiation. In Selected Areas in Cryptography (SAC) 2001, LNCS Vol. 2259, pages 165\u2013180, 2001. 449"},{"key":"30_CR21","unstructured":"National Institute for Standards and Technology. Digital Signature Standard (DSS). Technical Report 169, 1991. 434"},{"key":"30_CR22","doi-asserted-by":"crossref","unstructured":"P. Nguyen, and J. Stern. The B\u2019eguin-Quisquater server-aided RSA protocol from Crypto\u2019 95 is not secure. In Proceedings of Asiacrypt\u2019 98, pages 372\u2013379, 1998. 435","DOI":"10.1007\/3-540-49649-1_29"},{"key":"30_CR23","doi-asserted-by":"crossref","unstructured":"B. Pfitzmann, and M. Waidner. Attacks on protocols for server-aided RSA computation. In Proceedings of Eurocrypt 92, pages 153\u2013162, 1992. 435","DOI":"10.1007\/3-540-47555-9_13"},{"key":"30_CR24","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. L. Rivest","year":"1978","unstructured":"R. L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public key cryptosystems. Communication of the ACM, 21:120\u2013126, 1978. 433","journal-title":"Communication of the ACM"},{"issue":"3","key":"30_CR25","first-page":"161","volume":"4","author":"C.P. Schnorr","year":"1991","unstructured":"C.P. Schnorr. Efficient signature generation by smart cards. J. Cryptology 4 (3), pages 161\u2013174, 1991. 434","journal-title":"Efficient signature generation by smart cards"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2014 ICISC 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36552-4_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T19:37:32Z","timestamp":1556480252000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36552-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540007166","9783540365525"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-36552-4_30","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}