{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T19:29:47Z","timestamp":1729625387306,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/pimrc.2005.1651933","type":"proceedings-article","created":{"date-parts":[[2006,8,3]],"date-time":"2006-08-03T00:10:31Z","timestamp":1154563831000},"page":"2696-2700","source":"Crossref","is-referenced-by-count":1,"title":["Provably Secure Anonymous Identification Protocols for Ad-hoc Access Structures"],"prefix":"10.1109","volume":"4","author":[{"family":"Huafei Zhu","sequence":"first","affiliation":[]},{"family":"Tieyan Li","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","first-page":"82","article-title":"Ring identification schemes","author":"zhu","year":"0","journal-title":"Chinacrypt'04"},{"key":"16","first-page":"101","article-title":"Constructing Committed Signatures from Strong-RSA Assumption in the Standard Complexity Model","author":"huafei zhu","year":"2004","journal-title":"Public Key Cryptography"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365745"},{"key":"14","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1007\/3-540-45682-1_32","article-title":"How to Leak A Secret, ASIACRYPT","volume":"2248","author":"rivest","year":"2001","journal-title":"Lecture Notes in Computer Science"},{"key":"11","first-page":"188","article-title":"Huafei Zhu: Design and Security Analysis of Anonymous Group Identification Protocols","author":"chan","year":"2002","journal-title":"Public Key Cryptography"},{"key":"12","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1145\/288090.288110","article-title":"Crescenzo and G. Persiano. Commmunication- efficient Anonymous Group Identification. With An extended","author":"de santis","year":"1998","journal-title":"the Proc of the Fifth ACM Conference on Computer and Communications Security"},{"key":"3","article-title":"Resettable Zero-Knowledge","volume":"42","author":"canetti","year":"1999","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"year":"0","key":"2"},{"year":"0","key":"1"},{"year":"0","key":"10"},{"key":"7","first-page":"291","article-title":"The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract)","author":"goldwasser","year":"1985","journal-title":"STOC"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-002-0038-7"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"year":"0","key":"4"},{"key":"9","first-page":"376","article-title":"The Discrete Logarithm Modulo a Composite Hides O(n) Bits","volume":"47","author":"ha?stad","year":"1993","journal-title":"JCSS"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45961-8_11"}],"event":{"name":"2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications","location":"Berlin, Germany"},"container-title":["2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10989\/34629\/01651933.pdf?arnumber=1651933","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T08:15:53Z","timestamp":1497687353000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1651933\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/pimrc.2005.1651933","relation":{},"subject":[]}}