{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:20:58Z","timestamp":1725585658389},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642215988"},{"type":"electronic","value":"9783642215995"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21599-5_4","type":"book-chapter","created":{"date-parts":[[2011,6,14]],"date-time":"2011-06-14T20:31:47Z","timestamp":1308083507000},"page":"48-62","source":"Crossref","is-referenced-by-count":2,"title":["Coalition Resistant Anonymous Broadcast Encryption Scheme Based on PUF"],"prefix":"10.1007","author":[{"given":"\u0141ukasz","family":"Krzywiecki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miros\u0142aw","family":"Kuty\u0142owski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Pappu, R.S., Recht, B., Taylor, J., Gershenfeld, N.: Physical one-way functions. Science\u00a0297, 2026\u20132030 (2002), http:\/\/web.media.mit.edu\/~brecht\/papers\/02.PapEA.powf.pdf (cited on page 49)","DOI":"10.1126\/science.1074376"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Gassend, B., Clarke, D.E., van Dijk, M., Devadas, S.: Silicon physical random functions. In: Atluri, V. (ed.) ACM Conference on Computer and Communications Security, pp. 148\u2013160. ACM, New York (2002) (cited on page 49)","DOI":"10.1145\/586110.586132"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-540-74735-2_5","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2007","author":"J. Guajardo","year":"2007","unstructured":"Guajardo, J., Kumar, S.S., Schrijen, G.J., Tuyls, P.: Fpga intrinsic pufs and their use for ip protection. In: Paillier, P., Verbauwhede, I. (eds.) CHES 2007. LNCS, vol.\u00a04727, pp. 63\u201380. Springer, Heidelberg (2007) (cited on page 49)"},{"key":"4_CR4","unstructured":"Gassend, B.: Physical Random Functions. Master\u2019s thesis. MIT, USA (2003) (cited on page 49)"},{"key":"4_CR5","unstructured":"Pappu, R.S.: Physical one-way functions. PhD thesis, Massachusetts Institute of Technology (2001), http:\/\/pubs.media.mit.edu\/pubs\/papers\/01.03.pappuphd.powf.pdf (cited on page 49)"},{"key":"4_CR6","first-page":"237","volume-title":"ACM Conference on Computer and Communications Security","author":"U. R\u00fchrmair","year":"2010","unstructured":"R\u00fchrmair, U., Sehnke, F., S\u00f6lter, J., Dror, G., Devadas, S., Schmidhuber, J.: Modeling attacks on physical unclonable functions. In: Al-Shaer, E., Keromytis, A.D., Shmatikov, V. (eds.) ACM Conference on Computer and Communications Security, pp. 237\u2013249. ACM, New York (2010) (cited on page 49)"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Tuyls, P., \u0160kori\u0107, B.: Strong authentication with physical unclonable functions. In: Security, Privacy, and Trust in Modern Data Management, pp. 133\u2013148 (2007) (cited on page 49)","DOI":"10.1007\/978-3-540-69861-6_10"},{"key":"4_CR8","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) (cited on page 50)"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-44586-2_16","volume-title":"Public Key Cryptography","author":"W.-G. Tzeng","year":"2001","unstructured":"Tzeng, W.-G., Tzeng, Z.-J.: A public-key traitor tracing scheme with revocation using dynamic shares. In: Kim, K. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 207\u2013224. Springer, Heidelberg (2001) (cited on page 50)"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Fazio, N., Kiayias, A., Yung, M.: Scalable public-key tracing and revoking. In: PODC, pp. 190\u2013199 (2003) (cited on page 50)","DOI":"10.1145\/872035.872062"},{"key":"4_CR11","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 trace and revoke scheme secure against adaptive chosen ciphertext attack. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 100\u2013115. Springer, Heidelberg (2002) (cited on page 50)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-540-31815-6_22","volume-title":"Information Security Applications","author":"C.H. Kim","year":"2005","unstructured":"Kim, C.H., Hwang, Y.-H., Lee, P.J.: Practical pay-TV scheme using traitor tracing scheme for multiple channels. In: Lim, C.H., Yung, M. (eds.) WISA 2004. LNCS, vol.\u00a03325, pp. 264\u2013277. Springer, Heidelberg (2005) (cited on page 50)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/11801412_9","volume-title":"Secure Mobile Ad-hoc Networks and Sensors","author":"J. Cicho\u0144","year":"2006","unstructured":"Cicho\u0144, J., Krzywiecki, \u0141., Kuty\u0142owski, M., Wla\u017a, P.: Anonymous distribution of encryption keys in cellular broadcast systems. In: Burmester, M., Yasinsac, A. (eds.) MADNES 2005. LNCS, vol.\u00a04074, pp. 96\u2013109. Springer, Heidelberg (2006) (cited on page 50)"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/11937807_11","volume-title":"Information Security and Cryptology","author":"\u0141. Krzywiecki","year":"2006","unstructured":"Krzywiecki, \u0141., Kubiak, P., Kuty\u0142owski, M.: A revocation scheme preserving privacy. In: Lipmaa, H., Yung, M., Lin, D. (eds.) Inscrypt 2006. LNCS, vol.\u00a04318, pp. 130\u2013143. Springer, Heidelberg (2006) (cited on page 50)"},{"key":"4_CR15","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) (cited on page 50)"},{"issue":"1","key":"4_CR16","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/S0097539795288490","volume":"29","author":"Y. Azar","year":"1999","unstructured":"Azar, Y., Broder, A.Z., Karlin, A.R., Upfal, E.: Balanced allocations. SIAM J. Comput.\u00a029(1), 180\u2013200 (1999) (cited on pages 57 and 58)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"4_CR17","doi-asserted-by":"publisher","first-page":"1350","DOI":"10.1137\/S009753970444435X","volume":"35","author":"P. Berenbrink","year":"2006","unstructured":"Berenbrink, P., Czumaj, A., Steger, A., V\u00f6cking, B.: Balanced allocations: The heavily loaded case. SIAM J. Comput.\u00a035(6), 1350\u20131385 (2006) (cited on page 57)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"4_CR18","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1145\/792538.792546","volume":"50","author":"B. V\u00f6cking","year":"2003","unstructured":"V\u00f6cking, B.: How asymmetry helps load balancing. J. ACM\u00a050(4), 568\u2013589 (2003) (cited on page 58)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Trust and Trustworthy Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21599-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T14:50:12Z","timestamp":1560264612000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21599-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642215988","9783642215995"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21599-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}