{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T09:42:50Z","timestamp":1745746970919},"publisher-location":"Berlin, Heidelberg","reference-count":47,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540418986"},{"type":"electronic","value":"9783540453536"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45353-9_16","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T15:50:02Z","timestamp":1184601002000},"page":"208-222","source":"Crossref","is-referenced-by-count":20,"title":["On the Power of Misbehaving Adversaries and Security Analysis of the Original EPOC"],"prefix":"10.1007","author":[{"given":"Marc","family":"Joye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Jacques","family":"Quisquater","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,4,2]]},"reference":[{"key":"16_CR1","unstructured":"FIPS PUB 185. Escrowed encryption standard (EES). Federal Information Processing Standards Publication 185, U.S. Dept of Commerce, February 1994."},{"key":"16_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/BFb0055718","volume-title":"Advances in Cryptology-CRYPTO\u201998","author":"M. Bellare","year":"1998","unstructured":"Mihir Bellare, Anand Desai, David Pointcheval, and Phillip Rogaway. Relations among notions of security for public-key encryption schemes. Full paper (30 pages), available at URL < http:\/\/www-cse.ucsd.edu\/users\/mihir\/papers\/pke.html >, February 1999. An extended abstract appears in H. Krawczyk, ed., Advances in Cryptology-CRYPTO\u201998, volume 1462 of Lecture Notes in Computer Science, pages 26\u201345, Springer-Verlag, 1998."},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Mihir Bellare and Phillip Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In Proc. of the 1st ACM Conference on Computer and Communications Security, pages 62\u201373, ACM Press, 1993.","DOI":"10.1145\/168588.168596"},{"key":"16_CR4","series-title":"Lect Notes Comput Sci","first-page":"92","volume-title":"Advances in Cryptology-EUROCRYPT\u201994","author":"______","year":"1995","unstructured":"______. Optimal asymmetric encryption. In A. De Santis, ed., Advances in Cryptology-EUROCRYPT\u201994, volume 950 of Lecture Notes in Computer Science, pages 92\u2013111, Springer-Verlag, 1995."},{"key":"16_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/3-540-48405-1_33","volume-title":"Advances in Cryptology-CRYPTO\u201999","author":"M. Bellare","year":"1999","unstructured":"Mihir Bellare and Amit Sahai. Non-malleable encryption: Equivalence between two notions. In M. Wiener, ed., Advances in Cryptology-CRYPTO\u201999, volume 1666 of Lecture Notes in Computer Science, pages 519\u2013536, Springer-Verlag, 1999."},{"key":"16_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0055716","volume-title":"Advances in Cryptology-CRYPTO\u201998","author":"D. Bleichenbacher","year":"1998","unstructured":"Daniel Bleichenbacher. A chosen ciphertext attack against protocols based on the RSA encryption standard PKCS#1. In H. Krawczyk, ed., Advances in Cryptology-CRYPTO\u201998, volume 1462 of Lecture Notes in Computer Science, pages 1\u201312, Springer-Verlag, 1998."},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Matt Blaze. Protocol failure in the escrowed encryption standard. In Proc. of the 2nd ACM Conference on Computer and Communications Security, pages 59\u201367, ACM Press, 1994.","DOI":"10.1145\/191177.191193"},{"key":"16_CR8","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-EUROCRYPT\u201999","author":"D. Boneh","year":"1999","unstructured":"Dan Boneh, Glenn Durfee, and Nick Howgrave-Graham. Factoring N = p r q for large r. In J. Stern, ed., Advances in Cryptology-EUROCRYPT\u201999, volume 1592 of Lecture Notes in Computer Science, Springer-Verlag, 1999."},{"key":"16_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/BFb0028495","volume-title":"Information and Communications Security (ICICS\u2019 97)","author":"C. Boyd","year":"1997","unstructured":"Colin Boyd. Enforcing traceability in software. In Y. Han, T. Okamoto, and S. Qing, eds., Information and Communications Security (ICICS\u2019 97), volume 1334 of Lecture Notes in Computer Science, pages 398\u2013408, Springer-Verlag, 1997."},{"key":"16_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/3-540-68339-9_16","volume-title":"Advances in Cryptology-EUROCRYPT\u201996","author":"D. Coppersmith","year":"1996","unstructured":"Don Coppersmith. Finding a small root of a bivariate integer equation; factoring with high bits known. In U. Maurer, ed., Advances in Cryptology-EUROCRYPT\u201996, volume 1070 of Lecture Notes in Computer Science, pages 178\u2013189, Springer-Verlag, 1996."},{"key":"16_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BFb0055717","volume-title":"Advances in Cryptology-CRYPTO\u201998","author":"R. Cramer","year":"1998","unstructured":"Ronald Cramer and Victor Shoup. A practical public-key cryptosystem provably secure against adaptive chosen ciphertext attack. In H. Krawczyk, ed., Advances in Cryptology-CRYPTO\u201998, volume 1462 of Lecture Notes in Computer Science, pages 13\u201325, Springer-Verlag, 1998."},{"key":"16_CR12","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. Damg\u00e5rd","year":"1992","unstructured":"Ivan Damg\u00e5rd. Towards practical public key systems secure against chosen ciphertext attacks. In J. Feigenbaum, ed., Advances in Cryptology-CRYPTO\u201991, volume 576 of Lecture Notes in Computer Science, pages 445\u2013456, Springer-Verlag, 1992."},{"issue":"3","key":"16_CR13","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/227234.227239","volume":"39","author":"D. E. Denning","year":"1996","unstructured":"Dorothy E. Denning and Dennis K. Brandstad. A taxonomy for key escrow encryption systems. Communications of the ACM, 39(3):34\u201340, 1996.","journal-title":"Communications of the ACM"},{"issue":"9","key":"16_CR14","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1109\/35.312844","volume":"32","author":"D. E. Denning","year":"1994","unstructured":"Dorothy E. Denning and Miles Smid. Key escrowing today. IEEE Communications Magazine, 32(9):58\u201368, 1994.","journal-title":"IEEE Communications Magazine"},{"key":"16_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/3-540-49264-X_12","volume-title":"Advances in Cryptology-EUROCRYPT\u201995","author":"Y. Desmedt","year":"1995","unstructured":"Yvo Desmedt. Securing traceability of ciphertexts: Towards a secure software key escrow system. In L. C. Guillou and J.-J. Quisquater, eds., Advances in Cryptology-EUROCRYPT\u201995, volume 921 of Lecture Notes in Computer Science, pages 147\u2013157, Springer-Verlag, 1995."},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Danny Dolev, Cynthia Dwork, and Moni Naor. Non-malleable cryptography. Manuscript (51 pages), available at URL < http:\/\/www.wisdom.weizmann.ac.il\/~naor\/onpub.html >, To appear in SIAM J. on Computing. A preliminary version appears in Proc. of the 23rd ACM Annual Symposium on the Theory of Computing (STOC\u2019 91), pages 542\u2013552, ACM Press, 1991.","DOI":"10.1145\/103418.103474"},{"key":"16_CR17","unstructured":"Roger Fischlin. Fast proof of plaintext-knowledge and deniable authentication based on Chinese remainder theorem. Theory of Cryptography Library, 99\u201306, available at URL < http:\/\/philby.ucsd.edu\/cryptolib\/1999.html >, March 1999."},{"key":"16_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1007\/3-540-44750-4_18","volume-title":"Advances in Cryptology-CRYPTO\u201995","author":"Y. Frankel","year":"1995","unstructured":"Yair Frankel and Moti Yung. Escrow encryption systems visited: attacks, analysis and designs. In D. Coppersmith, ed., Advances in Cryptology-CRYPTO\u201995, volume 963 of Lecture Notes in Computer Science, pages 222\u2013235, Springer-Verlag, 1995."},{"key":"16_CR19","series-title":"Lect Notes Comput Sci","first-page":"287","volume-title":"Advances in Cryptology-CRYPTO\u201995","author":"______","year":"1995","unstructured":"______. Cryptanalysis of the immunized LL public key systems. In D. Coppersmith, ed., Advances in Cryptology-CRYPTO\u201995, volume 963 of Lecture Notes in Computer Science, pages 287\u2013296, Springer-Verlag, 1995."},{"key":"16_CR20","series-title":"Lect Notes Comput Sci","first-page":"705","volume-title":"Automata, Languages, and Programming (ICALP\u2019 97)","author":"______","year":"1997","unstructured":"______. On characterization of escrow encryption schemes. In P. Degano, R. Garriero, and A. Marchetti-Spaccamela, eds., Automata, Languages, and Programming (ICALP\u2019 97), volume 1256 of Lecture Notes in Computer Science, pages 705\u2013715, Springer-Verlag, 1997."},{"key":"16_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-49162-7_5","volume-title":"Public Key Cryptography","author":"E. Fujisaki","year":"1999","unstructured":"Eiichiro Fujisaki and Tatsuaki Okamoto. How to enhance the security of public-key encryption at minimum cost. In H. Imai and Y. Zheng, eds., Public Key Cryptography, volume 1560 of Lecture Notes in Computer Science, pages 53\u201368, Springer-Verlag, 1999."},{"issue":"1","key":"16_CR22","first-page":"24","volume":"E83-A","author":"______","year":"2000","unstructured":"______. How to enhance the security of public-key encryption at minimum cost. IEICE Transactions on Fundamentals, E83-A(1): 24\u201332, 2000.","journal-title":"IEICE Transactions on Fundamentals"},{"key":"16_CR23","series-title":"Lect Notes Comput Sci","first-page":"537","volume-title":"Advances in Cryptology-CRYPTO\u201999","author":"______","year":"1999","unstructured":"______. Secure integration of asymmetric and symmetric encryption schemes. In M. Wiener, ed., Advances in Cryptology-CRYPTO\u201999, volume 1666 of Lecture Notes in Computer Science, pages 537\u2013554, Springer-Verlag, 1999."},{"key":"16_CR24","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0020-0190(98)00160-4","volume":"68","author":"H. Gilbert","year":"1998","unstructured":"Henri Gilbert, Dipankar Gupta, Andrew Odlyzko, and Jean-Jacques Quisquater. Attacks on Shamir\u2019s \u2018RSA for paranoids\u2019. Information Processing Letters, 68:197\u2013199, 1998.","journal-title":"Information Processing Letters"},{"key":"16_CR25","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Shafi Goldwasser and Silvio Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28:270\u2013299, 1984.","journal-title":"Journal of Computer and System Sciences"},{"key":"16_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/978-3-540-47942-0_2","volume-title":"Information and Communications Security","author":"C. Hall","year":"1999","unstructured":"Chris Hall, Ian Goldberg, and Bruce Schneier. Reaction attacks against several public-key cryptosystems. In V. Varadharajan and Yi Mu, eds., Information and Communications Security, volume 1726 of Lecture Notes in Computer Science, pages 2\u201312, Springer-Verlag, 1999."},{"key":"16_CR27","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/3-540-48059-5_28","volume-title":"Cryptographic Hardware and Embedded Systems","author":"M. Hartmann","year":"1999","unstructured":"Michael Hartmann, Sachar Paulus, and Tsuyoshi Takagi. NICE-New ideal coset encryption. In \u00c7. K. Ko\u00e7 and C. Paar, eds., Cryptographic Hardware and Embedded Systems, volume 1717 of Lecture Notes in Computer Science, pages 328\u2013339, Springer-Verlag, 1999."},{"key":"16_CR28","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/BFb0054134","volume-title":"Advances in Cryptology-EUROCRYPT\u201998","author":"D. H\u00fchnlein","year":"1998","unstructured":"Detlef H\u00fchnlein, Michael J. Jacobson Jr., Sachar Paulus, and Tsuyoshi Takagi. A cryptosystem based on non-maximal imaginary quadratic orders with fast decryption. In K. Nyberg, ed., Advances in Cryptology-EUROCRYPT\u201998, volume 1403 of Lecture Notes in Computer Science, pages 294\u2013307. Springer-Verlag, 1998."},{"key":"16_CR29","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/3-540-45539-6_26","volume-title":"Advances in Cryptology-EUROCRYPT 2000","author":"\u00c9. Jaulmes","year":"2000","unstructured":"\u00c9liane Jaulmes and Antoine Joux. A NICE cryptanalysis. In B. Preneel, ed., Advances in Cryptology-EUROCRYPT 2000, volume 1807 of Lecture Notes in Computer Science, pages 382\u2013391, Springer-Verlag, 2000."},{"key":"16_CR30","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/BFb0032349","volume-title":"Cryptography: Policy and Algorithms","author":"N. Jefferies","year":"1996","unstructured":"Nigel Jefferies, Chris Mitchell, and Michael Walker. A proposed architecture for trusted third parties services. In E. Dawson and J. Goli\u0107, eds., Cryptography: Policy and Algorithms, volume 1029 of Lecture Notes in Computer Science, pages 98\u2013104, Springer-Verlag, 1996."},{"key":"16_CR31","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1007\/3-540-44750-4_17","volume-title":"Advances in Cryptology-CRYPTO\u201995","author":"J. Kilian","year":"1995","unstructured":"Joe Kilian and Tom Leighton. Fair cryptosystems, revisited. In D. Coppersmith, ed., Advances in Cryptology-CRYPTO\u201995, volume 963 of Lecture Notes in Computer Science, pages 208\u2013221, Springer-Verlag, 1995."},{"key":"16_CR32","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/3-540-68339-9_21","volume-title":"Advances in Cryptology-EUROCRYPT\u201996","author":"L. R. Knudsen","year":"1996","unstructured":"Lars R. Knudsen and Torben P. Pedersen. On the dificulty of software key escrow. In U. Maurer, ed., Advances in Cryptology-EUROCRYPT\u201996, volume 1070 of Lecture Notes in Computer Science, pages 237\u2013244, Springer-Verlag, 1996."},{"key":"16_CR33","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1007\/3-540-48329-2_36","volume-title":"Advances in Cryptology-CRYPTO\u201993","author":"C. H. Lim","year":"1994","unstructured":"Chae Hoon Lim and Pil Joong Lee. Another method for attaining security against chosen ciphertext attacks. In D. R. Stinson, ed., Advances in Cryptology-CRYPTO\u201993, volume 773 of Lecture Notes in Computer Science, pages 420\u2013434, Springer-Verlag, 1994."},{"key":"16_CR34","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/3-540-48071-4_9","volume-title":"Advances in Cryptology-CRYPTO\u201992","author":"S. Micali","year":"1993","unstructured":"Silvio Micali. Fair public-key cryptosystems. In E. F. Brickell, ed., Advances in Cryptology-CRYPTO\u201992, volume 740 of Lecture Notes in Computer Science, pages 113\u2013138, Springer-Verlag, 1993."},{"key":"16_CR35","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/3-540-44750-4_15","volume-title":"Advances in Cryptology-CRYPTO\u201995","author":"S. Micali","year":"1995","unstructured":"Silvio Micali and Ray Sidney. A simple method for generating and sharing pseudo-random functions, with applications to Clipper-like key escrow systems. In D. Coppersmith, ed., Advances in Cryptology-CRYPTO\u201995, volume 963 of Lecture Notes in Computer Science, pages 185\u2013196, Springer-Verlag, 1995."},{"key":"16_CR36","doi-asserted-by":"crossref","unstructured":"Moni Naor and Moti Yung. Public-key cryptosystems provably secure against chosen ciphertext attacks. In Proc. of the 22nd ACM Annual Symposium on the Theory of Computing (STOC\u2019 90), pages 427\u2013437, ACM Press, 1990.","DOI":"10.1145\/100216.100273"},{"key":"16_CR37","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/BFb0054135","volume-title":"Advances in Cryptology-EUROCRYPT\u201998","author":"T. Okamoto","year":"1998","unstructured":"Tatsuaki Okamoto and Shigenori Uchiyama. A new public-key cryptosystem as secure as factoring. In K. Nyberg, ed., Advances in Cryptology-EUROCRYPT\u201998, volume 1403 of Lecture Notes in Computer Science, pages 308\u2013318. Springer-Verlag, 1998."},{"key":"16_CR38","unstructured":"Tatsuaki Okamoto, Shigenori Uchiyama, and Eiichiro Fujisaki. EPOC: Efficient probabilistic public-key encryption. Submission to P1363a, available at URL < http:\/\/grouper.ieee.org\/groups\/1363\/addendum.html >, November 1998."},{"key":"16_CR39","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-ASIACRYPT\u201999","author":"P. Paillier","year":"1999","unstructured":"Pascal Paillier and David Pointcheval. Efficient public-key cryptosystem provably secure against active adversaries. In Advances in Cryptology-ASIACRYPT\u201999, volume of Lecture Notes in Computer Science, Springer-Verlag, 1999."},{"key":"16_CR40","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-EUROCRYPT\u201999","author":"D. Pointcheval","year":"1999","unstructured":"David Pointcheval. New public-key cryptosystem based on the dependent-RSA problem. In J. Stern, ed., Advances in Cryptology-EUROCRYPT\u201999, volume 1592 of Lecture Notes in Computer Science, Springer-Verlag, 1999."},{"key":"16_CR41","series-title":"Lect Notes Comput Sci","first-page":"129","volume-title":"Public Key Cryptography","author":"______","year":"2000","unstructured":"______. Chosen ciphertext security for any one-way cryptosystem. In H. Imai and Y. Zheng, eds., Public Key Cryptography, volume 1751 of Lecture Notes in Computer Science, pages 129\u2013146, Springer-Verlag, 2000."},{"key":"16_CR42","unstructured":"Sachar Paulus and Tsuyoshi Takagi. A generalization of the Diffie-Hellman problem and related cryptosystems allowing fast decryption. In Proc. of the 1998 International Conference on Information Security and Cryptology (ICISC\u2019 98), Seoul, December 18\u201319, 1998."},{"key":"16_CR43","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. Racko","year":"1992","unstructured":"Charles Racko and Daniel R. Simon. Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In J. Feigenbaum, ed., Advances in Cryptology-CRYPTO\u201991, volume 576 of Lecture Notes in Computer Science, pages 433\u2013444, Springer-Verlag, 1992."},{"issue":"2","key":"16_CR44","first-page":"1","volume":"1","author":"A. Shamir","year":"1995","unstructured":"Adi Shamir. RSA for paranoids. Cryptobytes, 1(2):1\u20134, 1995.","journal-title":"Cryptobytes"},{"key":"16_CR45","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0054113","volume-title":"Advances in Cryptology-EUROCRYPT\u201998","author":"V. Shoup","year":"1998","unstructured":"Victor Shoup and Rosario Gennaro. Securing threshold cryptosystems against chosen ciphertext attack. IBM Research Report RZ 2974, Zurich Research Laboratory, Zurich, November 1997. An extended abstract appears in K. Nyberg, ed., Advances in Cryptology-EUROCRYPT\u201998, volume 1403 of Lecture Notes in Computer Science, pages 1\u201316, Springer-Verlag, 1998."},{"key":"16_CR46","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BFb0054019","volume-title":"Public Key Cryptography","author":"Y. Tsiounis","year":"1998","unstructured":"Yiannis Tsiounis and Moti Yung. On the security of ElGamal based encryption. In H. Imai and Y. Zheng, eds., Public Key Cryptography, volume 1431 of Lecture Notes in Computer Science, pages 117\u2013134, Springer-Verlag, 1998."},{"issue":"5","key":"16_CR47","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1109\/49.223871","volume":"11","author":"Y. Zheng","year":"1993","unstructured":"Yuliang Zheng and Jennifer Seberry. Immunizing public-key cryptosystems against chosen ciphertext attacks. IEEE Journal on Selected Areas in Communications, 11(5):715\u2013724, 1993.","journal-title":"IEEE Journal on Selected Areas in Communications"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2014 CT-RSA 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45353-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T03:08:48Z","timestamp":1556680128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45353-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540418986","9783540453536"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/3-540-45353-9_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}