{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:18:48Z","timestamp":1758269928870},"reference-count":29,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6894,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,9]]},"DOI":"10.1016\/0304-3975(94)90237-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"291-317","source":"Crossref","is-referenced-by-count":24,"title":["The knowledge complexity of quadratic residuosity languages"],"prefix":"10.1016","volume":"132","author":[{"given":"Alfredo","family":"De Santis","sequence":"first","affiliation":[]},{"given":"Giovanni","family":"Di Crescenzo","sequence":"additional","affiliation":[]},{"given":"Guiseppe","family":"Persiano","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90237-2_bib1","article-title":"Lecture notes on the complexity of some problems in number theory","volume":"243","author":"Angluin","year":"1982"},{"issue":"2","key":"10.1016\/0304-3975(94)90237-2_bib2","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0022-0000(79)90045-X","article-title":"Fast probabilistic algorithms for Hamiltonian circuits and matchings","volume":"18","author":"Angluin","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(94)90237-2_bib3","first-page":"482","article-title":"Perfect zero knowledge in constant rounds","author":"Bellare","year":"1990","journal-title":"Proc. 22th Ann. Symp. on the Theory of Comput."},{"key":"10.1016\/0304-3975(94)90237-2_bib4","doi-asserted-by":"crossref","unstructured":"M. Bellare and M. Yung, Certifying cryptographic tools: The case of trapdoor permutations, in: Proc. of CRYPTO'92, to appear.","DOI":"10.1007\/3-540-48071-4_31"},{"key":"10.1016\/0304-3975(94)90237-2_bib5","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, O. Goldreich, S. Goldwasser, J. Hastad, S. Micali and P. Rogaway, Everything provable is provable in zero knowledge, in: S. Goldwasser, ed., Advances in Cryptology \u2013 CRYPTO 88, Lecture Notes in Computer Science, Vol. 403 (Springer, Berlin) 37\u201356.","DOI":"10.1007\/0-387-34799-2_4"},{"key":"10.1016\/0304-3975(94)90237-2_bib6","first-page":"313","article-title":"Safeguarding cryptographic keys","author":"Blackley","year":"1979","journal-title":"Proc. AFIPS 1979 National Computer Conf."},{"key":"10.1016\/0304-3975(94)90237-2_bib7","doi-asserted-by":"crossref","first-page":"1084","DOI":"10.1137\/0220068","article-title":"Non-interactive zero-knowledge","volume":"20","author":"Blum","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)90237-2_bib8","first-page":"103","article-title":"Non-interactive zero-knowledge and applications","author":"Blum","year":"1988","journal-title":"Proc. 20th Ann. ACM Symp. on Theory of Comput."},{"key":"10.1016\/0304-3975(94)90237-2_bib9","first-page":"27","article-title":"Amplification of probabilistic boolean formulas","volume":"5","author":"Boppana","year":"1989","journal-title":"Adv. Comput. Res."},{"key":"10.1016\/0304-3975(94)90237-2_bib10","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0020-0190(87)90232-8","article-title":"Does co-NP has short interactive proofs?","volume":"25","author":"Boppana","year":"1987","journal-title":"Inform. Process Lett."},{"key":"10.1016\/0304-3975(94)90237-2_bib11","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/BF00196727","article-title":"Practical zero-knowledge proofs: giving hints and using deficiencies","volume":"4","author":"Boyar","year":"1991","journal-title":"J. Cryptology"},{"issue":"2","key":"10.1016\/0304-3975(94)90237-2_bib12","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","article-title":"Minimum disclosure proofs of knowledge","volume":"37","author":"Brassard","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(94)90237-2_bib13","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0304-3975(91)90259-5","article-title":"Perfect zero-knowledge computationally convincing proofs for NP in constant rounds","volume":"84","author":"Brassard","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90237-2_bib14","doi-asserted-by":"crossref","unstructured":"A. De Santis, S. Micali and G. Persiano, Non-interactive zero-knowledge proof-systems, in: Advances in Cryptology \u2013 CRYPTO 87, Lecture Notes in Computer Science, Vol. 293 (Springer, Berlin) 52\u201372.","DOI":"10.1007\/3-540-48184-2_5"},{"key":"10.1016\/0304-3975(94)90237-2_bib15","unstructured":"A. De Santis, G. Persiano and M. Yung, Perfect zero-knowledge proofs for graph isomorphism languages, manuscript."},{"key":"10.1016\/0304-3975(94)90237-2_bib16","series-title":"Probabilistic Methods in Combinatorics","author":"Erd\u00f6s","year":"1974"},{"key":"10.1016\/0304-3975(94)90237-2_bib17","first-page":"308","article-title":"Multiple noninteractive zero-knowledge proofs based on a single random string","author":"Feige","year":"1990","journal-title":"Proc. 22nd Ann. Symp. on the Theory of Comput"},{"key":"10.1016\/0304-3975(94)90237-2_bib18","first-page":"204","article-title":"The complexity of perfect zero knowledge","author":"Fortnow","year":"1987","journal-title":"Proc. 19th Ann. ACM Symp. on Theory of Comput."},{"key":"10.1016\/0304-3975(94)90237-2_bib19","first-page":"174","article-title":"On the composition of zero-knowledge proof systems","author":"Goldreich","year":"1986","journal-title":"Proc. 17th Internat. Coll. on Automata, Languages and Programming"},{"key":"10.1016\/0304-3975(94)90237-2_bib20","doi-asserted-by":"crossref","unstructured":"O. Goldreich and E. Kushilevitz, A perfect zero knowledge proof for a decision problem equivalent to discrete logarithm, in: S. Goldwasser, ed., Advances in Cryptology \u2014 CRYPTO 88, Lecture Notes in Computer Science, Vol. 403 (Springer, Berlin) 57\u201370.","DOI":"10.1007\/0-387-34799-2_5"},{"key":"10.1016\/0304-3975(94)90237-2_bib21","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1145\/116825.116852","article-title":"Proofs that yield nothing but their validity, or all languages in NP have zero-knowledge proofs","volume":"38","author":"Goldreich","year":"1991","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)90237-2_bib22","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali and A. Wigderson, How to play any mental game, in: Proc. 19th An. ACM Symp. on Theory of Comput. 218\u2013229.","DOI":"10.1145\/28395.28420"},{"key":"10.1016\/0304-3975(94)90237-2_bib23","article-title":"Quantifying knowledge complexity","author":"Goldreich","year":"1991","journal-title":"Proc. 32th IEEE Symp. on Foundations of Comput. Sci."},{"key":"10.1016\/0304-3975(94)90237-2_bib24","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","article-title":"Probabilistic encryption","volume":"28","author":"Goldwasser","year":"1984","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0304-3975(94)90237-2_bib25","doi-asserted-by":"crossref","DOI":"10.1137\/0218012","article-title":"The knowledge complexity of interactive proof-systems","volume":"18","author":"Goldwasser","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)90237-2_bib26","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo and M. Yung, Direct minimum knowledge computations in: Advances in Cryptology \u2013 CRYPTO 87, Lecture Notes in Computer Science, Vol. 273 (Springer, Berlin) 40\u201351.","DOI":"10.1007\/3-540-48184-2_4"},{"key":"10.1016\/0304-3975(94)90237-2_bib27","series-title":"An Introduction to the Theory of Numbers","author":"Niven","year":"1960"},{"key":"10.1016\/0304-3975(94)90237-2_bib28","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","article-title":"How to share a secret","volume":"22","author":"Shamir","year":"1979","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(94)90237-2_bib29","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1109\/SFCS.1987.49","article-title":"Random self-reducibility and zero-knowledge interactive proofs of possession of information","author":"Tompa","year":"1987","journal-title":"Proc. 28th Symp. in Foundations of Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594902372?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594902372?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T06:16:34Z","timestamp":1580883394000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594902372"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":29,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["0304397594902372"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90237-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}