{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T11:38:01Z","timestamp":1770982681684,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":58,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662443705","type":"print"},{"value":"9783662443712","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44371-2_27","type":"book-chapter","created":{"date-parts":[[2014,7,14]],"date-time":"2014-07-14T03:28:15Z","timestamp":1405308495000},"page":"480-499","source":"Crossref","is-referenced-by-count":168,"title":["Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation"],"prefix":"10.1007","author":[{"given":"Dan","family":"Boneh","sequence":"first","affiliation":[]},{"given":"Mark","family":"Zhandry","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/11889663_4","volume-title":"Financial Cryptography and Data Security","author":"A. Barth","year":"2006","unstructured":"Barth, A., Boneh, D., Waters, B.: Privacy in encrypted content distribution using private broadcast encryption. In: Di Crescenzo, G., Rubin, A. (eds.) FC 2006. LNCS, vol.\u00a04107, pp. 52\u201364. Springer, Heidelberg (2006)"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44647-8_1","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"B. Barak","year":"2001","unstructured":"Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S.P., Yang, K.: On the (Im)possibility of obfuscating programs. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 1\u201318. Springer, Heidelberg (2001)"},{"key":"27_CR3","unstructured":"Boyle, E., Goldwasser, S., Ivan, I.: Functional signatures and pseudorandom functions. Cryptology ePrint Archive, Report 2013\/401 (2013)"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Barak, B., Garg, S., Kalai, Y.T., Paneth, O., Sahai, A.: Protecting obfuscation against algebraic attacks. Cryptology ePrint Archive, Report 2013\/631 (2013), http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-642-55220-5_13"},{"key":"27_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/11535218_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"D. Boneh","year":"2005","unstructured":"Boneh, D., Gentry, C., Waters, B.: Collusion resistant broadcast encryption with short ciphertexts and private keys. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 258\u2013275. Springer, Heidelberg (2005)"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Boneh, D., Naor, M.: Traitor tracing with constant size ciphertext. In: ACM Conference on Computer and Communications Security, pp. 501\u2013510 (2008)","DOI":"10.1145\/1455770.1455834"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Rothblum, G.N.: Black-box obfuscation for d-cnfs. Cryptology ePrint Archive, Report 2013\/557 (2013), http:\/\/eprint.iacr.org\/","DOI":"10.1145\/2554797.2554820"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Rothblum, G.N.: Virtual black-box obfuscation for all circuits via generic graded encoding. Cryptology ePrint Archive, Report 2013\/563 (2013), http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-642-54242-8_1"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1090\/conm\/324\/05731","volume":"324","author":"D. Boneh","year":"2003","unstructured":"Boneh, D., Silverberg, A.: Applications of multilinear forms to cryptography. Contemporary Mathematics\u00a0324, 71\u201390 (2003)","journal-title":"Contemporary Mathematics"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/11761679_34","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"D. Boneh","year":"2006","unstructured":"Boneh, D., Sahai, A., Waters, B.: Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 573\u2013592. Springer, Heidelberg (2006)"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Boneh, D., Waters, B.: A fully collusion resistant broadcast trace and revoke system with public traceability. In: ACM Conference on Computer and Communication Security, CCS (2006)","DOI":"10.1145\/1180405.1180432"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-42045-0_15","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"D. Boneh","year":"2013","unstructured":"Boneh, D., Waters, B.: Constrained Pseudorandom Functions and Their Applications. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013, Part II. LNCS, vol.\u00a08270, pp. 280\u2013300. Springer, Heidelberg (2013)"},{"key":"27_CR13","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/978-3-662-44371-2_12","volume-title":"CRYPTO 2014, Part I","author":"D. Boneh","year":"2014","unstructured":"Boneh, D., Waters, B., Zhandry, M.: Low overhead broadcast encryption from multilinear maps. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part I. LNCS, vol.\u00a08616, pp. 206\u2013223. Springer, Heidelberg (2014)"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Boneh, D., Zhandry, M.: Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation. Full version available at the Cryptology ePrint Archives http:\/\/eprint.iacr.org\/2013\/642 .","DOI":"10.1007\/978-3-662-44371-2_27"},{"key":"27_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/BFb0052255","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"R. Canetti","year":"1997","unstructured":"Canetti, R.: Towards realizing random oracles: Hash functions that hide all partial information. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 455\u2013469. Springer, Heidelberg (1997)"},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/3-540-48658-5_25","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"B. Chor","year":"1994","unstructured":"Chor, B., Fiat, A., Naor, M.: Tracing traitors. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 257\u2013270. Springer, Heidelberg (1994)"},{"key":"27_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-642-40041-4_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"J.-S. Coron","year":"2013","unstructured":"Coron, J.-S., Lepoint, T., Tibouchi, M.: Practical Multilinear Maps over the Integers. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol.\u00a08042, pp. 476\u2013493. Springer, Heidelberg (2013)"},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"Canetti, R., Micciancio, D., Reingold, O.: Perfectly One-Way Probabilistic Hash Functions. In: Proc. of STOC 1998, pp. 131\u2013140 (1998)","DOI":"10.1145\/276698.276721"},{"key":"27_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/11426639_32","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"H. Chabanne","year":"2005","unstructured":"Chabanne, H., Phan, D.H., Pointcheval, D.: Public traceability in traitor tracing schemes. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 542\u2013558. Springer, Heidelberg (2005)"},{"key":"27_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-11799-2_5","volume-title":"Theory of Cryptography","author":"R. Canetti","year":"2010","unstructured":"Canetti, R., Rothblum, G.N., Varia, M.: Obfuscation of hyperplane membership. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 72\u201389. Springer, Heidelberg (2010)"},{"key":"27_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-540-76900-2_12","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"C. Delerabl\u00e9e","year":"2007","unstructured":"Delerabl\u00e9e, C.: Identity-Based Broadcast Encryption with Constant Size Ciphertexts and Private Keys. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 200\u2013215. Springer, Heidelberg (2007)"},{"key":"27_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-44993-5_5","volume-title":"Digital Rights Management","author":"Y. Dodis","year":"2003","unstructured":"Dodis, Y., Fazio, N.: Public key broadcast encryption for stateless receivers. In: Feigenbaum, J. (ed.) DRM 2002. LNCS, vol.\u00a02696, pp. 61\u201380. Springer, Heidelberg (2003)"},{"key":"27_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/3-540-36288-6_8","volume-title":"Public Key Cryptography - PKC 2003","author":"Y. Dodis","year":"2002","unstructured":"Dodis, Y., Fazio, N.: Public key broadcast encryption secure against adaptive chosen ciphertext attack. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 100\u2013115. Springer, Heidelberg (2002)"},{"key":"27_CR24","doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M., Reingold, O., Rothblum, G.N., Vadhan, S.: On the complexity of differentially private data release: efficient algorithms and hardness results. In: Proceedings of STOC 2009 (2009)","DOI":"10.1145\/1536414.1536467"},{"key":"27_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-540-73489-5_4","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2007","author":"C. Delerabl\u00e9e","year":"2007","unstructured":"Delerabl\u00e9e, C., Paillier, P., Pointcheval, D.: Fully collusion secure dynamic broadcast encryption with constant-size ciphertexts or decryption keys. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol.\u00a04575, pp. 39\u201359. Springer, Heidelberg (2007)"},{"key":"27_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-642-36362-7_17","volume-title":"Public-Key Cryptography \u2013 PKC 2013","author":"E.S.V. Freire","year":"2013","unstructured":"Freire, E.S.V., Hofheinz, D., Kiltz, E., Paterson, K.G.: Non-interactive key exchange. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol.\u00a07778, pp. 254\u2013271. Springer, Heidelberg (2013)"},{"key":"27_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/978-3-642-40041-4_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"E.S.V. Freire","year":"2013","unstructured":"Freire, E.S.V., Hofheinz, D., Paterson, K.G., Striecks, C.: Programmable Hash Functions in the Multilinear Setting. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol.\u00a08042, pp. 513\u2013530. Springer, Heidelberg (2013)"},{"key":"27_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/3-540-48329-2_40","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"A. Fiat","year":"1994","unstructured":"Fiat, A., Naor, M.: Broadcast encryption. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 480\u2013491. Springer, Heidelberg (1994)"},{"key":"27_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-642-30057-8_14","volume-title":"Public Key Cryptography \u2013 PKC 2012","author":"N. Fazio","year":"2012","unstructured":"Fazio, N., Perera, I.M.: Outsider-anonymous broadcast encryption with sublinear ciphertexts. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol.\u00a07293, pp. 225\u2013242. Springer, Heidelberg (2012)"},{"key":"27_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-642-13190-5_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"D.M. Freeman","year":"2010","unstructured":"Freeman, D.M.: Converting pairing-based cryptosystems from composite-order groups to prime-order groups. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 44\u201361. Springer, Heidelberg (2010)"},{"key":"27_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-38348-9_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"S. Garg","year":"2013","unstructured":"Garg, S., Gentry, C., Halevi, S.: Candidate multilinear maps from ideal lattices. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol.\u00a07881, pp. 1\u201317. Springer, Heidelberg (2013)"},{"key":"27_CR32","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: Proc. of FOCS 2013 (2013)","DOI":"10.1109\/FOCS.2013.13"},{"issue":"4","key":"27_CR33","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to Construct Random Functions. Journal of the ACM (JACM)\u00a033(4), 792\u2013807 (1986)","journal-title":"Journal of the ACM (JACM)"},{"key":"27_CR34","doi-asserted-by":"crossref","unstructured":"Garg, S., Kumarasubramanian, A., Sahai, A., Waters, B.: Building efficient fully collusion-resilient traitor tracing and revocation schemes. In: ACM Conference on Computer and Communications Security, pp. 121\u2013130 (2010)","DOI":"10.1145\/1866307.1866322"},{"key":"27_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-540-70936-7_11","volume-title":"Theory of Cryptography","author":"S. Goldwasser","year":"2007","unstructured":"Goldwasser, S., Rothblum, G.N.: On best-possible obfuscation. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 194\u2013213. Springer, Heidelberg (2007)"},{"key":"27_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/978-3-540-28628-8_31","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"M.T. Goodrich","year":"2004","unstructured":"Goodrich, M.T., Sun, J.Z., Tamassia, R.: Efficient tree-based revocation in groups of low-state devices. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 511\u2013527. Springer, Heidelberg (2004)"},{"key":"27_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-01001-9_10","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"C. Gentry","year":"2009","unstructured":"Gentry, C., Waters, B.: Adaptive security in broadcast encryption systems (with short ciphertexts). In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol.\u00a05479, pp. 171\u2013188. Springer, Heidelberg (2009)"},{"key":"27_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-45708-9_4","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"D. Halevy","year":"2002","unstructured":"Halevy, D., Shamir, A.: The LSD broadcast encryption scheme. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 47\u201360. Springer, Heidelberg (2002)"},{"key":"27_CR39","doi-asserted-by":"crossref","unstructured":"Hohenberger, S., Sahai, A., Waters, B.: Replacing a random oracle: Full domain hash from indistinguishability obfuscation. Cryptology ePrint Archive, Report 2013\/509 (2013)","DOI":"10.1007\/978-3-642-55220-5_12"},{"issue":"4","key":"27_CR40","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00145-004-0312-y","volume":"17","author":"A. Joux","year":"2004","unstructured":"Joux, A.: A One Round Protocol for Tripartite Diffie-Hellman. Journal of Cryptology\u00a017(4), 263\u2013276 (2004)","journal-title":"Journal of Cryptology"},{"key":"27_CR41","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Papadopoulos, S., Triandopoulos, N., Zacharias, T.: Delegatable pseudorandom functions and applications. In: Proceedings ACM CCS (2013)","DOI":"10.1145\/2508859.2516668"},{"key":"27_CR42","unstructured":"Koppula, V., Ramchen, K., Waters, B.: Separations in circular security for arbitrary length key cycles. Cryptology ePrint Archive, Report 2013\/683 (2013), http:\/\/eprint.iacr.org\/"},{"key":"27_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-642-36373-3_12","volume-title":"Information Hiding","author":"A. Kiayias","year":"2013","unstructured":"Kiayias, A., Samari, K.: Lower bounds for private broadcast encryption. In: Kirchner, M., Ghosal, D. (eds.) IH 2012. LNCS, vol.\u00a07692, pp. 176\u2013190. Springer, Heidelberg (2013)"},{"key":"27_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-540-44993-5_3","volume-title":"Digital Rights Management","author":"A. Kiayias","year":"2003","unstructured":"Kiayias, A., Yung, M.: Breaking and repairing asymmetric public-key traitor tracing. In: Feigenbaum, J. (ed.) DRM 2002. LNCS, vol.\u00a02696, pp. 32\u201350. Springer, Heidelberg (2003)"},{"key":"27_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-642-30057-8_13","volume-title":"Public Key Cryptography \u2013 PKC 2012","author":"B. Libert","year":"2012","unstructured":"Libert, B., Paterson, K.G., Quaglia, E.A.: Anonymous broadcast encryption: Adaptive security and efficient constructions in the standard model. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol.\u00a07293, pp. 206\u2013224. Springer, Heidelberg (2012)"},{"key":"27_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-540-24676-3_2","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"B. Lynn","year":"2004","unstructured":"Lynn, B., Prabhakaran, M., Sahai, A.: Positive results and techniques for obfuscation. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 20\u201339. Springer, Heidelberg (2004)"},{"key":"27_CR47","doi-asserted-by":"crossref","unstructured":"Lewko, A.B., Sahai, A., Waters, B.: Revocation systems with very small private keys. In: IEEE Symposium on Security and Privacy, pp. 273\u2013285 (2010)","DOI":"10.1109\/SP.2010.23"},{"key":"27_CR48","unstructured":"Moran, T., Rosen, A.: There is no indistinguishability obfuscation in pessiland. Cryptology ePrint Archive, Report 2013\/643 (2013), http:\/\/eprint.iacr.org\/"},{"key":"27_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-44647-8_3","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"D. Naor","year":"2001","unstructured":"Naor, D., Naor, M., Lotspiech, J.: Revocation and tracing schemes for stateless receivers. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 41\u201362. Springer, Heidelberg (2001)"},{"key":"27_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45472-1_1","volume-title":"Financial Cryptography","author":"M. Naor","year":"2001","unstructured":"Naor, M., Pinkas, B.: Efficient trace and revoke schemes. In: Frankel, Y. (ed.) FC 2000. LNCS, vol.\u00a01962, pp. 1\u201320. Springer, Heidelberg (2001)"},{"key":"27_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/3-540-61996-8_31","volume-title":"Information Hiding","author":"B. Pfitzmann","year":"1996","unstructured":"Pfitzmann, B.: Trials of traced traitors. In: Anderson, R. (ed.) IH 1996. LNCS, vol.\u00a01174, pp. 49\u201364. Springer, Heidelberg (1996)"},{"key":"27_CR52","doi-asserted-by":"crossref","unstructured":"Pfitzmann, B., Waidner, M.: Asymmetric fingerprinting for larger collusions. In: Proceedings of the ACM Conference on Computer and Communication Security, pp. 151\u2013160 (1997)","DOI":"10.1145\/266420.266453"},{"key":"27_CR53","unstructured":"Sakai, R., Furukawa, J.: Identity-Based Broadcast Encryption. IACR Cryptology ePrint Archive (2007)"},{"key":"27_CR54","unstructured":"Sirvent, T.: Traitor tracing scheme with constant ciphertext rate against powerful pirates. In: Workshop on Coding and Cryptography (2007)"},{"key":"27_CR55","doi-asserted-by":"crossref","unstructured":"Sahai, A., Waters, B.: How to Use Indistinguishability Obfuscation: Deniable Encryption, and More. Cryptology ePrint Archive, Report 2013\/454 (2013), http:\/\/eprint.iacr.org\/","DOI":"10.1145\/2591796.2591825"},{"key":"27_CR56","doi-asserted-by":"crossref","unstructured":"Ullman, J.: Answering n{2\u2009+\u2009o(1)} counting queries with differential privacy is hard. In: STOC, pp. 361\u2013370 (2013)","DOI":"10.1145\/2488608.2488653"},{"key":"27_CR57","doi-asserted-by":"crossref","unstructured":"Wee, H.: On obfuscating point functions. In: Proc. of STOC 2005, p. 523 (2005)","DOI":"10.1145\/1060590.1060669"},{"key":"27_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/3-540-45353-9_29","volume-title":"Topics in Cryptology - CT-RSA 2001","author":"Y. Watanabe","year":"2001","unstructured":"Watanabe, Y., Hanaoka, G., Imai, H.: Efficient asymmetric public-key traitor tracing without trusted agents. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol.\u00a02020, pp. 392\u2013407. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44371-2_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T19:47:11Z","timestamp":1746301631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44371-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662443705","9783662443712"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44371-2_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}