{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T01:57:52Z","timestamp":1783562272262,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540645184","type":"print"},{"value":"9783540697954","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054113","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T09:13:04Z","timestamp":1153991584000},"page":"1-16","source":"Crossref","is-referenced-by-count":150,"title":["Securing threshold cryptosystems against chosen ciphertext attack"],"prefix":"10.1007","author":[{"given":"Victor","family":"Shoup","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rosario","family":"Gennaro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,5,25]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"N. Asokan, V. Shoup, and M. Waidner. Optimistic fair exchange of digital signatures. Preprint, 1997.","DOI":"10.1007\/BFb0054156"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In First ACM Conference on Computer and Communications Security, 1993.","DOI":"10.1145\/168588.168596"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway. Optimal asymmetric encryption. In Advances in Cryptology\u2014Crypto '94, pages 92\u2013111, 1994.","DOI":"10.1007\/BFb0053428"},{"issue":"4","key":"1_CR4","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1137\/0220068","volume":"6","author":"M. Blum","year":"1991","unstructured":"M. Blum, A. De Santis, S. Micali, and G. Persiano. Non-interactive zero knowledge. SIAM J. Comput., 6(4):1084\u20131118, 1991.","journal-title":"SIAM J. Comput."},{"key":"1_CR5","unstructured":"C. Boyd. Digital multisignatures. In H. Baker and F. Piper, editors, Cryptography and Coding, pages 241\u2013246. Claredon Press, 1986."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"E. F. Brickell, D. M. Gordon, K. S. McCurley, and D. B. Wilson. Fast exponentiation with precomputation. In Advances in Cryptology-Eurocrypt '92, pages 200\u2013207, 1992.","DOI":"10.1007\/3-540-47555-9_18"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"D. Chaum and T. Pederson. Wallet databases with observers. In Advances in Cryptology-Crypto '92, pages 89\u2013105, 1992.","DOI":"10.1007\/3-540-48071-4_7"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"I. Damgard. Towards practical public key cryptosystems secure against chosen ciphertext attacks. In Advances in Cryptology-Crypto '91, pages 445\u2013456, 1991.","DOI":"10.1007\/3-540-46766-1_36"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"A. De Santis, Y. Desmedt, Y. Frankel, and M. Yung. How to share a function securely. In 26th Annual ACM Symposium on Theory of Computing, pages 522\u2013533, 1994.","DOI":"10.1145\/195058.195405"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"A. De Santis and G. Persiano. Zero-knowledge proofs of knowledge without interaction. In 33rd Annual Symposium on Foundations of Computer Science, 1992.","DOI":"10.1109\/SFCS.1992.267809"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Y. Desmedt. Society and group oriented cryptography: a new concept. In Advances in Cryptology-Crypto '87, pages 120\u2013127, 1987.","DOI":"10.1007\/3-540-48184-2_8"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Y. Desmedt and Y. Frankel. Threshold cryptosystems. In Advances in Cryptology-Crypto '89, pages 307\u2013315, 1989.","DOI":"10.1007\/0-387-34805-0_28"},{"key":"1_CR13","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. E. Hellman. New directions in cryptography. IEEE Trans. Info. Theory, 22:644\u2013654, 1976.","journal-title":"IEEE Trans. Info. Theory"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"D. Dolev, C. Dwork, and M. Naor. Non-malleable cryptography. In 23rd Annual ACM Symposium on Theory of Computing, pages 542\u2013552, 1991.","DOI":"10.1145\/103418.103474"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"A. Fiat and A. Shamir. How to prove yourself: practical solutions to identification and signature problems. In Advances in Cryptology\u2014Crypto '86, pages 186\u2013194, 1986.","DOI":"10.1007\/3-540-47721-7_12"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Y. Frankel and M. Yung. Cryptanalysis of immunized LL public key systems. In Advances in Cryptology-Crypto '95, pages 287\u2013296, 1995.","DOI":"10.1007\/3-540-44750-4_23"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust and efficient sharing of RSA functions. In Advances in Cryptology-Crypto '96, pages 157\u2013172, 1996.","DOI":"10.1007\/3-540-68697-5_13"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"C. H. Lim and P. J. Lee. Another method for attaining security against adaptively chosen ciphertext attacks. In Advances in Cryptology-Crypto '93, pages 420\u2013434, 1993.","DOI":"10.1007\/3-540-48329-2_36"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"C. H. Lim and P. J. Lee. More flexible exponentiation with precomputation. In Advances in Cryptology-Crypto '94, pages 95\u2013107, 1994.","DOI":"10.1007\/3-540-48658-5_11"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"M. Naor and M. Yung. Public-key cryptosystems provably secure against chosen ciphertext attacks. In 22nd Annual ACM Symposium on Theory of Computing, pages 427\u2013437, 1990.","DOI":"10.1145\/100216.100273"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"T. Pedersen. A threshold cryptosystem without a trusted party. In Advances in Cryptology-Eurocrypt '91, pages 522\u2013526, 1991.","DOI":"10.1007\/3-540-46416-6_47"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"D. Pointcheval and J. Stern. Provably secure blind signature schemes. In Advances in Cryptology-Asiacrypt '96, pages 252\u2013265, 1996.","DOI":"10.1007\/BFb0034852"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"C. Rackoff and D. Simon. Noninteractive zero-knowledge proof of knowledge and chosen ciphertext attack. In Advances in Cryptology-Crypto '91, pages 433\u2013444, 1991.","DOI":"10.1007\/3-540-46766-1_35"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"R. L. Rivest, A. Shamir, and L. M. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, pages 120\u2013126, 1978.","DOI":"10.1145\/359340.359342"},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C. Schnorr","year":"1991","unstructured":"C. Schnorr. Efficient signature generation by smart cards. J. Cryptology, 4:161\u2013174, 1991.","journal-title":"J. Cryptology"},{"key":"1_CR26","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir. How to share a secret. Communications of the ACM, 22:612\u2013613, 1979.","journal-title":"Communications of the ACM"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"V. Shoup. Lower bounds for discrete logarithms and related problems. In Advances in Cryptology-Eurocrypt '97, 1997.","DOI":"10.1007\/3-540-69053-0_18"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Y. Zheng and J. Seberry. Practical approaches to attaining security against adaptively chosen ciphertext attacks. In Advances in Cryptology-Crypto '92, pages 292\u2013304, 1992.","DOI":"10.1007\/3-540-48071-4_20"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT'98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054113","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T08:36:56Z","timestamp":1555749416000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0054113"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540645184","9783540697954"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/bfb0054113","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]}}}