{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:45:53Z","timestamp":1742931953693,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705598"},{"type":"electronic","value":"9783540705604"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-70560-4_15","type":"book-chapter","created":{"date-parts":[[2008,9,9]],"date-time":"2008-09-09T09:16:32Z","timestamp":1220951792000},"page":"181-187","source":"Crossref","is-referenced-by-count":0,"title":["Security Analysis of One Verifiable Encryption Scheme"],"prefix":"10.1007","author":[{"given":"Lihua","family":"Liu","sequence":"first","affiliation":[]},{"given":"Zhengjun","family":"Cao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/266420.266439","volume-title":"Proceedings of 4th ACM Conference on Computer and Communications Security","author":"M. Bellare","year":"1997","unstructured":"Bellare, M., Goldwasser, S.: Verifiable partial key escrow. In: Proceedings of 4th ACM Conference on Computer and Communications Security, April 1997, pp. 78\u201391. ACM Press, New York (1997)"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-45539-6_31","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"F. Boudot","year":"2000","unstructured":"Boudot, F.: Efficient Proofs that a Committed Number Lies in an Interval. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 431\u2013444. Springer, Heidelberg (2000)"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Information and Communication Security","author":"F. Boudot","year":"1999","unstructured":"Boudot, F., Traore, J.: Efficient Publicly Verifiable Secret Sharing Schemes with Fast or Delayed Recovery. In: Varadharajan, V., Mu, Y. (eds.) ICICS 1999. LNCS, vol.\u00a01726. Springer, Heidelberg (1999)"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/BFb0054154","volume-title":"Advances in Cryptology - EUROCRYPT 1998","author":"A. Chan","year":"1998","unstructured":"Chan, A., Frankel, Y., Tsiounis, Y.: Easy Come\u2013Easy Go Divisible Cash. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 561\u2013575. Springer, Heidelberg (1998)"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Chan, A., Frankel, Y., Tsiounis, Y.: Easy Come Easy Go Divisible Cash. Updated version with corrections, GTE Tech. Rep. (1998), \n                    http:\/\/www.ccs.neu.edu\/home\/yiannis\/","DOI":"10.1007\/BFb0054154"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-540-77048-0_18","volume-title":"Information and Communications Security","author":"Z. Cao","year":"2007","unstructured":"Cao, Z., Liu, L.: Boudot\u2019s Range-Bounded Commitment Scheme Revisited. In: Qing, S., Imai, H., Wang, G. (eds.) ICICS 2007. LNCS, vol.\u00a04861, pp. 230\u2013238. Springer, Heidelberg (2007)"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/3-540-48405-1_27","volume-title":"Advances in Cryptology - CRYPTO 1999","author":"J. Camenisch","year":"1999","unstructured":"Camenisch, J., Michels, M.: Separability and Efficiency for Generic Group Signa- ture Schemes. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 413\u2013430. Springer, Heidelberg (1999)"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","first-page":"106","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"J. Camenisch","year":"1999","unstructured":"Camenisch, J., Michels, M.: Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 106\u2013121. Springer, Heidelberg (1999)"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/BFb0052225","volume-title":"Advances in Cryptology - CRYPTO 1997","author":"E. Fujisaki","year":"1997","unstructured":"Fujisaki, E., Okamoto, T.: Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 16\u201330. Springer, Heidelberg (1997)"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Advances in Cryptology - CRYPTO 1986","author":"A. Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: Practical solution to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-45961-8_11","volume-title":"Advances in Cryptology - EUROCRYPT 1988","author":"L. Guillou","year":"1988","unstructured":"Guillou, L., Quisquater, J.: A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory. In: G\u00fcnther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol.\u00a0330, pp. 123\u2013128. Springer, Heidelberg (1988)"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/BFb0054015","volume-title":"Public Key Cryptography","author":"W. Mao","year":"1998","unstructured":"Mao, W.: Guaranteed Correct Sharing of Integer Factorization with Off-Line Shareholders. In: Imai, H., Zheng, Y. (eds.) PKC 1998. LNCS, vol.\u00a01431, pp. 60\u201371. Springer, Heidelberg (1998)"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","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":"Micali, S.: Fair public key cryptosystems. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 113\u2013138. Springer, Heidelberg (1993)"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BFb0028169","volume-title":"Security Protocols","author":"T. Okamoto","year":"1998","unstructured":"Okamoto, T.: Threshold key-recovery system for RSA. In: Christianson, B., Lomas, M. (eds.) Security Protocols 1997. LNCS, vol.\u00a01361, pp. 191\u2013200. Springer, Heidelberg (1998)"},{"key":"15_CR15","unstructured":"Rabin, M.: Digital signatures and public-key functions as intractable as factorization. MIT Laboratory for Computer Science, Technical Report, MIT\/LCS\/TR\u2013212 (1979)"},{"issue":"2","key":"15_CR16","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM\u00a021(2), 120\u2013126 (1978)","journal-title":"Communications of the ACM"}],"container-title":["Studies in Computational Intelligence","Software Engineering, Artificial Intelligence, Networking and Parallel\/Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70560-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T22:07:50Z","timestamp":1675721270000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-70560-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540705598","9783540705604"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70560-4_15","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2008]]}}}