{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T22:41:01Z","timestamp":1778798461743,"version":"3.51.4"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319705026","type":"print"},{"value":"9783319705033","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-70503-3_8","type":"book-chapter","created":{"date-parts":[[2017,11,4]],"date-time":"2017-11-04T02:43:27Z","timestamp":1509763407000},"page":"245-279","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Blockwise p-Tampering Attacks on Cryptographic Primitives, Extractors, and Learners"],"prefix":"10.1007","author":[{"given":"Saeed","family":"Mahloujifar","sequence":"first","affiliation":[]},{"given":"Mohammad","family":"Mahmoody","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,5]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-662-44371-2_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"P Austrin","year":"2014","unstructured":"Austrin, P., Chung, K.-M., Mahmoody, M., Pass, R., Seth, K.: On the impossibility of cryptography with tamperable randomness. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 462\u2013479. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_26"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Awasthi, P., Balcan, M.F., Long, P.M.: The power of localization for efficiently learning linear separators with noise. In: Proceedings of the 46th Annual ACM Symposium on Theory of Computing, pp. 449\u2013458. ACM (2014)","DOI":"10.1145\/2591796.2591839"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Azar, Y., Broder, A.Z., Karlin, A.R., Linial, N., Phillips, S.: Biased random walks. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, pp. 1\u20139. ACM (1992)","DOI":"10.1145\/129712.129713"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Barak, B., Halevi, S.: A model and architecture for pseudo-random generation with applications to\/dev\/random. In: Proceedings of the 12th ACM Conference on Computer and Communications Security, pp. 203\u2013212. ACM (2005)","DOI":"10.1145\/1102120.1102148"},{"issue":"2","key":"8_CR5","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10994-010-5188-5","volume":"81","author":"M Barreno","year":"2010","unstructured":"Barreno, M., Nelson, B., Joseph, A.D., Tygar, J.D.: The security of machine learning. Mach. Learn. 81(2), 121\u2013148 (2010)","journal-title":"Mach. Learn."},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/15M1027206","volume":"46","author":"S Beigi","year":"2017","unstructured":"Beigi, S., Etesami, O., Gohari, A.: Deterministic randomness extraction from generalized and distributed santha-vazirani sources. SIAM J. Comput. 46(1), 1\u201336 (2017)","journal-title":"SIAM J. Comput."},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-662-44371-2_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"M Bellare","year":"2014","unstructured":"Bellare, M., Paterson, K.G., Rogaway, P.: Security of symmetric encryption against mass surveillance. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 1\u201319. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_1"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Berman, I., Haitner, I., Tentes, A.: Coin flipping of any constant bias implies one-way functions. In: Proceedings of the 46th Annual ACM Symposium on Theory of Computing, pp. 398\u2013407. ACM (2014)","DOI":"10.1145\/2591796.2591845"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-69053-0_4","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1997","author":"D Boneh","year":"1997","unstructured":"Boneh, D., DeMillo, R.A., Lipton, R.J.: On the importance of checking cryptographic protocols for faults. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 37\u201351. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_4"},{"issue":"2","key":"8_CR10","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0304-3975(01)00403-0","volume":"288","author":"NH Bshouty","year":"2002","unstructured":"Bshouty, N.H., Eiron, N., Kushilevitz, E.: PAC learning with nasty noise. Theor. Comput. Sci. 288(2), 255\u2013275 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR11","unstructured":"Chandran, N., Goyal, V., Mukherjee, P., Pandey, O., Upadhyay, J.: Block-wise non-malleable codes. In: LIPIcs-Leibniz International Proceedings in Informatics, vol. 55. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2016)"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldreich, O.: Unbiased bits from sources of weak randomness and probabilistic communication complexity. In: Proceedings of 26th FOCS, pp. 429\u2013442. IEEE (1985)","DOI":"10.1109\/SFCS.1985.62"},{"issue":"2","key":"8_CR13","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1137\/0217015","volume":"17","author":"B Chor","year":"1988","unstructured":"Chor, B., Goldreich, O.: Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput. 17(2), 230\u2013261 (1988)","journal-title":"SIAM J. Comput."},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty. In: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pp. 364\u2013369. ACM (1986)","DOI":"10.1145\/12130.12168"},{"key":"8_CR15","first-page":"5","volume":"1","author":"R Cleve","year":"1993","unstructured":"Cleve, R., Impagliazzo, R.: Martingales, collective coin flipping and discrete control processes. In other words 1, 5 (1993)","journal-title":"In other words"},{"key":"8_CR16","unstructured":"Corrigan-Gibbs, H., Jana, S.: Recommendations for randomness in the operating system, or how to keep evil children out of your pool and other random facts. In: HotOS (2015)"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-642-19571-6_27","volume-title":"Theory of Cryptography","author":"D Dachman-Soled","year":"2011","unstructured":"Dachman-Soled, D., Lindell, Y., Mahmoody, M., Malkin, T.: On the black-box complexity of optimally-fair coin tossing. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 450\u2013467. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_27"},{"key":"8_CR18","unstructured":"Damg\u00e5rd, I., Faust, S., Mukherjee, P., Venturi, D.: Tamper resilient cryptography without self-destruct. Cryptology ePrint Archive, Report 2013\/124 (2013). http:\/\/eprint.iacr.org\/2013\/124"},{"key":"8_CR19","unstructured":"Dodis, Y., Ong, S.J., Prabhakaran, M., Sahai, A.: On the (im)possibility of cryptography with imperfect randomness. In: FOCS: IEEE Symposium on Foundations of Computer Science (FOCS) (2004)"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/3-540-48224-5_25","volume-title":"Automata, Languages and Programming","author":"Y Dodis","year":"2001","unstructured":"Dodis, Y.: New imperfect random source with applications to coin-flipping. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 297\u2013309. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-48224-5_25"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Pointcheval, D., Ruhault, S., Vergniaud, D., Wichs, D.: Security analysis of pseudo-random number generators with input:\/dev\/random is not robust. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security, pp. 647\u2013658. ACM (2013)","DOI":"10.1145\/2508859.2516653"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-662-48000-7_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"Y Dodis","year":"2015","unstructured":"Dodis, Y., Yao, Y.: Privacy with imperfect randomness. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 463\u2013482. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_23"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Dwork, C., Rothblum, G.N., Vadhan, S.: Boosting and differential privacy. In: 2010 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 51\u201360. IEEE (2010)","DOI":"10.1109\/FOCS.2010.12"},{"key":"8_CR24","first-page":"142","volume-title":"23rd Conference on Computer and Communications Security, ACM CCS 2016","author":"S Dziembowski","year":"2016","unstructured":"Dziembowski, S., Faust, S., Standaert, F.-X.: Private circuits III: hardware Trojan-resilience via testing amplification. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) 23rd Conference on Computer and Communications Security, ACM CCS 2016, pp. 142\u2013153. ACM Press, Vienna (2016)"},{"key":"8_CR25","unstructured":"Dziembowski, S., Pietrzak, K., Wichs, D.: Non-malleable codes. In: Yao, A.C.-C. (ed.) ICS, pp. 434\u2013452. Tsinghua University Press (2010)"},{"key":"8_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-540-24638-1_15","volume-title":"Theory of Cryptography","author":"R Gennaro","year":"2004","unstructured":"Gennaro, R., Lysyanskaya, A., Malkin, T., Micali, S., Rabin, T.: Algorithmic tamper-proof (ATP) security: theoretical foundations for security against hardware tampering. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 258\u2013277. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_15"},{"key":"8_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/978-3-662-47666-6_53","volume-title":"Automata, Languages, and Programming","author":"S Goldwasser","year":"2015","unstructured":"Goldwasser, S., Kalai, Y.T., Park, S.: Adaptively secure coin-flipping, revisited. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 663\u2013674. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47666-6_53"},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"Gutterman, Z., Pinkas, B., Reinman, T.: Analysis of the Linux random number generator. In: 2006 IEEE Symposium on Security and Privacy, p. 15. IEEE (2006)","DOI":"10.1109\/SP.2006.5"},{"issue":"2","key":"8_CR29","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1137\/120887631","volume":"43","author":"I Haitner","year":"2014","unstructured":"Haitner, I., Omri, E.: Coin flipping with constant bias implies one-way functions. SIAM J. Comput. 43(2), 389\u2013409 (2014)","journal-title":"SIAM J. Comput."},{"key":"8_CR30","unstructured":"Heninger, N., Durumeric, Z., Wustrow, E., Halderman, J.A.: Mining your Ps and Qs: detection of widespread weak keys in network devices. In: USENIX Security Symposium, vol. 8 (2012)"},{"issue":"4","key":"8_CR31","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1137\/0222052","volume":"22","author":"M Kearns","year":"1993","unstructured":"Kearns, M., Li, M.: Learning in the presence of malicious errors. SIAM J. Comput. 22(4), 807\u2013837 (1993)","journal-title":"SIAM J. Comput."},{"key":"8_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-642-42045-0_9","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"A Kiayias","year":"2013","unstructured":"Kiayias, A., Tselekounis, Y.: Tamper resilient circuits: the adversary at the gates. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. LNCS, vol. 8270, pp. 161\u2013180. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42045-0_9"},{"issue":"3","key":"8_CR33","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF02125896","volume":"9","author":"D Lichtenstein","year":"1989","unstructured":"Lichtenstein, D., Linial, N., Saks, M.: Some extremal problems arising from discrete control processes. Combinatorica 9(3), 269\u2013287 (1989)","journal-title":"Combinatorica"},{"key":"8_CR34","doi-asserted-by":"crossref","unstructured":"Maji, H.K., Prabhakaran, M., Sahai, A.: On the computational complexity of coin flipping. In: 2010 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 613\u2013622. IEEE (2010)","DOI":"10.1109\/FOCS.2010.64"},{"key":"8_CR35","unstructured":"Papernot, N., McDaniel, P., Sinha, A., Wellman, M.: Towards the science of security and privacy in machine learning. arXiv preprint arXiv:1611.03814 (2016)"},{"key":"8_CR36","unstructured":"Reingold, O., Vadhan, S., Wigderson, A.: A note on extracting randomness from santha-vazirani sources. Unpublished manuscript (2004)"},{"key":"8_CR37","doi-asserted-by":"crossref","unstructured":"Rubinstein, B.I.P., Nelson, B., Huang, L., Joseph, A.D., Lau, S.-H., Rao, S., Taft, N., Tygar, J.D.: Antidote: understanding and defending against poisoning of anomaly detectors. In: Proceedings of the 9th ACM SIGCOMM Conference on Internet Measurement Conference, pp. 1\u201314. ACM (2009)","DOI":"10.1145\/1644893.1644895"},{"issue":"2","key":"8_CR38","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/1639562.1639592","volume":"37","author":"BIP Rubinstein","year":"2009","unstructured":"Rubinstein, B.I.P., Nelson, B., Huang, L., Joseph, A.D., Lau, S.-H., Rao, S., Taft, N., Tygar, J.D.: Stealthy poisoning attacks on PCA-based anomaly detectors. ACM SIGMETRICS Perform. Eval. Rev. 37(2), 73\u201374 (2009)","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"issue":"1","key":"8_CR39","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0022-0000(86)90044-9","volume":"33","author":"M Santha","year":"1986","unstructured":"Santha, M., Vazirani, U.V.: Generating quasi-random sequences from semi-random sources. J. Comput. Syst. Sci. 33(1), 75\u201387 (1986)","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR40","doi-asserted-by":"crossref","unstructured":"Shen, S., Tople, S., Saxena, P.: A uror: defending against poisoning attacks in collaborative deep learning systems. In: Proceedings of the 32nd Annual Conference on Computer Security Applications, pp. 508\u2013519. ACM (2016)","DOI":"10.1145\/2991079.2991125"},{"issue":"11","key":"8_CR41","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"LG Valiant","year":"1984","unstructured":"Valiant, L.G.: A theory of the learnable. Commun. ACM 27(11), 1134\u20131142 (1984)","journal-title":"Commun. ACM"},{"key":"8_CR42","unstructured":"Valiant, L.G.: Learning disjunction of conjunctions. In: IJCAI, pp. 560\u2013566 (1985)"},{"key":"8_CR43","first-page":"36","volume":"12","author":"J Von Neumann","year":"1951","unstructured":"Von Neumann, J.: 13. various techniques used in connection with random digits. Appl. Math Ser 12, 36\u201338 (1951)","journal-title":"Appl. Math Ser"},{"key":"8_CR44","unstructured":"Xiao, H., Biggio, B., Brown, G., Fumera, G., Eckert, C., Roli, F.: Is feature selection secure against training data poisoning? In: ICML, pp. 1689\u20131698 (2015)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-70503-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T21:25:38Z","timestamp":1750973138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-70503-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319705026","9783319705033"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-70503-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"5 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Baltimore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 November 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iacr.org\/workshops\/tcc2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}