{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:32:43Z","timestamp":1725471163784},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540386193"},{"type":"electronic","value":"9783540386223"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11839569_52","type":"book-chapter","created":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T13:21:24Z","timestamp":1159881684000},"page":"531-540","source":"Crossref","is-referenced-by-count":0,"title":["Zero-Knowledge Proof of Generalized Compact Knapsacks (or A Novel Identification\/Signature Scheme)"],"prefix":"10.1007","author":[{"given":"Bo","family":"Qin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qianhong","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Willy","family":"Susilo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Mu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yumin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"52_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problem. In: Proceedings 28th Annual ACM Symposium on Theory of Computing, pp. 99\u2013108 (1996)","DOI":"10.1145\/237814.237838"},{"issue":"5","key":"52_CR2","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1137\/S0097539796300933","volume":"26","author":"C.H. Bennett","year":"1997","unstructured":"Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computing. SIAM J.Comput.\u00a026(5), 1510\u20131523 (1997)","journal-title":"SIAM J.Comput."},{"key":"52_CR3","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":"52_CR4","first-page":"102","volume-title":"FOCS 2003","author":"S. Goldwasser","year":"2003","unstructured":"Goldwasser, S., Tauman Kalai, Y.: On the (In)security of the Fiat-Shamir Paradigm. In: FOCS 2003, pp. 102\u2013113. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"52_CR5","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computation","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of computer computation, pp. 85\u2013103. Plenum, New York (1972)"},{"issue":"1","key":"52_CR6","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/2455.2461","volume":"32","author":"J.C. Lagarias","year":"1985","unstructured":"Lagarias, J.C., Odlyzko, A.M.: Solving low-density subset sum problems. Journal of the ACM\u00a032(1), 229\u2013246 (1985)","journal-title":"Journal of the ACM"},{"issue":"5","key":"52_CR7","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1109\/TIT.1978.1055927","volume":"24","author":"R.C. Merkle","year":"1978","unstructured":"Merkle, R.C., Hellman, M.E.: Hiding information and signatures in trapdoor Knapsacks. IEEE Transactions on Information Theory\u00a024(5), 525\u2013530 (1978)","journal-title":"IEEE Transactions on Information Theory"},{"key":"52_CR8","first-page":"356","volume-title":"FOCS 2002","author":"D. Micciancio","year":"2002","unstructured":"Micciancio, D.: Generalized compact knapsaks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions. In: FOCS 2002, pp. 356\u2013365. IEEE Computer Society, Los Alamitos (2002)"},{"key":"52_CR9","doi-asserted-by":"crossref","unstructured":"Odlyzko, A.M.: The Rise and Fall of Knapsack Cryptosystems, Cryptology and Computational Number Theory. In: Am. Math. Soc., Proc. Symp. Appl. Math., vol.\u00a042, pp. 75\u201388 (1990)","DOI":"10.1090\/psapm\/042\/1095552"},{"key":"52_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-44598-6_9","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"T. Okamoto","year":"2000","unstructured":"Okamoto, T., Tanaka, K., Uchiyama, S.: Quantum Public-Key Cryptosystems. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 147\u2013165. Springer, Heidelberg (2000)"},{"key":"52_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/3-540-49264-X_26","volume-title":"Advances in Cryptology - EUROCRYPT \u201995","author":"D. Pointcheval","year":"1995","unstructured":"Pointcheval, D.: A new Identification Scheme Based on the Perceptrons Problem. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol.\u00a0921, pp. 319\u2013328. Springer, Heidelberg (1995)"},{"key":"52_CR12","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s001450010003","volume":"13","author":"D. Pointcheval","year":"2000","unstructured":"Pointcheval, D., Stern, J.: Security Arguments for Digital Signatures and Blind Signatures. J. Cryptology\u00a013, 361\u2013396 (2000)","journal-title":"J. Cryptology"},{"key":"52_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-3-540-30144-8_28","volume-title":"Information Security","author":"Q. Wu","year":"2004","unstructured":"Wu, Q., Chen, X., Wang, C., Wang, Y.: Shared-Key Signature and Its Application to Anonymous Authentication in Ad Hoc Group. In: Zhang, K., Zheng, Y. (eds.) ISC 2004. LNCS, vol.\u00a03225, pp. 330\u2013341. Springer, Heidelberg (2004)"},{"key":"52_CR14","first-page":"407","volume-title":"ACM-STOC 2003","author":"O. Regev","year":"2003","unstructured":"Regev, O.: New lattice based cryptographic constructions. In: ACM-STOC 2003, pp. 407\u2013426. ACM Press, New York (2003)"},{"key":"52_CR15","volume-title":"A Fast Signature Scheme MIT\/LCS\/TM-107","author":"A. Shamir","year":"1978","unstructured":"Shamir, A.: A Fast Signature Scheme MIT\/LCS\/TM-107. MIT Laboratory for Computer Science, Cambridge (1978)"},{"key":"52_CR16","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1109\/TIT.1984.1056964","volume":"30","author":"A. Shamir","year":"1984","unstructured":"Shamir, A.: A Polynomial-Time Algorithm for Breaking the Basic Merkle-Hellman Cryptosystem. IEEE Transactions on Information Theory\u00a030, 699\u2013704 (1984)","journal-title":"IEEE Transactions on Information Theory"},{"key":"52_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1007\/0-387-34805-0_54","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"A. Shamir","year":"1990","unstructured":"Shamir, A.: An efficient Identification Scheme Based on Permuted Kernels. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 606\u2013609. Springer, Heidelberg (1990)"},{"key":"52_CR18","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P.W. Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithm for prime factorization and discretelogarithms on a quantum computer. SIAM Journal of Computing\u00a026, 1484\u20131509 (1997)","journal-title":"SIAM Journal of Computing"},{"key":"52_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/3-540-48658-5_18","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"J. Stern","year":"1994","unstructured":"Stern, J.: Designing identification schemes with keys of short size. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 164\u2013173. Springer, Heidelberg (1994)"},{"key":"52_CR20","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1038\/414883a","volume":"414","author":"L.M.K. Vandersypen","year":"2001","unstructured":"Vandersypen, L.M.K., Steffen, M., Breyta, G., Yannoni, C.S., Sherwood, M.H., Chuang, I.L.: Experimental realization of shor\u2019s quantum factoring algorithm using nuclear magnetic resonance. Nature\u00a0414, 883\u2013887 (2001)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Autonomic and Trusted Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11839569_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:20:35Z","timestamp":1605644435000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11839569_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540386193","9783540386223"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11839569_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}