{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,3]],"date-time":"2026-11-03T20:36:13Z","timestamp":1793738173767,"version":"4.6.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540205920","type":"print"},{"value":"9783540400615","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-40061-5_26","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:06:00Z","timestamp":1283727960000},"page":"398-415","source":"Crossref","is-referenced-by-count":104,"title":["On Diophantine Complexity and Statistical Zero-Knowledge Arguments"],"prefix":"10.1007","author":[{"given":"Helger","family":"Lipmaa","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/SFCS.1976.13","volume-title":"17th Annual Symposium on Foundations of Computer Science","author":"L.M. Adleman","year":"1976","unstructured":"Adleman, L.M., Manders, K.L.: Diophantine Complexity. In: 17th Annual Symposium on Foundations of Computer Science, Houston, Texas, USA, October 25-27, pp. 81\u201388. IEEE Computer Society Press, Los Alamitos (1976)"},{"key":"26_CR2","doi-asserted-by":"crossref","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) ISBN 3-540-67517-5","DOI":"10.1007\/3-540-45539-6_31"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Brands, S.: Rapid Demonstration of Linear Relations Connected by Boolean Operators. In: Fumy [Fum97], pp. 318\u2013333","DOI":"10.1007\/3-540-69053-0_22"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Cramer, R., Gennaro, R., Schoenmakers, B.: A Secure and Optimally Efficient Multi-Authority Election Scheme. In: Fumy [Fum97], pp. 103\u2013118","DOI":"10.1007\/3-540-69053-0_9"},{"key":"26_CR5","series-title":"Graduate Texts in Mathematics","volume-title":"A Course in Computational Algebraic Number Theory","author":"H. Cohen","year":"1995","unstructured":"Cohen, H.: A Course in Computational Algebraic Number Theory. Graduate Texts in Mathematics, vol.\u00a0138. Springer, Heidelberg (1995)"},{"issue":"3","key":"26_CR6","doi-asserted-by":"publisher","first-page":"233","DOI":"10.2307\/2318447","volume":"80","author":"M. Davis","year":"1973","unstructured":"Davis, M.: Hilbert\u2019s Tenth Problem is Unsolvable. American Mathematical Monthly\u00a080(3), 233\u2013269 (1973)","journal-title":"American Mathematical Monthly"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-36178-2_1","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"I. Damg\u00e5rd","year":"2002","unstructured":"Damg\u00e5rd, I., Fujisaki, E.: An Integer Commitment Scheme Based on Groups with Hidden Order. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 1\u201326. Springer, Heidelberg (2002)"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44586-2_9","volume-title":"Public Key Cryptography","author":"I. Damg\u00e5rd","year":"2001","unstructured":"Damg\u00e5rd, I., Jurik, M.: A Generalisation, a Simplification and Some Applications of Paillier\u2019s Probabilistic Public-Key System. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 119\u2013136. Springer, Heidelberg (2001)"},{"issue":"1","key":"26_CR9","first-page":"81","volume":"E82-A","author":"E. Fujisaki","year":"1999","unstructured":"Fujisaki, E., Okamoto, T.: Statistical Zero-Knowledge Protocols to Prove Modular Polynomial Relations. IEICE Transaction of Fundamentals of Electronic Communications and Computer Science\u00a0E82-A(1), 81\u201392 (1999)","journal-title":"IEICE Transaction of Fundamentals of Electronic Communications and Computer Science"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"A. Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","year":"1997","unstructured":"Fumy, W. (ed.): EUROCRYPT 1997. LNCS, vol.\u00a01233. Springer, Heidelberg (1997)"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"818","DOI":"10.2307\/2274135","volume":"49","author":"J.P. Jones","year":"1984","unstructured":"Jones, J.P., Matiyasevich, Y.: Register Machine Proof of the Theorem on Exponential Diophantine Representation of Enumerable Sets. Journal of Symbolic Logic\u00a049, 818\u2013829 (1984)","journal-title":"Journal of Symbolic Logic"},{"issue":"6","key":"26_CR13","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1049\/el:19960359","volume":"32","author":"M. Joye","year":"1996","unstructured":"Joye, M., Quisquater, J.-J.: Efficient Computation of Full Lucas Sequences. Electronics Letters\u00a032(6), 537\u2013538 (1996)","journal-title":"Electronics Letters"},{"issue":"6","key":"26_CR14","doi-asserted-by":"publisher","first-page":"449","DOI":"10.2307\/2318339","volume":"83","author":"J.P. Jones","year":"1976","unstructured":"Jones, J.P., Sato, D., Wada, H., Wiens, D.: Diophantine Representation of the Set of Prime Numbers. American Mathematical Monthly\u00a083(6), 449\u2013464 (1976)","journal-title":"American Mathematical Monthly"},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/3-540-36504-4_7","volume-title":"Financial Cryptography","author":"H. Lipmaa","year":"2003","unstructured":"Lipmaa, H., Asokan, N., Niemi, V.: Secure Vickrey Auctions without Threshold Trust. In: Blaze, M. (ed.) FC 2002. LNCS, vol.\u00a02357, pp. 87\u2013101. Springer, Heidelberg (2003)"},{"key":"26_CR16","unstructured":"Lipmaa, H.: Statistical Zero-Knowledge Proofs from Diophantine Equations. Cryptology ePrint Archive, Report 2001\/086, November 20 (2001), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"26_CR17","unstructured":"Matiyasevich, Y.: Enumerable Sets are Diophantine. Soviet Math., Doklady\u00a011, 354\u2013358 (1970) (English translation)"},{"key":"26_CR18","unstructured":"Matiyasevich, Y.: Hilbert\u2019s Tenth Problem. Foundations of Computing. MIT Press, Cambridge (1993) ISBN 0-262-13295-8"},{"key":"26_CR19","doi-asserted-by":"crossref","first-page":"521","DOI":"10.4064\/aa-27-1-521-553","volume":"27","author":"Y. Matiyasevich","year":"1975","unstructured":"Matiyasevich, Y., Robinson, J.: Reduction of an Arbitrary Diophantine Equation to One in 13 Unknowns. Acta Arithmetica\u00a027, 521\u2013553 (1975)","journal-title":"Acta Arithmetica"},{"issue":"5","key":"26_CR20","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s00153-002-0162-y","volume":"42","author":"C. Pollett","year":"2003","unstructured":"Pollett, C.: On the Bounded Version of Hilbert\u2019s Tenth Problem. Archive for Mathematical Logic\u00a042(5), 469\u2013488 (2003)","journal-title":"Archive for Mathematical Logic"},{"key":"26_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-46588-1_11","volume-title":"Public Key Cryptography","author":"G. Poupard","year":"2000","unstructured":"Poupard, G., Stern, J.: Short Proofs of Knowledge for Factoring. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol.\u00a01751, pp. 147\u2013166. Springer, Heidelberg (2000)"},{"issue":"3","key":"26_CR22","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1090\/S0002-9947-1952-0048374-2","volume":"72","author":"J. Robinson","year":"1952","unstructured":"Robinson, J.: Existential Definability in Arithmetic. Transactions of the American Mathematical Society\u00a072(3), 437\u2013449 (1952)","journal-title":"Transactions of the American Mathematical Society"},{"key":"26_CR23","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1002\/cpa.3160390713","volume":"39","author":"M.O. Rabin","year":"1986","unstructured":"Rabin, M.O., Shallit, J.O.: Randomized Algorithms in Number Theory. Communications in Pure and Applied Mathematics\u00a039, 239\u2013256 (1986)","journal-title":"Communications in Pure and Applied Mathematics"},{"key":"26_CR24","first-page":"225","volume":"39","author":"H.C. Williams","year":"1982","unstructured":"Williams, H.C.: A p + 1 Method of Factoring. Mathematics of Computation\u00a039, 225\u2013234 (1982)","journal-title":"Mathematics of Computation"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-40061-5_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T01:52:33Z","timestamp":1553046753000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-40061-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540205920","9783540400615"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-40061-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}