{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T12:12:39Z","timestamp":1767183159891},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642193781"},{"type":"electronic","value":"9783642193798"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19379-8_12","type":"book-chapter","created":{"date-parts":[[2011,3,1]],"date-time":"2011-03-01T17:29:44Z","timestamp":1299000584000},"page":"192-209","source":"Crossref","is-referenced-by-count":29,"title":["Oblivious Transfer with Hidden Access Control Policies"],"prefix":"10.1007","author":[{"given":"Jan","family":"Camenisch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Dubovitskaya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregory","family":"Neven","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregory M.","family":"Zaverucha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/11832072_8","volume-title":"Security and Cryptography for Networks","author":"M.H. Au","year":"2006","unstructured":"Au, M.H., Susilo, W., Mu, Y.: Constant-size dynamic k-TAA. In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol.\u00a04116, pp. 111\u2013125. Springer, Heidelberg (2006)"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-540-28628-8_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X., Shacham, H.: Short group signatures. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 41\u201355. Springer, Heidelberg (2004)"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-642-03356-8_7","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"M. Belenkiy","year":"2009","unstructured":"Belenkiy, M., Camenisch, J., Chase, M., Kohlweiss, M., Lysyanskaya, A., Shacham, H.: Randomizable proofs and delegatable anonymous credentials. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 108\u2013125. Springer, Heidelberg (2009)"},{"key":"12_CR4","first-page":"46","volume-title":"11th (CCS 2004)","author":"R.W. Bradshaw","year":"2004","unstructured":"Bradshaw, R.W., Holt, J.E., Seamons, K.E.: Concealing complex policies with hidden credentials. In: 11th (CCS 2004), pp. 46\u2013157. ACM Press, New York (2004)"},{"key":"12_CR5","unstructured":"Canetti, R.: Studies in Secure Multiparty Computation and Applications. PhD thesis, Weizmann Institute of Science, Rehovot 76100, Israel (June 1995)"},{"issue":"1","key":"12_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R. Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multi-party cryptographic protocols. Journal of Cryptology\u00a013(1), 143\u2013202 (2000)","journal-title":"Journal of Cryptology"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-642-01001-9_20","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"J. Camenisch","year":"2009","unstructured":"Camenisch, J., Chandran, N., Shoup, V.: A public key encryption scheme secure against key dependent chosen plaintext and adaptive chosen ciphertext attacks. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol.\u00a05479, pp. 351\u2013368. Springer, Heidelberg (2009)"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1145\/1653662.1653679","volume-title":"ACM CCS 2009","author":"J. Camenisch","year":"2009","unstructured":"Camenisch, J., Dubovitskaya, M., Neven, G.: Oblivious transfer with access control. In: ACM CCS 2009, pp. 131\u2013140. ACM Press, New York (2009)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-642-00468-1_28","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"S. Coull","year":"2009","unstructured":"Coull, S., Green, M., Hohenberger, S.: Controlling access to an oblivious database using stateful anonymous credentials. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol.\u00a05443, pp. 501\u2013520. Springer, Heidelberg (2009)"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/978-3-540-28628-8_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"J. Camenisch","year":"2004","unstructured":"Camenisch, J., Lysyanskaya, A.: Signature schemes and anonymous credentials from bilinear maps. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 56\u201372. Springer, Heidelberg (2004)"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/978-3-540-72540-4_33","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"J. Camenisch","year":"2007","unstructured":"Camenisch, J., Neven, G., Shelat, A.: Simulatable adaptive oblivious transfer. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 573\u2013590. Springer, Heidelberg (2007)"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Haralambiev, K., Lopez-Alt, A., Wichs, D.: Cryptography against continuous memory attacks. Cryptology ePrint Archive, Report 2010\/196 (2010)","DOI":"10.1109\/FOCS.2010.56"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-540-30580-4_28","volume-title":"Public Key Cryptography - PKC 2005","author":"Y. Dodis","year":"2005","unstructured":"Dodis, Y., Yampolskiy, A.: A verifiable random function with short proofs and keys. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol.\u00a03386, pp. 416\u2013431. Springer, Heidelberg (2005)"},{"issue":"4","key":"12_CR14","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory\u00a031(4), 469\u2013472 (1985)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"10","key":"12_CR15","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1109\/TC.2006.158","volume":"55","author":"K.B. Frikken","year":"2006","unstructured":"Frikken, K.B., Atallah, M.J., Li, J.: Attribute-based access control with hidden policies and hidden credentials. IEEE Trans. Computers\u00a055(10), 1259\u20131270 (2006)","journal-title":"IEEE Trans. Computers"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-540-78967-3_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"J. Groth","year":"2008","unstructured":"Groth, J., Sahai, A.: Efficient non-interactive proof systems for bilinear groups. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 415\u2013432. Springer, Heidelberg (2008)"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1005140.1005142","volume-title":"ACM WPES 2003","author":"J.E. Holt","year":"2003","unstructured":"Holt, J.E., Bradshaw, R.W., Seamons, K.E., Orman, H.K.: Hidden credentials. In: ACM WPES 2003, USA, pp. 1\u20138. ACM, New York (2003)"},{"key":"12_CR18","unstructured":"Herranz, J.: Restricted adaptive oblivious transfer. Cryptology ePrint Archive, Report 2008\/182 (2008)"},{"key":"12_CR19","first-page":"92","volume-title":"POLICY 2002","author":"N. Li","year":"2002","unstructured":"Li, N., Winsborough, W.: Towards practical automated trust negotiation. In: POLICY 2002, Washington, DC, USA, p. 92. IEEE Computer Society, Los Alamitos (2002)"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-642-00468-1_26","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"T. Nakanishi","year":"2009","unstructured":"Nakanishi, T., Fujii, H., Hira, Y., Funabiki, N.: Revocable group signature schemes with constant costs for signing and verifying. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol.\u00a05443, pp. 463\u2013480. Springer, Heidelberg (2009)"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1007\/3-540-48405-1_36","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"M. Naor","year":"1999","unstructured":"Naor, M., Pinkas, B.: Oblivious transfer with adaptive queries. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 573\u2013590. Springer, Heidelberg (1999)"},{"key":"12_CR22","first-page":"245","volume-title":"7th ACM CCS","author":"B. Pfitzmann","year":"2000","unstructured":"Pfitzmann, B., Waidner, M.: Composition and integrity preservation of secure reactive systems. In: 7th ACM CCS, pp. 245\u2013254. ACM Press, New York (2000)"},{"key":"12_CR23","first-page":"184","volume-title":"Proceedings of the IEEE Symposium on Research in Security and Privacy","author":"B. Pfitzmann","year":"2001","unstructured":"Pfitzmann, B., Waidner, M.: A model for asynchronous reactive systems and its application to secure message transmission. In: Proceedings of the IEEE Symposium on Research in Security and Privacy, pp. 184\u2013200. IEEE Computer Society, IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"12_CR24","unstructured":"Rabin, M.O.: How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard Aiken Computation Laboratory (1981)"},{"key":"12_CR25","first-page":"160","volume-title":"23rd FOCS","author":"A.C. Yao","year":"1982","unstructured":"Yao, A.C.: Protocols for secure computations. In: 23rd FOCS, pp. 160\u2013164. IEEE Computer Society Press, Los Alamitos (1982)"},{"key":"12_CR26","first-page":"110","volume-title":"IEEE Symposium on Security and Privacy (S&P 2003)","author":"T. Yu","year":"2003","unstructured":"Yu, T., Winslett, M.: A unified scheme for resource protection in automated trust negotiation. In: IEEE Symposium on Security and Privacy (S&P 2003), USA, pp. 110\u2013122. IEEE Computer Society, Los Alamitos (2003)"},{"key":"12_CR27","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1145\/501983.502004","volume-title":"ACM CCS 2001","author":"T. Yu","year":"2001","unstructured":"Yu, T., Winslett, M., Seamons, K.E.: Interoperable strategies in automated trust negotiation. In: ACM CCS 2001, pp. 146\u2013155. ACM Press, New York (2001)"},{"key":"12_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44987-6_8","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"W. Aiello","year":"2001","unstructured":"Aiello, W., Ishai, Y., Reingold, O.: Priced oblivious transfer: How to sell digital goods. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, p. 119. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2013 PKC 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19379-8_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:46:39Z","timestamp":1606185999000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19379-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642193781","9783642193798"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19379-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}