{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:19:53Z","timestamp":1725488393664},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540577669"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-48329-2_36","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T01:25:55Z","timestamp":1186363555000},"page":"420-434","source":"Crossref","is-referenced-by-count":12,"title":["Another Method for Attaining Security Against Adaptively Chosen Ciphertext Attacks"],"prefix":"10.1007","author":[{"given":"Chae Hoon","family":"Lim","sequence":"first","affiliation":[]},{"given":"Pil Joong","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/0217013","volume":"17","author":"W. Alexi","year":"1988","unstructured":"W. Alexi, B. Chor, O. Goldreich and C.P. Schnorr, RSA and Rabin functions: certain parts are as hard as the whole, SIAM J. Computing vol.17 no.2 (1988), 194\u2013208.","journal-title":"SIAM J. Computing"},{"key":"36_CR2","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0215025","volume":"15","author":"L. Blum","year":"1986","unstructured":"L. Blum, M. Blum and M. Shub, A simple unpredictable pseudo-random number generator, SIAM J. Computing vol.15 no. 2 (1986), 364\u2013383.","journal-title":"SIAM J. Computing"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"M. Blum, P. Feldman and S. Micali, Non-interactive zero-knowledge proof systems and applications, Proc. 20th Annual ACM Symposium on Theory of Computing (STOC) (1988), 103\u2013112.","DOI":"10.1145\/62212.62222"},{"key":"36_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/3-540-39568-7_23","volume-title":"Advances in Cryptology-Crypto\u201984","author":"M. Blum","year":"1985","unstructured":"M. Blum and S. Goldwasser, An efficient probabilistic public key encryption scheme which hides all partial information, Advances in Cryptology-Crypto\u201984, Lecture Notes in Computer Science vol.196, Springer-Verlag (1985), 289\u2013299."},{"issue":"4","key":"36_CR5","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"M. Blum and S. Micali, How to generate crypto graphically strong sequences of pseudo-random bits, SIAM J. Computing vol.13 no.4 (1984), 850\u2013864.","journal-title":"SIAM J. Computing"},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J. Carter","year":"1979","unstructured":"J. Carter and M. Wegman, Universal classes of hash functions, J. Computer and System Sciences vol.18 (1979), 143\u2013154.","journal-title":"J. Computer and System Sciences"},{"key":"36_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/3-540-46766-1_36","volume-title":"Advances in Cryptology-Crypto\u201991","author":"I. Damgard","year":"1992","unstructured":"I. Damgard, Towards practical public key systems secure against chosen ciphertext attacks, Advances in Cryptology-Crypto\u201991, LNCS vol.576, Springer-Verlag (1992), 445\u2013456."},{"key":"36_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/3-540-48184-2_8","volume-title":"Advances in Cryptology-Crypto\u201987","author":"Y. Desmedt","year":"1988","unstructured":"Y. Desmedt, Society and group oriented cryptography: a new concept, Advances in Cryptology-Crypto\u201987, LNCS vol.293, Springer-Verlag (1988), 120\u2013127."},{"key":"36_CR9","unstructured":"Z. Galil, S. Haber and M. Yung, Symmetric public key cryptosystems, submitted to J. Cryptology."},{"key":"36_CR10","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 and S. Micali, Probabilistic encryption, J. Computer and System Sciences vol.28 no.2 (1984), 270\u2013299.","journal-title":"J. Computer and System Sciences"},{"key":"36_CR11","unstructured":"R.R. Jueneman, S.M. Matyas and C.H. Meyer, Message authentication with manipulation detection codes, Proc. 1983 Symposium on Security and Privacy, IEEE Computer Society Press, 33\u201354."},{"key":"36_CR12","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1137\/0217021","volume":"17","author":"D.L. Long","year":"1988","unstructured":"D.L. Long and A. Wigderson, The discrete logarithm hides O(log n) bits, SIAM J. Computing vol.17 no.2 (1988), 363\u2013372.","journal-title":"SIAM J. Computing"},{"key":"36_CR13","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1137\/0217025","volume":"17","author":"S. Micali","year":"1988","unstructured":"S. Micali, C. Rackoff and B. Sloan, The notion of security for probabilistic cryptosystems, SIAM J. Computing vol.17 no.2 (1988), 412\u2013426.","journal-title":"SIAM J. Computing"},{"issue":"3","key":"36_CR14","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00196909","volume":"3","author":"S. Micali","year":"1991","unstructured":"S. Micali and C.P. Schnorr, Efficient, perfect polynomial random number generators, J. Cryptology vol.3 no.3 (1991), 157\u2013172.","journal-title":"J. Cryptology"},{"issue":"4","key":"36_CR15","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1109\/49.17715","volume":"7","author":"C. Mitchell","year":"1989","unstructured":"C. Mitchell, M. Walker and D. Rush, CCITT\/ISO standard for secure message handling, IEEE J. Selected Areas on Commun. vol.7 no.4 (1989), 517\u2013524.","journal-title":"IEEE J. Selected Areas on Commun."},{"key":"36_CR16","doi-asserted-by":"crossref","unstructured":"M. Naor and M. Yung, Public key cryptosystems provably secure against chosen ciphertext attacks, Proc. 22th Annual ACM Symposium on Theory of Computing (STOC) (1990), 427\u2013437.","DOI":"10.1145\/100216.100273"},{"key":"36_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/3-540-39805-8_8","volume-title":"Advances in Cryptology-Eurocrypt\u201985","author":"R. Peralta","year":"1986","unstructured":"R. Peralta, Simultaneous security of bits in the discrete log, Advances in Cryptology-Eurocrypt\u201985, LNCS vol.219, Springer-Verlag (1986), 62\u201372."},{"key":"36_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/3-540-46766-1_35","volume-title":"Advances in Cryptology-Crypto\u201991","author":"C. Rackoff","year":"1992","unstructured":"C. Rackoff and D. Simon, Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attacks, Advances in Cryptology-Crypto\u201991, LNCS vol.576, Springer-Verlag (1992), 433\u2013444."},{"issue":"3","key":"36_CR19","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C.P. Schnorr","year":"1991","unstructured":"C.P. Schnorr, Efficient signature generation by smart cards, J. Cryptology vol.4 no.3 (1991), 161\u2013174.","journal-title":"J. Cryptology"},{"key":"36_CR20","unstructured":"A proposed federal information processing standard for secure hash standard, Federal Register Announcement (Jan. 31, 1992), 3747\u20133749."},{"key":"36_CR21","doi-asserted-by":"crossref","unstructured":"D.R. Stinson, Combinatorial techniques for universal hashing, submitted to J. Computer and System Sciences.","DOI":"10.1016\/S0022-0000(05)80007-8"},{"key":"36_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/3-540-39568-7_17","volume-title":"Advances in Cryptology-Crypto\u201984","author":"U.V. Vazirani","year":"1985","unstructured":"U.V. Vazirani and V.V. Vazirani, Efficient and secure pseudo-random number generation, Advances in Cryptology-Crypto\u201984, LNCS vol.196, Springer-Verlag (1985), 193\u2013202."},{"key":"36_CR23","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M. Wegman","year":"1981","unstructured":"M. Wegman and J. Carter, New hash functions and their use in authentication and set equality, J. Computer and System Sciences vol.22 (1981), 265\u2013279.","journal-title":"J. Computer and System Sciences"},{"key":"36_CR24","doi-asserted-by":"crossref","unstructured":"A.C. Yao, Theory and applications of trapdoor functions, Proc. 23rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press (1982), 80\u201391.","DOI":"10.1109\/SFCS.1982.45"},{"key":"36_CR25","unstructured":"Y. Zheng and J. Seberry, Practical approaches to attaining security against adoptively chosen ciphertext attacks, Proc. Crypto\u201992."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 93"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48329-2_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:50:38Z","timestamp":1619571038000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48329-2_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540577669"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-48329-2_36","relation":{},"subject":[]}}