{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:53:38Z","timestamp":1764996818278},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602217"},{"type":"electronic","value":"9783540447504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-44750-4_25","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T04:39:53Z","timestamp":1187239193000},"page":"311-324","source":"Crossref","is-referenced-by-count":34,"title":["Improved Efficient Arguments"],"prefix":"10.1007","author":[{"given":"Joe","family":"Kilian","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"25_CR1","unstructured":"S. Arora and S. Safra. Probabilistic Checking of Proofs, Proceedings of STOC 1992."},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"S. Arora and T. Leighton and B. Maggs. On-line algorithms for path selection in a nonblocking network. Proceedings of STOC 1990, pp. 149\u2013158","DOI":"10.1145\/100216.100232"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy. Proof Verification and Hardness of Approximation Problems, Proceedings of STOC 1992.","DOI":"10.1109\/SFCS.1992.267823"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"G. Brassard, D. Chaum, and C. Cr\u00e9peau. Minimum Disclosure Proofs of Knowledge, J. Comput. System Sci. 37 (1988), 156\u2013189.","journal-title":"J. Comput. System Sci."},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"L. Babai, L. Fortnow, and C. Lund. Non-Deterministic Exponential Time has Two-Prover Interactive Proofs, Proceedings of FOCS 1990","DOI":"10.1007\/BF01200056"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"L. Babai, L. Fortnow, L. Levin and M. Szegedy. Checking computation in polylogarithmic time. Proceedings of STOC 1991.","DOI":"10.1145\/103418.103428"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"M. Bellare, S. Goldwasser, C. Lund, A. Russell, \u201cEfficient probabilistic checkable proofs and applications to approximation,\u201d Proc. 25th STOC, 1993, pp. 294\u2013304.","DOI":"10.1145\/167088.167174"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"M. Bellare, P. Rogaway. Random Oracles are Practical: A paradigm for Designing Efficient Protocols, Proc. First ACM Conference on Computer and Communications Security, ACM, November 1993.","DOI":"10.1145\/168588.168596"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, Non-interactive Circuit Based Proofs and Non-Interactive Perfect Zero-Knowledge with Preprocessing, Advances in Cryptology \u2014 EUROCRYPT 92, pp. 341\u2013355.","DOI":"10.1007\/3-540-47555-9_28"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"C. Dwork, U. Feige, J. Kilian, M. Naor and S. Safra. Low communication 2-Prover Zero-Knowledge Proofs for NP. Advances in Cryptology \u2014 Crypto\u2019 92, pp. 215\u2013227.","DOI":"10.1007\/3-540-48071-4_15"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"U. Feige, A. Fiat and A. Shamir. Zero knowledge proofs of identity, Proceedings of 19nd Annual Symposium on the Theory of Computation, 1987, pp. 210\u2013217.","DOI":"10.1145\/28395.28419"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"U. Feige, S. Goldwasser, L. Lovasz, M. Safra and M. Szegedy. Approximating Clique is Almost NP-Complete, Proceedings of 32nd Annual Symposium on Foundations of Computer Science, 1991, pp. 2\u201312.","DOI":"10.1109\/SFCS.1991.185341"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"U. Feige, D. Lapidot and A. Shamir. Multiple Non-Interactive Zero-Knowledge Proofs Based on a Single Random String, Proceedings of the 22th Annual Symposium on the Theory of Computation, 1990, pp. 308\u2013317","DOI":"10.1109\/FSCS.1990.89549"},{"key":"25_CR14","unstructured":"C. Bennett. personal communication via Gilles Brassard."},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multi-Prover Interactive Proofs: How to Remove Intractability, Proceedings of STOC 1988.","DOI":"10.1145\/62212.62223"},{"key":"25_CR16","unstructured":"De Santis, A., S. Micali and G. Persiano, \u201cBounded-Interaction Zero-Knowledge proofs,\u201d Advances in Cryptology \u2014 Crypto\u2019 88"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"U. Feige, S. Goldwasser, L. Lov\u00e1sz, S. Safra and M. Szegedy. Approximating clique is almost NP-Complete. Proceedings of FOCS 1991, pp. 2\u201312.","DOI":"10.1109\/SFCS.1991.185341"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"L. Fortnow, J. Rompel, and M. Sipser. On the Power of Multi-Prover Interactive Protocols, Proceedings of Structure 1988.","DOI":"10.1109\/SCT.1988.5275"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"A. Fiat and A. Shamir. How to Prove Yourself: Practical Solution to Identification and Signature Problems. Advances in Cryptology \u2014 Crypto\u2019 86, pp. 186\u2013189.","DOI":"10.1007\/3-540-47721-7_12"},{"key":"25_CR20","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"S. Goldwasser, S. Micali, and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems, SIAM J. Comput. 18 (1989), 186\u2013208.","journal-title":"SIAM J. Comput."},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"J. Kilian. A note on efficient zero-knowledge proofs and arguments, Proceedings of STOC 1992.","DOI":"10.1145\/129712.129782"},{"key":"25_CR22","unstructured":"J. Kilian On the complexity of bounded interaction and noninteractive proofs. Proceedings of FOCS 1994."},{"key":"25_CR23","unstructured":"C. Lund, L. Fortnow, H. Karloff, and N. Nisan. The polynomial-time hierarchy has interactive proofs, Proceedings of STOC 1990, pp. 2\u201310."},{"key":"25_CR24","doi-asserted-by":"crossref","unstructured":"R. Merkle. A Certified Digital Signature. Proceedings of Crypto\u2019 89, pp. 218\u2013238.","DOI":"10.1007\/0-387-34805-0_21"},{"key":"25_CR25","unstructured":"S. Micali. Computationally Sound Proofs, Proceedings of FOCS 1994."},{"key":"25_CR26","doi-asserted-by":"crossref","unstructured":"M. Naor, R. Ostrovsky, R. Venkatesan and M. Yung. Perfect Zero-Knowledge Arguments for N P can be Based on General Complexity Assumptions. Advances in Cryptology \u2014 Crypto\u2019 92, pp. 196\u2013214.","DOI":"10.1007\/3-540-48071-4_14"},{"key":"25_CR27","doi-asserted-by":"crossref","unstructured":"A. Polishchuk and D. Spielman. Nearly-linear Size Holographic Proofs. Proceedings of STOC 1994.","DOI":"10.1145\/195058.195132"},{"key":"25_CR28","unstructured":"S. Rudich, Personal communication via Gilles Brassard."},{"key":"25_CR29","unstructured":"A. Shamir. IP = PSPACE, Proceedings of FOCS 1990, IEEE."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPT0\u2019 95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44750-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T00:19:27Z","timestamp":1556756367000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44750-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602217","9783540447504"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-44750-4_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1995]]}}}