{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T13:33:13Z","timestamp":1775309593866,"version":"3.50.1"},"reference-count":22,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sfcs.2002.1181961","type":"proceedings-article","created":{"date-parts":[[2003,6,26]],"date-time":"2003-06-26T15:35:00Z","timestamp":1056641700000},"page":"366-375","source":"Crossref","is-referenced-by-count":76,"title":["Concurrent zero knowledge with logarithmic round-complexity"],"prefix":"10.1109","author":[{"given":"M.","family":"Prabhakaran","sequence":"first","affiliation":[]},{"given":"A.","family":"Rosen","sequence":"additional","affiliation":[]},{"given":"A.","family":"Sahai","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743499"},{"key":"22","first-page":"451","article-title":"A note on the round-complexity of concurrent zero-knowledge","author":"rosen","year":"2000","journal-title":"Crypto"},{"key":"17","author":"kilian","year":"0"},{"key":"18","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/380752.380851","article-title":"Concurrent and resettable zero-knowledge in poly-logarithmic rounds","author":"kilian","year":"2001","journal-title":"30th STOC"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1137\/0217017"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244708"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116852"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791220688"},{"key":"21","first-page":"415","article-title":"On the concurrent composition of zero-knowledge proofs","author":"richardson","year":"1999","journal-title":"EUROCRYPT99"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90005-0"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196774"},{"key":"2","first-page":"1444","article-title":"How to prove a theorem so no one else can claim it","author":"blum","year":"1986","journal-title":"Proc of the International Congress of Mathematicians Berkeley California USA"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959885"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/509957.509959"},{"key":"7","first-page":"442","article-title":"Concurrent zero-knowledge: Reducing the need for timing constraints","author":"dwork","year":"1998","journal-title":"Crypto"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276853"},{"key":"5","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1145\/380752.380852","article-title":"Black-box concurrent zero-knowledge requires ??(log n) rounds","author":"canetti","year":"2001","journal-title":"30th STOC"},{"key":"4","first-page":"235","article-title":"Resetable zero-knowledge","author":"canetti","year":"2000","journal-title":"30th STOC"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100272"},{"key":"8","article-title":"Alternative models for zero knowledge interactive proofs","author":"feige","year":"1990"}],"event":{"name":"43rd Annual IEEE Symposium on Foundations of Computer Science","location":"Vancouver, BC, Canada","acronym":"SFCS-02"},"container-title":["The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8411\/26517\/01181961.pdf?arnumber=1181961","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T02:25:57Z","timestamp":1734056757000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1181961\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/sfcs.2002.1181961","relation":{},"subject":[]}}