{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:41:50Z","timestamp":1778298110618,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":45,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540262237","type":"print"},{"value":"9783540315421","type":"electronic"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496137_21","type":"book-chapter","created":{"date-parts":[[2010,9,25]],"date-time":"2010-09-25T19:14:24Z","timestamp":1285442064000},"page":"301-317","source":"Crossref","is-referenced-by-count":22,"title":["OACerts: Oblivious Attribute Certificates"],"prefix":"10.1007","author":[{"given":"Jiangtao","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ninghui","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Balfanz, D., Durfee, G., Shankar, N., Smetters, D., Staddon, J., Wong, H.C.: Secret handshakes from pairing-based key agreements. In: Proceedings of the IEEE Symposium and Security and Privacy, pp. 180\u2013196 (May 2003)","DOI":"10.1109\/SECPRI.2003.1199336"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/168588.168596","volume-title":"Proceedings of the 1st ACM Conference on Computer and Communications Security","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: Proceedings of the 1st ACM Conference on Computer and Communications Security, pp. 62\u201373. ACM Press, New York (1993)"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1109\/SECPRI.1996.502679","volume-title":"Proceedings of the 1996 IEEE Symposium on Security and Privacy","author":"M. Blaze","year":"1996","unstructured":"Blaze, M., Feigenbaum, J., Lacy, J.: Decentralized trust management. In: Proceedings of the 1996 IEEE Symposium on Security and Privacy, May 1996, pp. 164\u2013173. IEEE Computer Society Press, Los Alamitos (1996)"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Boeyen, S., Howes, T., Richard, P.: Internet X.509 Public Key Infrastructure LDAPc2 Schema. IETF RFC 2587 (June 1999)","DOI":"10.17487\/rfc2587"},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-45539-6_31","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"F. Boudot","year":"2000","unstructured":"Boudot, F.: Efficient proofs that a committed number lies in an interval. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 431\u2013444. Springer, Heidelberg (2000)"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Bradshaw, R., Holt, J., Seamons, K.: Concealing complex policies with hidden credentials. In: Proceedings of 11th ACM Conference on Computer and Communications Security (October 2004)","DOI":"10.1145\/1030083.1030104"},{"key":"21_CR7","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5931.001.0001","volume-title":"Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy","author":"S.A. Brands","year":"2000","unstructured":"Brands, S.A.: Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy, August 2000. MIT Press, Cambridge (2000)"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/586110.586114","volume-title":"Proceedings of the 9th ACM Conference on Computer and Communications Security, CCS 2002","author":"J. Camenisch","year":"2002","unstructured":"Camenisch, J., Van Herreweghen, E.: Design and plementation of the idemix anonymous credential system. In: Proceedings of the 9th ACM Conference on Computer and Communications Security, CCS 2002, November 2002, pp. 21\u201330. ACM, New York (2002)"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-44987-6_7","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"J.L. Camenisch","year":"2001","unstructured":"Camenisch, J.L., Lysyanskaya, A.: An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 93\u2013118. Springer, Heidelberg (2001)"},{"issue":"10","key":"21_CR10","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1145\/4372.4373","volume":"28","author":"D. Chaum","year":"1985","unstructured":"Chaum, D.: Security without identification: Transaction systems to make big brother obsolete. Communications of the ACM\u00a028(10), 1030\u20131044 (1985)","journal-title":"Communications of the ACM"},{"issue":"4","key":"21_CR11","doi-asserted-by":"crossref","first-page":"285","DOI":"10.3233\/JCS-2001-9402","volume":"9","author":"D. Clarke","year":"2001","unstructured":"Clarke, D., Elien, J.-E., Ellison, C., Fredette, M., Morcos, A., Rivest, R.L.: Certificate chain discovery in SPKI\/SDSI. Journal of Computer Security\u00a09(4), 285\u2013322 (2001)","journal-title":"Journal of Computer Security"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1007\/BFb0055745","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"R. Cramer","year":"1998","unstructured":"Cramer, R., Damg\u00e5rd, I.B.: Zero-knowledge proofs for finite field arithmetic or: Can zero-knowledge be for free? In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 424\u2013441. Springer, Heidelberg (1998)"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/3-540-68339-9_7","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"R. Cramer","year":"1996","unstructured":"Cramer, R., Franklin, M.K., Schoenmakers, B., Yung, M.: Multi-authority secret-ballot elections with linear work. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 72\u201383. Springer, Heidelberg (1996)"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/3-540-46885-4_17","volume-title":"Advances in Cryptology - EUROCRYPT \u201989","author":"C. Cr\u00e9peau","year":"1990","unstructured":"Cr\u00e9peau, C.: Verifiable disclose for secrets and applications. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol.\u00a0434, pp. 150\u2013154. Springer, Heidelberg (1990)"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/3-540-48910-X_6","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"G. Crescenzo Di","year":"1999","unstructured":"Di Crescenzo, G., Ostrovsky, R., Rajagopalan, S.: Conditional oblivious transfer and timed-release encryption. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 74\u201389. Springer, Heidelberg (1999)"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-36178-2_8","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"I. Damg\u00e5rd","year":"2002","unstructured":"Damg\u00e5rd, I., Fujisaki, E.: An integer commitment scheme based on groups with hidden order. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 125\u2013142. Springer, Heidelberg (2002)"},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transactions on Information Theory\u00a022, 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/352600.352610","volume-title":"Proceedings of the 7th ACM Conference on Computer and Communications Security","author":"G. Durfee","year":"2000","unstructured":"Durfee, G., Franklin, M.: Distribution chain security. In: Proceedings of the 7th ACM Conference on Computer and Communications Security, pp. 63\u201370. ACM Press, New York (2000)"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Ellison, C., Frantz, B., Lampson, B., Rivest, R., Thomas, B., Ylonen, T.: SPKI certificate theory. IETF RFC 2693 (September 1999)","DOI":"10.17487\/rfc2693"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Farrell, S., Housley, R.: An internet attribute certificate profile for authorization. IETF RFC 3281 (April 2002)","DOI":"10.17487\/rfc3281"},{"key":"21_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/3-540-45353-9_33","volume-title":"Topics in Cryptology - CT-RSA 2001","author":"M. Fischlin","year":"2001","unstructured":"Fischlin, M.: A cost-effective pay-per-multiplication comparison method for millionaires. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol.\u00a02020, pp. 457\u2013472. Springer, Heidelberg (2001)"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Frikken, K.B., Atallah, M.J., Li, J.: Hidden access control policies with hidden credentials. In: Proceedings of the 3rd ACM Workshop on Privacy in the Electronic Society (October 2004)","DOI":"10.1145\/1029179.1029186"},{"key":"21_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/BFb0052225","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"E. Fujisaki","year":"1997","unstructured":"Fujisaki, E., Okamoto, T.: Statistical zero knowledge protocols to prove modular polynomial relations. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 16\u201330. Springer, Heidelberg (1997)"},{"key":"21_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-540-24638-1_17","volume-title":"Theory of Cryptography","author":"J.A. Garay","year":"2004","unstructured":"Garay, J.A.: Efficient and universally composable committed oblivious transfer and applications. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 297\u2013316. Springer, Heidelberg (2004)"},{"key":"21_CR25","unstructured":"Goldreich, O.: Secure multi-party computation (October 2002)"},{"key":"21_CR26","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the nineteenth annual ACM conference on Theory of computing, pp. 218\u2013 229 (May 1987)","DOI":"10.1145\/28395.28420"},{"key":"21_CR27","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM Journal on Computing\u00a018, 186\u2013208 (1989)","journal-title":"SIAM Journal on Computing"},{"key":"21_CR28","doi-asserted-by":"crossref","unstructured":"Holt, J.E., Bradshaw, R.W., Seamons, K.E., Orman, H.: Hidden credentials. In: Proceedings of the 2nd ACMWorkshop on Privacy in the Electronic Society (October 2003)","DOI":"10.1145\/1005140.1005142"},{"key":"21_CR29","doi-asserted-by":"crossref","unstructured":"Housley, R., Ford, W., Polk, T., Solo, D.: Internet X.509 Public Key Infrastructure Certificate and CRL Profile. IETF RFC 2459 (January 1999)","DOI":"10.17487\/rfc2459"},{"key":"21_CR30","unstructured":"JCSI. Java cryptographic secure implementation. Wedgetail Communications (2004)"},{"key":"21_CR31","doi-asserted-by":"crossref","unstructured":"Li, J., Li, N.: OACerts: Oblivious attribute certificates. Technical Report CERIAS-TR-2005-26, Center for Education and Research in Information Assurance and Security, Purdue University (April 2005)","DOI":"10.1007\/11496137_21"},{"key":"21_CR32","volume-title":"Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC 2003)","author":"N. Li","year":"2003","unstructured":"Li, N., Du, W., Boneh, D.: Oblivious signature-based envelope. In: Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC 2003), July 2003. ACM Press, New York (2003)"},{"key":"21_CR33","doi-asserted-by":"crossref","unstructured":"Li, N., Du, W., Boneh, D.: Oblivious signature-based envelope. Distributed Computing (2005) (to appear)","DOI":"10.1007\/s00446-004-0116-1"},{"key":"21_CR34","first-page":"114","volume-title":"Proceedings of the 2002 IEEE Symposium on Security and Privacy","author":"N. Li","year":"2002","unstructured":"Li, N., Mitchell, J.C., Winsborough, W.H.: Design of a role-based trust management framework. In: Proceedings of the 2002 IEEE Symposium on Security and Privacy, May 2002, pp. 114\u2013130. IEEE Computer Society Press, Los Alamitos (2002)"},{"issue":"1","key":"21_CR35","doi-asserted-by":"crossref","first-page":"35","DOI":"10.3233\/JCS-2003-11102","volume":"11","author":"N. Li","year":"2003","unstructured":"Li, N., Winsborough, W.H., Mitchell, J.C.: Distributed credential chain discovery in trust management. Journal of Computer Security\u00a011(1), 35\u201386 (2003)","journal-title":"Journal of Computer Security"},{"key":"21_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/3-540-46513-8_14","volume-title":"Selected Areas in Cryptography","author":"A. Lysyanskaya","year":"2000","unstructured":"Lysyanskaya, A., Rivest, R.L., Sahai, A., Wolf, S.: Pseudonym systems (Extended abstract). In: Heys, H.M., Adams, C.M. (eds.) SAC 1999. LNCS, vol.\u00a01758, pp. 184\u2013199. Springer, Heidelberg (2000)"},{"key":"21_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/BFb0054015","volume-title":"Public Key Cryptography","author":"W. Mao","year":"1998","unstructured":"Mao, W.: Guaranteed correct sharing of integer factorization with off-line shareholders. In: Imai, H., Zheng, Y. (eds.) PKC 1998. LNCS, vol.\u00a01431, pp. 60\u201371. Springer, Heidelberg (1998)"},{"key":"21_CR38","unstructured":"Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: Proceedings of SODA 2001 (SIAM Symposium on Discrete Algorithms), pp. 448\u2013457 (January 2001)"},{"key":"21_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"T.P. Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 129\u2013140. Springer, Heidelberg (1992)"},{"key":"21_CR40","volume-title":"SSL, TLS: Designing, and Building Secure Systems","author":"E. Rescorla","year":"2001","unstructured":"Rescorla, E.: SSL, TLS: Designing, and Building Secure Systems. Addison-Wesley, Reading (2001)"},{"key":"21_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-45664-3_11","volume-title":"Public Key Cryptography","author":"W.-G. Tzeng","year":"2002","unstructured":"Tzeng, W.-G.: Efficient 1-out-n oblivious transfer schemes. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol.\u00a02274, pp. 159\u2013171. Springer, Heidelberg (2002)"},{"key":"21_CR42","doi-asserted-by":"crossref","unstructured":"Winsborough, W.H., Li, N.: Safety in automated trust negotiation. In: Proceedings of the IEEE Symposium on Security and Privacy, pp. 147\u2013160 (May 2004)","DOI":"10.1109\/SECPRI.2004.1301321"},{"key":"21_CR43","first-page":"88","volume-title":"DARPA Information Survivability Conference and Exposition","author":"W.H. Winsborough","year":"2000","unstructured":"Winsborough, W.H., Seamons, K.E., Jones, V.E.: Automated trust negotiation. In: DARPA Information Survivability Conference and Exposition, January 2000, vol.\u00a0I, pp. 88\u2013102. IEEE Press, Los Alamitos (2000)"},{"key":"21_CR44","first-page":"162","volume-title":"Proceedings of the 27th IEEE Symposium on Foundations of Computer Science","author":"A.C. Yao","year":"1986","unstructured":"Yao, A.C.: How to generate and exchange secrets. In: Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, pp. 162\u2013167. IEEE Computer Society Press, Los Alamitos (1986)"},{"issue":"1","key":"21_CR45","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/605434.605435","volume":"6","author":"T. Yu","year":"2003","unstructured":"Yu, T., Winslett, M., Seamons, K.E.: Supporting structured credentials and sensitive policies through interoperable strategies for automated trust negotiation. ACM Transactions on Information and System Security (TISSEC)\u00a06(1), 1\u201342 (2003)","journal-title":"ACM Transactions on Information and System Security (TISSEC)"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496137_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T02:18:01Z","timestamp":1740536281000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496137_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262237","9783540315421"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/11496137_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}