{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:20:24Z","timestamp":1743135624575,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540494966"},{"type":"electronic","value":"9783540494973"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11935308_10","type":"book-chapter","created":{"date-parts":[[2006,11,15]],"date-time":"2006-11-15T11:26:42Z","timestamp":1163590002000},"page":"122-138","source":"Crossref","is-referenced-by-count":11,"title":["A Construction for General and Efficient Oblivious Commitment Based Envelope Protocols"],"prefix":"10.1007","author":[{"given":"Jiangtao","family":"Li","sequence":"first","affiliation":[]},{"given":"Ninghui","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/11507840_7","volume-title":"Financial Cryptography and Data Security","author":"W. Bagga","year":"2005","unstructured":"Bagga, W., Molva, R.: Policy-based cryptography and applications. In: S. Patrick, A., Yung, M. (eds.) FC 2005. LNCS, vol.\u00a03570, pp. 72\u201387. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Balfanz, D., Durfee, G., Shankar, N., Smetters, D., Staddon, J., Hao-Chi, W.: Secret handshakes from pairing-based key agreements. In: Proceedings of the IEEE Symposium and Security and Privacy, May 2003, pp. 180\u2013196 (2003)","key":"10_CR2","DOI":"10.1109\/SECPRI.2003.1199336"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1007\/3-540-69053-0_33","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"N. Bari\u0107","year":"1997","unstructured":"Bari\u0107, N., Pfitzmann, B.: Collision-free accumulators and fail-stop signature schemes without trees. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 480\u2013494. Springer, Heidelberg (1997)"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/3-540-48071-4_28","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Goldreich, O.: On defining proofs of knowledge. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 390\u2013420. Springer, Heidelberg (1993)"},{"key":"10_CR5","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":"10_CR6","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)"},{"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, pp. 146\u2013157 (2004)","key":"10_CR7","DOI":"10.1145\/1030083.1030104"},{"key":"10_CR8","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. Camenisch","year":"2001","unstructured":"Camenisch, J., 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)"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-540-30539-2_21","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"C. Castelluccia","year":"2004","unstructured":"Castelluccia, C., Jarecki, S., Tsudik, G.: Secret handshakes from CA-oblivious encryption. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol.\u00a03329, pp. 293\u2013307. Springer, Heidelberg (2004)"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/319709.319716","volume-title":"Proceedings of the 6th ACM Conference on Computer and Communications Security","author":"R. Cramer","year":"1999","unstructured":"Cramer, R., Shoup, V.: Signature schemes based on the strong RSA assumption. In: Proceedings of the 6th ACM Conference on Computer and Communications Security, pp. 46\u201351. ACM Press, New York (1999)"},{"doi-asserted-by":"crossref","unstructured":"Crampton, J., Loizou, G.: Administrative scope and role hierarchy operations. In: Proceedings of 7th ACM Symposium on Access Control Models and Technologies, June 2002, pp. 145\u2013154 (2002)","key":"10_CR11","DOI":"10.1145\/507711.507736"},{"key":"10_CR12","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 disclosure of secrets and applications (abstract). In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol.\u00a0434, pp. 150\u2013154. Springer, Heidelberg (1990)"},{"key":"10_CR13","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. Di Crescenzo","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":"10_CR14","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: ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 125\u2013142. Springer, Heidelberg (2002)"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/978-3-540-24676-3_36","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"Y. Dodis","year":"2004","unstructured":"Dodis, Y., Kiayias, A., Nicolosi, A., Shoup, V.: Anonymous identification in ad hoc groups. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 609\u2013626. Springer, Heidelberg (2004)"},{"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)","key":"10_CR16","DOI":"10.1145\/1029179.1029186"},{"key":"10_CR17","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":"10_CR18","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. Garay","year":"2004","unstructured":"Garay, J., MacKenzie, P., Yang, K.: Efficient and universally composable committed oblivious transfer and applications. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 297\u2013316. Springer, Heidelberg (2004)"},{"doi-asserted-by":"crossref","unstructured":"Holt, J.E., Bradshaw, R.W., Seamons, K.E., Orman, H.: Hidden credentials. In: Proceedings of the 2nd ACM Workshop on Privacy in the Electronic Society, October 2003, pp. 1\u20138 (2003)","key":"10_CR19","DOI":"10.1145\/1005140.1005142"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/11496137_21","volume-title":"Applied Cryptography and Network Security","author":"J. Li","year":"2005","unstructured":"Li, J., Li, N.: OACerts: Oblivious attribute certificates. In: Ioannidis, J., Keromytis, A.D., Yung, M. (eds.) ACNS 2005. LNCS, vol.\u00a03531, pp. 301\u2013317. Springer, Heidelberg (2005)"},{"key":"10_CR21","first-page":"29","volume-title":"Proceedings of the 24nd ACM Symposium on Principles of Distributed Computing","author":"J. Li","year":"2005","unstructured":"Li, J., Li, N.: Policy-hiding access control in open environment. In: Proceedings of the 24nd ACM Symposium on Principles of Distributed Computing, pp. 29\u201338. ACM Press, New York (2005)"},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/1102120.1102129","volume-title":"Proceedings of the 12th ACM Conference on Computer and Communications Security","author":"J. Li","year":"2005","unstructured":"Li, J., Li, N., Winsborough, W.H.: Automated trust negotiation using cryptographic credentials. In: Proceedings of the 12th ACM Conference on Computer and Communications Security, pp. 46\u201357. ACM Press, New York (2005)"},{"key":"10_CR23","first-page":"182","volume-title":"Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing","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, pp. 182\u2013189. ACM Press, New York (2003)"},{"key":"10_CR24","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. In: Heys, H.M., Adams, C.M. (eds.) SAC 1999. LNCS, vol.\u00a01758, pp. 184\u2013199. Springer, Heidelberg (2000)"},{"key":"10_CR25","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)"},{"unstructured":"Rabin, M.O.: How to exchange secrets by oblivious transfer. Technical Report Memo TR-81, Aiken Computation Laboratory, Harvard University (1981)","key":"10_CR26"},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-36563-X_8","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"N. Smart","year":"2003","unstructured":"Smart, N.: Access control using pairing based cryptography. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 111\u2013121. Springer, Heidelberg (2003)"},{"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, May 2004, pp. 147\u2013160 (2004)","key":"10_CR28","DOI":"10.1109\/SECPRI.2004.1301321"},{"key":"10_CR29","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, vol.\u00a0I, pp. 88\u2013102. IEEE Press, Los Alamitos (2000)"},{"issue":"1","key":"10_CR30","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\u00a06(1), 1\u201342 (2003)","journal-title":"ACM Transactions on Information and System Security"}],"container-title":["Lecture Notes in Computer Science","Information and Communications Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11935308_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T23:14:30Z","timestamp":1736637270000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11935308_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540494966","9783540494973"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/11935308_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}