{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:40:54Z","timestamp":1742992854800,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319167145"},{"type":"electronic","value":"9783319167152"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-16715-2_25","type":"book-chapter","created":{"date-parts":[[2015,3,10]],"date-time":"2015-03-10T07:27:37Z","timestamp":1425972457000},"page":"469-486","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Communication Optimal Tardos-Based Asymmetric Fingerprinting"],"prefix":"10.1007","author":[{"given":"Aggelos","family":"Kiayias","sequence":"first","affiliation":[]},{"given":"Nikos","family":"Leonardos","sequence":"additional","affiliation":[]},{"given":"Helger","family":"Lipmaa","sequence":"additional","affiliation":[]},{"given":"Kateryna","family":"Pavlyk","sequence":"additional","affiliation":[]},{"given":"Qiang","family":"Tang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,3,11]]},"reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-540-24632-9_31","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"A Ambainis","year":"2004","unstructured":"Ambainis, A., Jakobsson, M., Lipmaa, H.: Cryptographic Randomized Response Techniques. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 425\u2013438. Springer, Heidelberg (2004)"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Amiri, E., Tardos, G.: High Rate Fingerprinting Codes And the Fingerprinting Capacity. In: Mathieu, C. (ed.) SODA 2009, pp. 336\u2013345. SIAM, New York, January 4\u20136 (2009)","DOI":"10.1137\/1.9781611973068.38"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-540-30539-2_36","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"IF Blake","year":"2004","unstructured":"Blake, I.F., Kolesnikov, V.: Strong Conditional Oblivious Transfer and Computing on Intervals. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol. 3329, pp. 515\u2013529. Springer, Heidelberg (2004)"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1007\/3-540-44750-4_36","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"D Boneh","year":"1995","unstructured":"Boneh, D., Shaw, J.: Collusion-Secure Fingerprinting for Digital Data. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 452\u2013465. Springer, Heidelberg (1995)"},{"issue":"1","key":"25_CR5","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 multiparty cryptographic protocols. J. Cryptology 13(1), 143\u2013202 (2000)","journal-title":"J. Cryptology"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Charpentier, A., Fontaine, C., Furon, T., Cox, I.: An asymmetric fingerprinting scheme based on tardos codes. In: Proceedings of the 13th International Conference on Information Hiding, IH 2011, pp. 43\u201358 (2011)","DOI":"10.1007\/978-3-642-24178-9_4"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Cleve, R., Limits on the security of coin flips when half the processors are faulty (extended abstract). In: STOC, pp. 364\u2013369 (1986)","DOI":"10.1145\/12130.12168"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-28914-9_4","volume-title":"Theory of Cryptography","author":"I Damg\u00e5rd","year":"2012","unstructured":"Damg\u00e5rd, I., Faust, S., Hazay, C.: Secure Two-Party Computation with Low Communication. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 54\u201374. Springer, Heidelberg (2012)"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Jurik, M.: A generalisation, a simplification and some applications of paillier\u2019s probabilistic public-key system. In: Public Key Cryptography, pp. 119\u2013136 (2001)","DOI":"10.1007\/3-540-44586-2_9"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/978-3-642-36594-2_35","volume-title":"Theory of Cryptography","author":"I Damg\u00e5rd","year":"2013","unstructured":"Damg\u00e5rd, I., Zakarias, S.: Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 621\u2013641. Springer, Heidelberg (2013)"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/3-540-44598-6_7","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"Y Dodis","year":"2000","unstructured":"Dodis, Y., Halevi, S., Rabin, T.: A Cryptographic Solution to a Game Theoretic Problem. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 112\u2013130. Springer, Heidelberg (2000)"},{"key":"25_CR12","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. 2020, pp. 457\u2013472. Springer, Heidelberg (2001)"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: The Foundations of Cryptography, vol. 2, Basic Applications. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1007\/978-3-642-36594-2_34","volume-title":"Theory of Cryptography","author":"Y Ishai","year":"2013","unstructured":"Ishai, Y., Kushilevitz, E., Meldgaard, S., Orlandi, C., Paskin-Cherniavsky, A.: On the Power of Correlated Randomness in Secure Computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 600\u2013620. Springer, Heidelberg (2013)"},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/978-3-540-70936-7_31","volume-title":"Theory of Cryptography","author":"Y Ishai","year":"2007","unstructured":"Ishai, Y., Paskin, A.: Evaluating Branching Programs on Encrypted Data. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 575\u2013594. Springer, Heidelberg (2007)"},{"key":"25_CR16","unstructured":"Kiayias, A., Leonardos, N., Lipmaa, H., Pavlyk, K., Tang, Q.: Near Optimal Rate Homomorphic Encryption for Branching Programs. Technical Report 2014 (2014). http:\/\/eprint.iacr.org\/2014\/851"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Pehlivanoglu, S.: Encryption for Digital Content, vol. 52. Advances in Information Security. Springer, US (October 2010)","DOI":"10.1007\/978-1-4419-0044-9"},{"key":"25_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-540-72738-5_14","volume-title":"Applied Cryptography and Network Security","author":"S Laur","year":"2007","unstructured":"Laur, S., Lipmaa, H.: A New Protocol for Conditional Disclosure of Secrets and Its Applications. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol. 4521, pp. 207\u2013225. Springer, Heidelberg (2007)"},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-642-14423-3_14","volume-title":"Information, Security and Cryptology \u2013 ICISC 2009","author":"H Lipmaa","year":"2010","unstructured":"Lipmaa, H.: First CPIR Protocol with Data-Dependent Computation. In: Lee, D., Hong, S. (eds.) ICISC 2009. LNCS, vol. 5984, pp. 193\u2013210. Springer, Heidelberg (2010)"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Naor, M., Nissim, K.: Communication preserving protocols for secure function evaluation. In: STOC, pp. 590\u2013599 (2001)","DOI":"10.1145\/380752.380855"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"Pfitzmann, B.: Trials of traced traitors. In: Information Hiding, pp. 49\u201364 (1996)","DOI":"10.1007\/3-540-61996-8_31"},{"key":"25_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/3-540-68339-9_8","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"B Pfitzmann","year":"1996","unstructured":"Pfitzmann, B., Schunter, M.: Asymmetric Fingerprinting. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 84\u201395. Springer, Heidelberg (1996)"},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Pfitzmann, B., Waidner, M.: Asymmetric fingerprinting for larger collusions. In: ACM Conference on Computer and Communications Security, pp. 151\u2013160 (1997)","DOI":"10.1145\/266420.266453"},{"issue":"1","key":"25_CR24","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1109\/TIFS.2010.2095844","volume":"6","author":"A Rial","year":"2011","unstructured":"Rial, A., Balasch, J., Preneel, B.: A privacy-preserving buyer-seller watermarking protocol based on priced oblivious transfer. IEEE Transactions on Information Forensics and Security 6(1), 202\u2013212 (2011)","journal-title":"IEEE Transactions on Information Forensics and Security"},{"issue":"4","key":"25_CR25","doi-asserted-by":"publisher","first-page":"920","DOI":"10.1109\/TIFS.2010.2072830","volume":"5","author":"A Rial","year":"2010","unstructured":"Rial, A., Deng, M., Bianchi, T., Piva, A., Preneel, B.: A provably secure anonymous buyer-seller watermarking protocol. IEEE Transactions on Information Forensics and Security 5(4), 920\u2013931 (2010)","journal-title":"IEEE Transactions on Information Forensics and Security"},{"key":"25_CR26","doi-asserted-by":"crossref","unstructured":"Tardos, G.: Optimal probabilistic fingerprint codes. J. ACM 55(2) (2008)","DOI":"10.1145\/1346330.1346335"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013- CT-RSA 2015"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-16715-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T10:33:02Z","timestamp":1674556382000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-16715-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319167145","9783319167152"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-16715-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"11 March 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}