{"id":29,"date":"2012-12-11T16:41:28","date_gmt":"2012-12-11T14:41:28","guid":{"rendered":"http:\/\/www.eng.biu.ac.il\/harelca\/?page_id=29"},"modified":"2024-12-24T11:58:34","modified_gmt":"2024-12-24T09:58:34","slug":"publications","status":"publish","type":"page","link":"https:\/\/www.eng.biu.ac.il\/hazay\/publications\/","title":{"rendered":"Publications"},"content":{"rendered":"<ol>\n<li><strong>Useful links:<\/strong><\/li>\n<\/ol>\n<p><a href=\"http:\/\/www.eng.biu.ac.il\/hazay\/files\/2020\/08\/scholar.png\" class=\"thickbox no_icon\"><img loading=\"lazy\" decoding=\"async\" class=\"alignnone  wp-image-350\" src=\"http:\/\/www.eng.biu.ac.il\/hazay\/files\/2020\/08\/scholar.png\" alt=\"\" width=\"27\" height=\"27\" \/><\/a><a href=\"https:\/\/scholar.google.com\/citations?user=vYF6cS0AAAAJ&amp;hl=en&amp;oi=ao\"> Google Scholar<\/a><\/p>\n<p><a href=\"http:\/\/www.eng.biu.ac.il\/hazay\/files\/2020\/08\/dblp.png\" class=\"thickbox no_icon\"><img loading=\"lazy\" decoding=\"async\" class=\"alignnone  wp-image-347\" src=\"http:\/\/www.eng.biu.ac.il\/hazay\/files\/2020\/08\/dblp.png\" alt=\"\" width=\"25\" height=\"25\" \/><\/a><a href=\"https:\/\/dblp.org\/pid\/95\/1548.html\">DBLP<\/a><\/p>\n<p><a href=\"http:\/\/www.eng.biu.ac.il\/hazay\/files\/2020\/08\/orcid_16x16.png\" class=\"thickbox no_icon\"><img loading=\"lazy\" decoding=\"async\" class=\"alignnone size-full wp-image-345\" src=\"http:\/\/www.eng.biu.ac.il\/hazay\/files\/2020\/08\/orcid_16x16.png\" alt=\"\" width=\"16\" height=\"16\" \/><\/a><a href=\"https:\/\/orcid.org\/0000-0002-8951-5099\">\u00a0ORCID<\/a><\/p>\n<p><strong>Books: <a href=\"http:\/\/www.eng.biu.ac.il\/hazay\/files\/2020\/08\/book2.png\" class=\"thickbox no_icon\"><img loading=\"lazy\" decoding=\"async\" class=\"wp-image-331 alignright\" src=\"http:\/\/www.eng.biu.ac.il\/hazay\/files\/2020\/08\/book2-300x298.png\" alt=\"\" width=\"137\" height=\"136\" \/><\/a><br \/>\n<\/strong><\/p>\n<ul>\n<li>Carmit Hazay and Yehuda Lindell. Efficient Secure Two-Party Protocols -- Techniques and Constructions. Springer-Verlag, 2010. <a href=\"http:\/\/www.eng.biu.ac.il\/~hazay\/Book\/IntroductionEfficient2PC.pdf\"> The preface, table of contents and introduction are available for perusal.<\/a><br \/>\nMore details on the book can be found <a href=\"http:\/\/u.cs.biu.ac.il\/~lindell\/efficient-protocols.html\"> here<\/a>, and a review of the book that appeared in SIGACT NEWS can be found <a href=\"http:\/\/u.cs.biu.ac.il\/~lindell\/HLreview.pdf\"> here. <\/a><\/li>\n<\/ul>\n<p><strong>Journal Publications:<\/strong><\/p>\n<ol>\n<li>C. Hazay, M. Venkitasubramaniam and M. Weiss. <a href=\"https:\/\/eprint.iacr.org\/2022\/497.pdf\">Protecting Distributed Primitives against Leakage: Equivocal Secret Sharing and More.\u00a0<\/a>J. Cryptol. 38(1): 1(2025).<\/li>\n<li>C. Hazay, M. Venkitasubramaniam and M Weiss. <a href=\"https:\/\/eprint.iacr.org\/2019\/1250.pdf\">The Price of Active Security in Cryptographic Protocols.\u00a0<\/a>J. Cryptol. 37(3): 30(2024).<\/li>\n<li>S. Ames, C. Hazay, Y. Ishai and M. Venkitasubramaniam. <a href=\"https:\/\/eprint.iacr.org\/2022\/1608.pdf\">Ligero: lightweight sublinear arguments without a trusted setup.<\/a> Des. Codes Cryptogr. 91(11): 3379-3424 (2023).<\/li>\n<li>C. Hazay, Y. Ishai and M. Venkitasubramaniam. <a href=\"https:\/\/eprint.iacr.org\/2017\/947.pdf\">Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model.<\/a> J. Cryptol. 36(3): 26 (2023).<\/li>\n<li><span dir=\"ltr\" role=\"presentation\">I. Levi and C. Hazay. <a href=\"https:\/\/eprint.iacr.org\/2022\/901.pdf\">Garbled circuits from an SCA perspective free XOR can be quite expensive. <\/a><\/span><span dir=\"ltr\" role=\"presentation\">IACR Trans. Cryptogr. Hardw. Embed. Syst.<\/span><span dir=\"ltr\" role=\"presentation\">,<\/span> <span dir=\"ltr\" role=\"presentation\">2023<\/span><span dir=\"ltr\" role=\"presentation\">(2), 54\u201379.<\/span><\/li>\n<li><span dir=\"ltr\" role=\"presentation\">D. Gordon, C. Hazay and Le, P. H. <a href=\"https:\/\/petsymposium.org\/popets\/2022\/popets-2022-0073.pdf\">Fully secure PSI via MPC-in-the-head.<\/a><\/span> <span dir=\"ltr\" role=\"presentation\">Proc. Priv. Enhancing <\/span><span dir=\"ltr\" role=\"presentation\">Technol<\/span><span dir=\"ltr\" role=\"presentation\">,<\/span> <span dir=\"ltr\" role=\"presentation\">2022<\/span><span dir=\"ltr\" role=\"presentation\">(3), 291\u2013313 (2022).<\/span><\/li>\n<li>C. Hazay and M. Lilintal. <a href=\"https:\/\/content.iospress.com\/articles\/journal-of-computer-security\/jcs200107\">Gradual GRAM and Secure Computation for RAM Programs.<\/a> In the Journal of Computer Security, <span dir=\"ltr\" role=\"presentation\">30<\/span><span dir=\"ltr\" role=\"presentation\">(1), 197\u2013229 (2022).<\/span><\/li>\n<li>C. Hazay, E. Orsini, P. Scholl and E. Soria-Vazquez. <a href=\"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-022-09423-5.pdf\">TinyKeys: A New Approach to Efficient Multi-Party Computation.<\/a> In the Journal of Cryptology, 35(2): 13 (2022).<\/li>\n<li>C. Hazay, M. Venkitasubramaniam and M. Weiss.<a href=\"https:\/\/link.springer.com\/article\/10.1007\/s00145-022-09433-3\"> ZK-PCPs from Leakage-Resilient Secret Sharing.<\/a> In the Journal of Cryptology, 34(3): 23 (2021).<\/li>\n<li>S. Halevi, C. Hazay, A. Polychroniadou and M. Venkitasubramaniam. <a href=\"https:\/\/eprint.iacr.org\/2017\/1056.pdf\">Round-Optimal Secure Multi-Party Computation.<\/a> In the Journal of Cryptology, 35(4): 19 (2022).<\/li>\n<li>C. Hazay, P. Scholl and E. Soria-Vazquez. <a href=\"https:\/\/eprint.iacr.org\/2017\/214.pdf\">Low Cost Constant Round MPC Combining BMR and Oblivious Transfer.<\/a> In the Journal of Cryptology, 33(4): 1732--1786 (2020).<\/li>\n<li>C. Hazay and M. Venkitasubramaniam. <a href=\"https:\/\/eprint.iacr.org\/2016\/074.pdf\"> On the Power of Secure Two-Party Computation. <\/a> In the Journal of Cryptology, 33(1): 271-318 (2020).<\/li>\n<li>C. Hazay and M. Venkitasubramaniam. <a href=\"https:\/\/eprint.iacr.org\/2015\/797.pdf\">What Security Can We Achieve within 4 Rounds?<\/a> In the Journal of Cryptology, 32(4): 1200-1262 (2019).<\/li>\n<li>C. Hazay and A. Yanay. <a href=\"http:\/\/eprint.iacr.org\/2016\/805.pdf\">Constant-Round Maliciously Secure Two-Party Computation in the RAM Model.<\/a> In the Journal of Cryptology, 32(4): 1144-1199 (2019).<\/li>\n<li>C. Hazay and M. Venkitasubramaniam. <a href=\"http:\/\/eprint.iacr.org\/2015\/488.pdf\">On Black-Box Complexity of Universally Composable Security in the CRS model.<\/a> In the Journal of Cryptology, 32(3): 635-689 (2019).<\/li>\n<li>C. Hazay, G. L. Mikkelsen, T. Rabin, T. Toft and A. A. Nicolosi. <a href=\"https:\/\/eprint.iacr.org\/2011\/494.pdf\"> Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting. <\/a> In the Journal of Cryptology, 32(2): 265--323 (2019).<\/li>\n<li>C. Hazay. <a href=\"http:\/\/eprint.iacr.org\/2015\/004.pdf\"> Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs.<\/a> In the Journal of Cryptology, 31(2): 537-586 (2018).<\/li>\n<li>S. Faust, C. Hazay and D. Venturi. <a href=\"https:\/\/eprint.iacr.org\/2014\/662.pdf\">Outsourced Pattern Matching.<\/a> In the International Journal of Information Security, 17(3): 327-346 (2018).<\/li>\n<li>C. Hazay and A. Patra. <a href=\"http:\/\/eprint.iacr.org\/2013\/593.pdf\"> One-Sided Adaptively Secure Two-Party Computation.<\/a> In the Journal of Cryptology, 30(1): 321-371 (2017).<\/li>\n<li>G. Asharov, R. Canetti and C. Hazay. <a href=\"http:\/\/www.eng.biu.ac.il\/~hazay\/Journals\/GameTheory.pdf\"> Towards a Game Theoretic View of Secure Computation.<\/a> In the Journal of Cryptology, 29(4): 879-926 (2016).<\/li>\n<li>S. Faust, C. Hazay, J. B. Nielsen, P. S. Nordholt and A. Zottarel. <a href=\"http:\/\/www.eng.biu.ac.il\/~hazay\/Journals\/LeakResSig.pdf\"> Signature Schemes Secure against Hard-to-Invert Leakage.<\/a> In the Journal of Cryptology, 29(2): 422-455 (2016).<\/li>\n<li>C. Hazay, A. Lopez-Alt, H. Wee and D. Wichs. <a href=\"http:\/\/www.eng.biu.ac.il\/~hazay\/Journals\/leakpke.pdf\"> Leakage-Resilient Cryptography from Minimal Assumptions.<\/a> In the Journal of Cryptology, 29(3): 514-551 (2016).<\/li>\n<li>M. J. Freedman, C. Hazay, K. Nissim and B. Pinkas.\u00a0 <a href=\"http:\/\/www.eng.biu.ac.il\/~hazay\/Journals\/FHNP-journal.pdf\"> Efficient Set Intersection with Simulation-Based Security.<\/a> In the Journal of Cryptology, 29(1): 115-155 (2016).<\/li>\n<li>R. Cole, C. Hazay, M. Lewenstein and D. Tsur. <a href=\"http:\/\/www.eng.biu.ac.il\/~hazay\/Journals\/param-2d.pdf\"> Two Dimensional Parameterized Matching.<\/a> In ACM Transactions on Algorithms, 11(2): 12:1-12:30 (2014).<\/li>\n<li>R. Gennaro, C. Hazay and J. Sorensen. <a href=\"http:\/\/www.eng.biu.ac.il\/~hazay\/Journals\/textSearch.pdf\"> Automata Evaluation and Text Search Protocols with Simulation Based Security.<\/a> In the Journal of Cryptology, 29(2): 243-282 (2016).<\/li>\n<li>C. Hazay and T. Toft. <a href=\"http:\/\/www.eng.biu.ac.il\/~hazay\/Journals\/pattern.pdf\"> Computationally Secure Pattern Matching in the Presence of Malicious Adversaries.<\/a> In the Journal of Cryptology, 27(2): 358-395 (2014).<\/li>\n<li>D. Klinc, C. Hazay, A. Jagmohan, H. Krawczyk and T. Rabin. <a href=\"http:\/\/www.eng.biu.ac.il\/~hazay\/Journals\/compressingAES.pdf\">On Compressing Data Encrypted with Block Ciphers.<\/a> In IEEE Transactions on Information Theory, 58(11): 6989-7001 (2012).<\/li>\n<li>D. Gordon, C. Hazay, J. Katz and Y. Lindell. <a href=\"http:\/\/www.eng.biu.ac.il\/~hazay\/Journals\/fair2party.pdf\">Complete Fairness in Secure Two-Party Computation.<\/a> In the Journal of ACM, 58(6): 24 (2011).<\/li>\n<li>C. Hazay and K. Nissim. <a href=\"http:\/\/www.eng.biu.ac.il\/~hazay\/Journals\/setIntersection.pdf\"> Efficient Set Operations in the Presence of Malicious Adversaries.<\/a> In the Journal of Cryptology, 25(3): 383-433 (2012).<\/li>\n<li>C. Hazay and Y. Lindell. <a href=\"http:\/\/www.eng.biu.ac.il\/~hazay\/Journals\/obprf.pdf\"> Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries.<\/a> In the Journal of Cryptology, 23(3): 422-456, 2010.<\/li>\n<li>C. Hazay, M. Lewenstein and D. Sokol. <a href=\"http:\/\/www.eng.biu.ac.il\/~hazay\/Journals\/apm.pdf\"> Approximate Parameterized Matching.<\/a> In ACM Transactions on Algorithms, 3(3): 15, 2007.<\/li>\n<\/ol>\n<p><strong>Conference Publications:<\/strong><\/p>\n<ol>\n<li><span dir=\"ltr\" role=\"presentation\">Y. Yang, D. Heath, C. Hazay, V. Kolesnikov and M. Venkitasubramaniam. <a href=\"https:\/\/eprint.iacr.org\/2024\/456.pdf\">Tight ZK CPU: Batched ZK Branching with Cost Proportional to Evaluated Instructions.<\/a> In the ACM Conference on Computer and Communications Security (ACM CCS), pages 3095-3109, 2023.<\/span><\/li>\n<li>T. Albouy, D. Frey, R. Gelles, C. Hazay, M. Reynal, E. Schiller, F. Taiani, and V. Zikas. Brief Announcement: Towards Optimal COmmunication Byznatine Reilable Broadcast Under a Message Adversary. In DISC, 41:1,41:7, 2024.<\/li>\n<li>F. Berti, C. Hazay, and I. Levi. <a href=\"https:\/\/eprint.iacr.org\/2024\/1143.pdf\">sfLR-sfOT: Leakage-Resilient Oblivious Transfer.<\/a> In SCN, Springer-Verlag (LNCS <span dir=\"ltr\" role=\"presentation\">14973<\/span>), pages 182-204, 2024.<\/li>\n<li><span dir=\"ltr\" role=\"presentation\">A. Acharya, C. Hazay, V. Kolesnikov, and M. Prabhakaran. <a href=\"https:\/\/eprint.iacr.org\/2024\/383.pdf\">Malicious Security for SCALES - Outsourced Computation with Ephemeral Servers.<\/a><\/span> In CRYPTO, Springer (LNCS 14928), pages 328-38, 2024.<\/li>\n<li>C. Hazay and Y. Yang. <a href=\"https:\/\/eprint.iacr.org\/2024\/283.pdf\">Toward Malicious Constant-Rate 2PC via Arithmetic Garbling.<\/a> In EUROCRYPT Springer-Verlag (LNCS <span dir=\"ltr\" role=\"presentation\">14655<\/span>), pages 401-431, 2024.<\/li>\n<li>R. Wang, C. Hazay and M. Venkitasubramaniam. Ligetron: Lightweight Scalable End-to-End Zero-Knowledge Proofs Post-Quantum ZK-SNARKs on a Browser. In IEEE Symposium on Security and Privacy (S&amp;P), pages 1760-1776, 2024.<\/li>\n<li>C. Hazay, M. Venkitasubramaniam and M. Weiss. <a href=\"https:\/\/eprint.iacr.org\/2022\/1523.pdf\">Your Reputation's Safe with Me: Framing-Free Distributed Zero-Knowledge Proofs.<\/a> In the Theory of Cryptography Conference (TCC), Springer (LNCS 14369 ), pages 34-64, 2023<\/li>\n<li>C. Hazay, M. Venkitasubramaniam and M. Weiss. <a href=\"https:\/\/eprint.iacr.org\/2023\/1819.pdf\">Beyond MPC-in-the-Head: Black-Box Constructions of Short Zero-Knowledge Proofs.<\/a> In the Theory of Cryptography Conference (TCC), Springer (LNCS 14369 ), pages 3-33, 2023.<\/li>\n<li>A. Acharya, C. Hazay, O. Poburinnaya and M. Venkitasubramaniam. <a href=\"https:\/\/eprint.iacr.org\/2023\/1013.pdf\">Best of Both Worlds - Revisiting the Spymasters Double Agent Problem.<\/a> In CRYPTO, Springer (LNCS 14081), pages 3-359, 2023.<\/li>\n<li>S. Faust, C. Hazay, D. Kretzler and B. Schlosser. <a href=\"https:\/\/eprint.iacr.org\/2023\/668.pdf\">Statement-Oblivious Threshold Witness Encryption.<\/a> In CSF , pages 17-32, 2023.<\/li>\n<li><span dir=\"ltr\" role=\"presentation\">A. Acharya, T. Ashur, E. Cohen, C. Hazay and A. Yanai. <a href=\"https:\/\/eprint.iacr.org\/2021\/739.pdf\">A New Framework for Garbled Circuits.<\/a> <\/span>In ACNS, Springer (LNCS 13906), pages 611-641, 2023.<\/li>\n<li>H. Sereshgi, L. Bangalore, C. Hazay and M. Venkitasubramaniam. Flag: A framework for lightweight robust secure aggregation. In ACM AsiaCCS, pages 14-28, 2023.<\/li>\n<li><span dir=\"ltr\" role=\"presentation\">R. Bhadauria, C. Hazay, M. Venkitasubramaniam, W. Wu, and Y. Zhang. <a href=\"https:\/\/eprint.iacr.org\/2023\/680.pdf\">Private Polynomial<\/a><\/span><span dir=\"ltr\" role=\"presentation\"> <a href=\"https:\/\/eprint.iacr.org\/2023\/680.pdf\">Commitments and Applications to MPC.<\/a> <\/span>In Public Key Cryptography (PKC) Springer (LNCS 13941), pages 127-158, 2023.<\/li>\n<li><span dir=\"ltr\" role=\"presentation\">S. Faust, C. Hazay, D. Kretzler and B. Schlosser. <a href=\"https:\/\/eprint.iacr.org\/2023\/052.pdf\">Putting the Online Phase on a Diet: Covert <\/a><\/span><span dir=\"ltr\" role=\"presentation\"><a href=\"https:\/\/eprint.iacr.org\/2023\/052.pdf\">Security from Short MACs.<\/a> In<\/span> <span dir=\"ltr\" role=\"presentation\">CT-RSA Springer-Verlag (LNCS 13871), pages 360-386, 2023<\/span><span dir=\"ltr\" role=\"presentation\">.<\/span><\/li>\n<li><span dir=\"ltr\" role=\"presentation\">Y. Yang, D. Heath, C. Hazay, V. Kolesnikov and M. Venkitasubramaniam. <a href=\"https:\/\/eprint.iacr.org\/2023\/1257.pdf\">Batchman and Robin: Batched and Non-batched Branching for Interactive ZK.<\/a> In the ACM Conference on Computer and Communications Security (ACM CCS), pages 1452-1466, 2023. <\/span><\/li>\n<li><span dir=\"ltr\" role=\"presentation\">A. Acharya, C. Hazay, V. Kolesnikov, and M. Prabhakaran. <\/span><a href=\"https:\/\/eprint.iacr.org\/2022\/751.pdf\">SCALES: MPC with Small Clients and Larger Ephemeral Servers.<\/a> In the Theory of Cryptography Conference (TCC), Springer-Verlag (LNCS 13748), pages 502-531, 2022.<\/li>\n<li><span dir=\"ltr\" role=\"presentation\">R. Bhadauria, L. Bangalore, C. Hazay and M. Venkitasubramaniam. <a href=\"https:\/\/eprint.iacr.org\/2022\/1612.pdf\">On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives.<\/a><\/span> In the Theory of Cryptography Conference (TCC), Springer-Verlag (LNCS 13747), pages 417-446, 2022.<\/li>\n<li><span dir=\"ltr\" role=\"presentation\">G. R. Chandran, C. Hazay, R. Hundt and T. Schneider. <a href=\"https:\/\/eprint.iacr.org\/2022\/574.pdf\">Comparison-based MPC in star topology. <\/a><\/span><span dir=\"ltr\" role=\"presentation\">In <\/span><span dir=\"ltr\" role=\"presentation\">SECRYPT, pages 69-82, 2022.<\/span><\/li>\n<li>C. Hazay, M. Venkitasubramaniam and M. Weiss. <a href=\"https:\/\/eprint.iacr.org\/2022\/497.pdf\">Protecting Distributed Primitives against Leakage: Equivocal Secret Sharing and More.<\/a> In ITC, pages 1-24(230), 2022.<\/li>\n<li>L. de Catro, C. Hazay, Y. Ishai, V. Vaikuntanathan and M. Venkitasubramaniam. <a href=\"https:\/\/link.springer.com\/chapter\/10.1007\/978-3-031-06944-4_11\">Asymptotically Quasi-Optimal Cryptography.<\/a> In EUROCRYPT Springer-Verlag (LNCS <span dir=\"ltr\" role=\"presentation\">13275<\/span>), pages 303-334, 2022.<\/li>\n<li>S. Faust, C. Hazay, D. Kretzler and B. Schlosser. <a href=\"https:\/\/eprint.iacr.org\/2021\/1652.pdf\">Financially Backed Covert Security<\/a>. In Public Key Cryptography (PKC) Springer-Verlag (LNCS 13178), pages 99-129, 2022.<\/li>\n<li>C. Hazay, M. Venkitasubramaniam and M. Weiss.<a href=\"https:\/\/eprint.iacr.org\/2021\/606.pdf\"> ZK-PCPs from Leakage-Resilient Secret Sharing.<\/a> In ITC, pages 1-21(199), 2021.<\/li>\n<li>S. Faust, C. Hazay, D. Kretzler and B. Schlosser. <a href=\"https:\/\/eprint.iacr.org\/2021\/251.pdf\"><span dir=\"ltr\">Generic Compiler for Publicly Verifiable Covert <\/span><span dir=\"ltr\">Multi-Party Computation<\/span>.<\/a> In EUROCRYPT Springer-Verlag (LNCS 13178), pages 99-129, 2021.<\/li>\n<li>M. Chen, C. Hazay, Y. Ishai, Y. Kashnikov, D. Micciancio, T. Riviere, a. shelat, M. Venkitasubramaniam and R. Wang. <a href=\"https:\/\/eprint.iacr.org\/2020\/374.pdf\">Diogenes: Lightweight Scalable RSA Modulus Generation with a Dishonest Majority.<\/a> In IEEE Symposium on Security and Privacy (S&amp;P), 2021.<\/li>\n<li>J. Abascal, C. Hazay, M. H. Faghihi Sereshgi, Y. Ishai and M. Venkitasubramaniam. <a href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3372297.3423366\">Is the Classical GMW Paradigm Practical? The Case of Non-Interactive Actively Secure 2PC.<\/a> In the ACM Conference on Computer and Communications Security (ACM CCS), pages 1591-1605, 2020.<\/li>\n<li>R. Bhadauria, Z. Fang, C. Hazay, M. Venkitasubramaniam, T. Xie and Y. Zhang. <a href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3372297.3417893\">Ligero++: A New Optimized Sublinear IOP.<\/a> In the ACM Conference on Computer and Communications Security (ACM CCS), pages 2025-2038, 2020.<\/li>\n<li>C. Hazay and M. Lilintal. <a href=\"https:\/\/link.springer.com\/chapter\/10.1007%2F978-3-030-57990-6_12\">Gradual GRAM and Secure Computation for RAM Programs.<\/a> In the Conference on Security and Cryptography for Networks (SCN), Springer-Verlag (LNCS 12238), pages 233-252, 2020.<\/li>\n<li>R. Bhadauria and C. Hazay. <a href=\"https:\/\/link.springer.com\/chapter\/10.1007%2F978-3-030-57990-6_8\">Multi-Clients Verifiable Computation via Conditional Disclosure of Secrets.<\/a> In the Conference on Security and Cryptography for Networks (SCN), Springer-Verlag (LNCS 12238), pages 150-172, 2020.<\/li>\n<li>C. Hazay, A. Shelat and M. Venkitasubramaniam. <a href=\"https:\/\/eprint.iacr.org\/2020\/139.pdf\">Going Beyond Dual Execution: MPC for Functions with Efficient Verification.<\/a> In Public Key Cryptography (PKC) Springer-Verlag (LNCS 12111), pages 328-356, 2020.<\/li>\n<li>C. Hazay, R. Pass and M. Venkitasubramaniam. <a href=\"https:\/\/link.springer.com\/chapter\/10.1007%2F978-3-030-45727-3_20\">Which Languages Have 4-Round Fully Black-Box Zero-Knowledge Arguments from One-Way Functions?<\/a> In EUROCRYPT Springer-Verlag (LNCS 12106), pages 599-619, 2020.<\/li>\n<li>C. Hazay, M. Venkitasubramaniam and M. Weiss. <a href=\"https:\/\/eprint.iacr.org\/2019\/1250.pdf\">The Price of Active Security in Cryptographic Protocols.<\/a> In EUROCRYPT Springer-Verlag (LNCS 12106), pages 184-215, 2020.<\/li>\n<li>C. Hazay, A. Marcedone, Y. Ishai, M. Venkitasubramaniam. <a href=\"https:\/\/eprint.iacr.org\/2020\/393.pdf\">LevioSA: Lightweight Secure Arithmetic Computation.<\/a> In the ACM Conference on Computer and Communications Security (ACM CCS), pages 327-344 2019.<\/li>\n<li>M. Byali, C Hazay, A. Patra and S. Singla. <a href=\"https:\/\/eprint.iacr.org\/2019\/863.pdf\"> Fast Actively Secure Five-Party Computation with Security Beyond Abort.<\/a> In the ACM Conference on Computer and Communications Security (ACM CCS), pages 1573-1590 2019.<\/li>\n<li>C. Hazay, E. Orsini, P. Scholl and E. Soria-Vazquez. <a href=\"http:\/\/eprint.iacr.org\/2018\/843.pdf\">Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT).<\/a> In ASIACRYPT, Springer-Verlag (LNCS 11274), pages 86-117, 2018.<\/li>\n<li>C. Hazay and M. Venkitasubramaniam. <a href=\"http:\/\/eprint.iacr.org\/2018\/912.pdf\">Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations.<\/a> In the Theory of Cryptography Conference (TCC), Springer-Verlag (LNCS 11239), pages 263-285, 2018.<\/li>\n<li>S. Halevi, C. Hazay, A. Polychroniadou and M. Venkitasubramaniam. <a href=\"http:\/\/eprint.iacr.org\/2017\/1056.pdf\">Round-Optimal Secure Multi-Party Computation. <\/a> In CRYPTO, Springer-Verlag (LNCS 10993), pages 488-520, 2018.<\/li>\n<li>C. Hazay, E. Orsini, P. Scholl and E. Soria-Vazquez. <a href=\"http:\/\/eprint.iacr.org\/2018\/208.pdf\">Efficient MPC from Syndrome Decoding.<\/a> In CRYPTO, Springer-Verlag (LNCS 10993), pages 3-33, 2018.<\/li>\n<li>C. Hazay, Y. Ishai, M. Venkitasubramaniam. <a href=\"http:\/\/eprint.iacr.org\/2017\/947.pdf\">Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model.<\/a> In the Theory of Cryptography Conference (TCC), Springer-Verlag (LNCS 10678), pages 3-39, 2017.<\/li>\n<li>C. Hazay, P. Scholl and E. Soria-Vazquez. <a href=\"http:\/\/eprint.iacr.org\/2017\/214.pdf\">Low Cost Constant Round MPC Combining BMR and Oblivious Transfer.<\/a> In ASIACRYPT, Springer-Verlag (LNCS 10624), pages 598-628, 2017.<\/li>\n<li>S. Ames, C. Hazay, Y. Ishai, M. Venkitasubramaniam. Ligero: Lightweight Sublinear Arguments Without a Trusted Setup. In the ACM Conference on Computer and Communications Security (ACM CCS), pages 2087-2104 2017.<\/li>\n<li>C. Hazay A. Polychroniadou and M. Venkitasubramaniam. <a href=\"http:\/\/eprint.iacr.org\/2017\/026.pdf\"> Constant-Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model.<\/a> In Public Key Cryptography (PKC), Springer-Verlag (LNCS 10175), pages 428-460, 2017.<\/li>\n<li>C. Hazay and M. Venkitasubramaniam. <a href=\"http:\/\/eprint.iacr.org\/2017\/027.pdf\">Scalable Multi-Party Private Set-Intersection. <\/a> In Public Key Cryptography (PKC), Springer-Verlag (LNCS 10174), pages 175-203, 2017.<\/li>\n<li>C. Hazay and A. Yanay. <a href=\"http:\/\/eprint.iacr.org\/2016\/805.pdf\">Constant-Round Maliciously Secure Two-Party Computation in the RAM Model.<\/a> In the Theory of Cryptography Conference (TCC-B), Springer-Verlag (LNCS 9985), pages 521-553, 2016.<\/li>\n<li>C. Hazay and M. Venkitasubramaniam. <a href=\"http:\/\/eprint.iacr.org\/2016\/818.pdf\">Composable Adaptive Secure Protocols without Setup under Polytime Assumptions.<\/a> In the Theory of Cryptography Conference (TCC-B), Springer-Verlag (LNCS 9985), pages 400-432, 2016.<\/li>\n<li>C. Hazay, A. Polychroniadou and M. Venkitasubramaniam. <a href=\"https:\/\/eprint.iacr.org\/2015\/887.pdf\">Composable Security in the Tamper-Proof Hardware Model under Minimal Complexity<\/a>. In the Theory of Cryptography Conference (TCC-B), Springer-Verlag (LNCS 9985), pages 367-399, 2016.<\/li>\n<li>C. Hazay and M. Venkitasubramaniam. <a href=\"https:\/\/eprint.iacr.org\/2015\/797.pdf\">What Security Can We Achieve within 4 Rounds?<\/a> In the Conference on Security and Cryptography for Networks (SCN), pages 486-505, 2016.<\/li>\n<li>C. Hazay and H. Zarosim. <a href=\"https:\/\/eprint.iacr.org\/2014\/706.pdf\">The Feasibility of Outsourced Database Search in the Plain Model.<\/a> In the Conference on Security and Cryptography for Networks (SCN), pages 313-332, 2016.<\/li>\n<li>C. Hazay and M. Venkitasubramaniam. <a href=\"https:\/\/eprint.iacr.org\/2016\/074.pdf\">On the Power of Secure Two-Party Computation.<\/a> In CRYPTO, Springer-Verlag (LNCS 9815), pages 397-429, 2016.<\/li>\n<li>C. Hazay, A. Patra and B. Warinschi. <a href=\"http:\/\/eprint.iacr.org\/2015\/860.pdf\">Selective Opening Security for Receivers.<\/a> In ASIACRYPT, Springer-Verlag (LNCS 9453), pages 443-469, 2015.<\/li>\n<li>C. Hazay and M. Venkitasubramaniam. <a href=\"http:\/\/eprint.iacr.org\/2015\/488.pdf\">On Black-Box Complexity of Universally Composable Security in the CRS model.<\/a> In ASIACRYPT, Springer-Verlag (LNCS 9453), pages 183-209, 2015.<\/li>\n<li>C. Hazay, Y. Lindell and A. Patra. <a href=\"http:\/\/eprint.iacr.org\/2015\/450.pdf\">Adaptively Secure Computation with Partial Erasures.<\/a> In PODC, pages 291-300, 2015.<\/li>\n<li>C. Hazay. <a href=\"http:\/\/eprint.iacr.org\/2015\/004.pdf\"> Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs.<\/a> In the Theory of Cryptography Conference (TCC), Springer-Verlag (LNCS 9015), pages 90-120, 2015.<\/li>\n<li>C. Hazay and A. Patra. <a href=\"http:\/\/eprint.iacr.org\/2013\/593.pdf\"> One-Sided Adaptively Secure Two-Party Computation.<\/a> In the Theory of Cryptography Conference (TCC), Springer-Verlag (LNCS 8349), pages 368-393, 2014.<\/li>\n<li>S. Faust, C. Hazay and D. Venturi. <a href=\"http:\/\/www.eng.biu.ac.il\/~hazay\/Conferences\/DelPM.pdf\"> Outsourced Pattern Matching.<\/a> In ICALP, Springer-Verlag (LNCS 7966), pages 545-556, 2013.<\/li>\n<li>C. Hazay, A. Lopez-Alt, H. Wee and D. Wichs. <a href=\"http:\/\/www.eng.biu.ac.il\/~hazay\/Conferences\/leakpke.pdf\"> Leakage-Resilient Cryptography from Minimal Assumptions.<\/a> In EUROCRYPT, Springer-Verlag (LNCS 7658), pages 160-176, 2013.<\/li>\n<li>S. Faust, C. Hazay, J. B. Nielsen, P. S. Nordholt and A. Zottarel. <a href=\"http:\/\/www.eng.biu.ac.il\/~hazay\/Conferences\/LeakResSig.pdf\"> Signature Schemes Secure against Hard-to-Invert Leakage.<\/a> In ASIACRYPT, Springer-Verlag (LNCS 7658), pages 98-115, 2012.<\/li>\n<li>Akavia, S. Goldwasser and C. Hazay. <a href=\"http:\/\/www.eng.biu.ac.il\/~hazay\/Conferences\/DistLeak.pdf\"> Distributed Public Key Schemes Secure against Continual Leakage.<\/a> In PODC, pages 155-164, 2012.<\/li>\n<li>I. Damgard, S. Faust and C. Hazay. <a href=\"http:\/\/www.eng.biu.ac.il\/~hazay\/Conferences\/DelegateComp.pdf\"> Secure Two-Party Computation with Low Communication.<\/a> In the Theory of Cryptography Conference (TCC), Springer-Verlag (LNCS 7194), pages 54-74, 2012.<\/li>\n<li>C. Hazay, G. L. Mikkelsen, T. Rabin and T. Toft. <a href=\"http:\/\/www.eng.biu.ac.il\/~hazay\/Conferences\/Pailler.pdf\"> Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting. <\/a> In CT-RSA, Springer-Verlag (LNCS 7178), pages 313-331, 2012.<\/li>\n<li>G. Asharov, R. Canetti and C. Hazay. <a href=\"http:\/\/www.eng.biu.ac.il\/~hazay\/Conferences\/GameTheory.pdf\"> Towards a Game Theoretic View of Secure Computation.<\/a> In EUROCRYPT, Springer-Verlag (LNCS 6632), pages 426-445, 2011.<\/li>\n<li>C. Hazay and T. Toft. <a href=\"http:\/\/www.eng.biu.ac.il\/~hazay\/Conferences\/pattern.pdf\"> Computationally Secure Pattern Matching in the Presence of Malicious Adversaries.<\/a> In ASIACRYPT, Springer-Verlag (LNCS 6477), pages 195-212, 2010.<\/li>\n<li>R. Gennaro, C. Hazay and J. Sorensen. <a href=\"http:\/\/www.eng.biu.ac.il\/~hazay\/Conferences\/textSearch.pdf\"> Text Search Protocols with Simulation Based Security.<\/a> In Public Key Cryptography (PKC), pages 332-350, 2010.<\/li>\n<li>C. Hazay and K. Nissim. <a href=\"http:\/\/www.eng.biu.ac.il\/~hazay\/Conferences\/setIntersection.pdf\"> Efficient Set Operations in the Presence of Malicious Adversaries.<\/a> In Public Key Cryptography (PKC), pages 312-331, 2010.<\/li>\n<li>D. Klinc, C. Hazay, A. Jagmohan, H. Krawczyk and T. Rabin. <a href=\"http:\/\/www.eng.biu.ac.il\/~hazay\/Conferences\/compressingAES.pdf\"> On Compressing Data Encrypted with Block Ciphers.<\/a> In Data Compression Conference, 213-222, 2009.<\/li>\n<li>C. Hazay and Y. Lindell. <a href=\"http:\/\/www.eng.biu.ac.il\/~hazay\/Conferences\/SmartCard2Party.pdf\"> Constructions of Truly Practical Secure Protocols using Standard Smartcards.<\/a> In the ACM Conference on Computer and Communications Security (ACM CCS), pages 491-500, 2008.<\/li>\n<li>D. Gordon, C. Hazay, J. Katz and Y. Lindell. <a href=\"http:\/\/www.eng.biu.ac.il\/~hazay\/Conferences\/fair2party.pdf\"> Complete Fairness in Secure Two-Party Computation.<\/a> In the ACM Symposium on the Theory of Computing (STOC), pages 413-422, 2008.<\/li>\n<li>C. Hazay and Y. Lindell. <a href=\"http:\/\/www.eng.biu.ac.il\/~hazay\/Conferences\/obprf.pdf\"> Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries.<\/a> In the Theory of Cryptography Conference (TCC), Springer-Verlag (LNCS 4948), pages 155-175, 2008.<\/li>\n<li>C. Hazay, J. Katz, C.Y. Koo and Y. Lindell. <a href=\"http:\/\/www.eng.biu.ac.il\/~hazay\/Conferences\/blindSigs.pdf\"> Concurrently-Secure Blind Signatures without Random Oracles or Setup Assumptions.<\/a> In the Theory of Cryptography Conference (TCC), Springer-Verlag (LNCS 4392), pages 323-341, 2007.<\/li>\n<li>C. Hazay, M. Lewenstein and D. Tzur. <a href=\"http:\/\/www.eng.biu.ac.il\/~hazay\/Conferences\/param-2d.pdf\"> Faster Algorithm for 2D parameterized Matching.<\/a> In the Symposium on Combinatorial Pattern Matching (CPM). Pages 266-279, 2005.<\/li>\n<li>C. Hazay, M. Lewenstein and D. Sokol. <a href=\"http:\/\/www.eng.biu.ac.il\/~hazay\/Conferences\/apm.pdf\"> Approximate parameterized matching<\/a>. In the 16<sup>th<\/sup> Annual European Symposium on Algorithms (ESA), pages 414-425, 2004.<\/li>\n<\/ol>\n<p><strong>Technical Reports:<\/strong><\/p>\n<ol>\n<li>C. Hazay and Y. Lindell. A Note on Zero-Knowledge Proofs of Knowledge and the ZKPOK Ideal Functionality. Cryptology ePrint Archive, Report 2010\/552, 2010.<\/li>\n<li>C. Hazay and Y. Lindell. A Note on the Relation between the Definitions of Security for Semi- Honest and Malicious Adversaries. Cryptology ePrint Archive, Report 2010\/551, 2010.<\/li>\n<\/ol>\n<p><strong>Other Publications:<\/strong><\/p>\n<ul>\n<li>C. Hazay. Secure Two-Party Computation. Galileo Magazine, February 2010.<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Useful links: Google Scholar DBLP \u00a0ORCID Books: Carmit Hazay and Yehuda Lindell. Efficient Secure Two-Party Protocols &#8212; Techniques and Constructions. Springer-Verlag, 2010. The preface, table of contents and introduction are available for perusal. More details on the book can be found here, and a review of the book that appeared in SIGACT NEWS can be &hellip; <a href=\"https:\/\/www.eng.biu.ac.il\/hazay\/publications\/\" class=\"more-link\">Continue reading <span class=\"screen-reader-text\">Publications<\/span> <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"open","template":"","meta":{"footnotes":""},"class_list":["post-29","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.eng.biu.ac.il\/hazay\/wp-json\/wp\/v2\/pages\/29"}],"collection":[{"href":"https:\/\/www.eng.biu.ac.il\/hazay\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.eng.biu.ac.il\/hazay\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.eng.biu.ac.il\/hazay\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.eng.biu.ac.il\/hazay\/wp-json\/wp\/v2\/comments?post=29"}],"version-history":[{"count":142,"href":"https:\/\/www.eng.biu.ac.il\/hazay\/wp-json\/wp\/v2\/pages\/29\/revisions"}],"predecessor-version":[{"id":536,"href":"https:\/\/www.eng.biu.ac.il\/hazay\/wp-json\/wp\/v2\/pages\/29\/revisions\/536"}],"wp:attachment":[{"href":"https:\/\/www.eng.biu.ac.il\/hazay\/wp-json\/wp\/v2\/media?parent=29"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}