{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:16:52Z","timestamp":1725567412890},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540666660"},{"type":"electronic","value":"9783540480006"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/978-3-540-48000-6_17","type":"book-chapter","created":{"date-parts":[[2010,10,14]],"date-time":"2010-10-14T02:51:39Z","timestamp":1287024699000},"page":"208-218","source":"Crossref","is-referenced-by-count":3,"title":["How to Prove That a Committed Number Is Prime"],"prefix":"10.1007","author":[{"given":"Tri","family":"Van Le","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khanh Quoc","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vijay","family":"Varadharajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"17_CR1","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF00196727","volume":"4","author":"J. Boyar","year":"1991","unstructured":"Boyar, J., Friedl, K., Lund, C.: Practical zero-knowledge proofs: giving hints and using deficiencies. Journal of Cryptology\u00a04(3), 185\u2013206 (1991)","journal-title":"Journal of Cryptology"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Energy Minimization Methods in Computer Vision and Pattern Recognition","author":"S. Brands","year":"1997","unstructured":"Brands, S.: Rapid Demonstration of Linear Relations Connected by Boolean Operators. In: Pelillo, M., Hancock, E.R. (eds.) EMMCVPR 1997. LNCS, vol.\u00a01223, Springer, Heidelberg (1997)"},{"key":"17_CR3","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); Also appeared as BRICS Technical Report RS-98-29"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/BFb0052252","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"J. Camenisch","year":"1997","unstructured":"Camenisch, J., Stadler, M.: Efficient group signature schemes for large groups. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 410\u2013424. Springer, Heidelberg (1997)"},{"key":"17_CR5","series-title":"LNCS","first-page":"561","volume-title":"Proceedings of Eurocrypt 1998","author":"A. Chan","year":"1998","unstructured":"Chan, A., Frankel, Y., Tsiounis, T.: Easy come-easy go divisible cash. In: Proceedings of Eurocrypt 1998. LNCS, pp. 561\u2013575. Springer, Heidelberg (1998)"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1007\/BFb0055745","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"R. Cramer","year":"1998","unstructured":"Cramer, R., Damgard, I.: Zero-knowledge for Finite Field Arithmetic or: Can Zero-knowledge be for Free? In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 424\u2013441. Springer, Heidelberg (1998)"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damgard, I., Schoenmakers, B.: Crypto 1994, Proofs of partial knowledge and simplified design of witness hiding protocols. In: CRYPTO 1994. LNCS, vol.\u00a0839, pp. 174\u2013187 (1994)","DOI":"10.1007\/3-540-48658-5_19"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/3-540-48329-2_7","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"A. Santis De","year":"1994","unstructured":"De Santis, A., Di Crescenzo, G., Persiano, G.: Secret sharing and perfect zero-knowledge. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 73\u201384. Springer, Heidelberg (1994)"},{"key":"17_CR9","doi-asserted-by":"publisher","DOI":"10.1201\/9781439821916","volume-title":"Handbook of Applied Cryptography","author":"A. Menezes","year":"1996","unstructured":"Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/BFb0052225","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"E. Fujisaki","year":"1997","unstructured":"Fujisaki, E., Okamoto, T.: Statistical zero-knowledge protocols to prove modular polynomial relation. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 16\u201330. Springer, Heidelberg (1997)"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Okamoto, T.: An efficient divisible electronic cash scheme. In: Proceedings of CRYPTO 1995. LNCS, pp. 439\u2013451","DOI":"10.1007\/3-540-44750-4_35"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/3-540-48184-2_9","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"J. Graaf van de","year":"1988","unstructured":"van de Graaf, J., Peralta, R.: A simple and secure way to show the validity of your public key. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 128\u2013134. Springer, Heidelberg (1988)"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/BFb0052232","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"R. Gennaro","year":"1997","unstructured":"Gennaro, R., Krawczyk, H., Rabin, T.: RSA-based undeniable signatures. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 132\u2013149. Springer, Heidelberg (1997)"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/3-540-68697-5_13","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"R. Gennaro","year":"1996","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust and efficient sharing of RSA functions. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 157\u2013172. Springer, Heidelberg (1996)"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Koyama, K., Maurer, U., Okamoto, T., Vanstone, S.: New public-key schemes based on elliptic curves over the ring Zn. In: Proceedings of CRYPTO 1991, pp. 252\u2013266 (1991)","DOI":"10.1007\/3-540-46766-1_20"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Micciancio, D., Rabin, T.: An efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products. In: Proceedings of 5rd ACM conference on Computer and Communication Security (1998)","DOI":"10.1145\/288090.288108"},{"key":"17_CR17","unstructured":"Stadler, M.: Cryptographic Protocols for Revocable Privacy, Ph.D Thesis, Swiss Federal Institute of Technology, Zurich (1996)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT\u201999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-48000-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T08:55:34Z","timestamp":1559724934000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-48000-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540666660","9783540480006"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-48000-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}