Two Dimensional Parameterized Matching. - Carmit Hazay; Moshe Lewenstein; Dekel Tsur (CPM, 2005)

Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions. - Carmit Hazay; Jonathan Katz; Chiu-Yuen Koo; Yehuda Lindell (TCC, 2007)

Approximate parameterized matching. - Carmit Hazay; Moshe Lewenstein; Dina Sokol (ACM Trans. Algorithms, 2007)

Constructions of Truly Practical Secure Protocols using Standard Smartcards. - Carmit Hazay; Yehuda Lindell (IACR Cryptol. ePrint Arch., 2009)

Efficient Oblivious Polynomial Evaluation with Simulation-Based Security. - Carmit Hazay; Yehuda Lindell (IACR Cryptol. ePrint Arch., 2009)

Text Search Protocols with Simulation Based Security. - Rosario Gennaro; Carmit Hazay; Jeffrey S. Sorensen (Public Key Cryptography, 2010)

A Note on the Relation between the Definitions of Security for Semi-Honest and Malicious Adversaries. - Carmit Hazay; Yehuda Lindell (IACR Cryptol. ePrint Arch., 2010)

A Note on Zero-Knowledge Proofs of Knowledge and the ZKPOK Ideal Functionality. - Carmit Hazay; Yehuda Lindell (IACR Cryptol. ePrint Arch., 2010)

Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. - Carmit Hazay; Yehuda Lindell (J. Cryptol., 2010)

Efficient Secure Two-Party Protocols - Techniques and Constructions - Carmit Hazay; Yehuda Lindell (Springer, 2010)

Towards a Game Theoretic View of Secure Computation. - Gilad Asharov; Ran Canetti; Carmit Hazay (IACR Cryptol. ePrint Arch., 2011)

Secure Two-Party Computation with Low Communication. - Ivan Damgård; Sebastian Faust; Carmit Hazay (IACR Cryptol. ePrint Arch., 2011)

Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting. - Carmit Hazay; Gert Læssøe Mikkelsen; Tal Rabin; Tomas Toft (IACR Cryptol. ePrint Arch., 2011)

Complete Fairness in Secure Two-Party Computation. - S. Dov Gordon; Carmit Hazay; Jonathan Katz; Yehuda Lindell (J. ACM, 2011)

Distributed public key schemes secure against continual leakage. - Adi Akavia; Shafi Goldwasser; Carmit Hazay (PODC, 2012)

Efficient Set Operations in the Presence of Malicious Adversaries. - Carmit Hazay; Kobbi Nissim (J. Cryptol., 2012)

On Compression of Data Encrypted With Block Ciphers. - Demijan Klinc; Carmit Hazay; Ashish Jagmohan; Hugo Krawczyk; Tal Rabin (IEEE Trans. Inf. Theory, 2012)

One-Sided Adaptively Secure Two-Party Computation. - Carmit Hazay; Arpita Patra (IACR Cryptol. ePrint Arch., 2013)

Outsourced Pattern Matching. - Sebastian Faust; Carmit Hazay; Daniele Venturi 001 (IACR Cryptol. ePrint Arch., 2014)

The Feasibility of Outsourced Database Search in the Plain Model. - Carmit Hazay; Hila Zarosim (IACR Cryptol. ePrint Arch., 2014)

Computationally Secure Pattern Matching in the Presence of Malicious Adversaries. - Carmit Hazay; Tomas Toft (J. Cryptol., 2014)

Two-Dimensional Parameterized Matching. - Richard Cole 001; Carmit Hazay; Moshe Lewenstein; Dekel Tsur (ACM Trans. Algorithms, 2014)

Adaptively Secure Computation with Partial Erasures. - Carmit Hazay; Yehuda Lindell; Arpita Patra (IACR Cryptol. ePrint Arch., 2015)

Round-Optimal Token-Based Secure Computation. - Carmit Hazay; Antigoni Polychroniadou; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2015)

Selective Opening Security for Receivers. - Carmit Hazay; Arpita Patra; Bogdan Warinschi (IACR Cryptol. ePrint Arch., 2015)

What Security can we Achieve in 4-Rounds? - Carmit Hazay; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2015)

Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity. - Carmit Hazay; Antigoni Polychroniadou; Muthuramakrishnan Venkitasubramaniam (TCC (B1), 2016)

Composable Adaptive Secure Protocols without Setup under Polytime Assumptions. - Carmit Hazay; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2016)

Toward a Game Theoretic View of Secure Computation. - Gilad Asharov; Ran Canetti; Carmit Hazay (J. Cryptol., 2016)

Signature Schemes Secure Against Hard-to-Invert Leakage. - Sebastian Faust; Carmit Hazay; Jesper Buus Nielsen; Peter Sebastian Nordholt; Angela Zottarel (J. Cryptol., 2016)

Efficient Set Intersection with Simulation-Based Security. - Michael J. Freedman; Carmit Hazay; Kobbi Nissim; Benny Pinkas (J. Cryptol., 2016)

Automata Evaluation and Text Search Protocols with Simulation-Based Security. - Rosario Gennaro; Carmit Hazay; Jeffrey S. Sorensen (J. Cryptol., 2016)

Leakage-Resilient Cryptography from Minimal Assumptions. - Carmit Hazay; Adriana López-Alt; Hoeteck Wee; Daniel Wichs (J. Cryptol., 2016)

Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model. - Carmit Hazay; Antigoni Polychroniadou; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2017)

Scalable Multi-Party Private Set-Intersection. - Carmit Hazay; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2017)

Efficient One-Sided Adaptively Secure Computation. - Carmit Hazay; Arpita Patra (J. Cryptol., 2017)

Outsourcing Private Machine Learning via Lightweight Secure Arithmetic Computation. - Siddharth Garg; Zahra Ghodsi; Carmit Hazay; Yuval Ishai; Antonio Marcedone; Muthuramakrishnan Venkitasubramaniam (CoRR, 2018)

Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT). - Carmit Hazay; Emmanuela Orsini; Peter Scholl; Eduardo Soria-Vazquez (IACR Cryptol. ePrint Arch., 2018)

Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations. - Carmit Hazay; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2018)

Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs. - Carmit Hazay (J. Cryptol., 2018)

Fast Actively Secure Five-Party Computation with Security Beyond Abort. - Megha Byali; Carmit Hazay; Arpita Patra; Swati Singla (IACR Cryptol. ePrint Arch., 2019)

Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting. - Carmit Hazay; Gert Læssøe Mikkelsen; Tal Rabin; Tomas Toft; Angelo Agatino Nicolosi (J. Cryptol., 2019)

On Black-Box Complexity of Universally Composable Security in the CRS Model. - Carmit Hazay; Muthuramakrishnan Venkitasubramaniam (J. Cryptol., 2019)

What Security Can We Achieve Within 4 Rounds? - Carmit Hazay; Muthuramakrishnan Venkitasubramaniam (J. Cryptol., 2019)

Constant-Round Maliciously Secure Two-Party Computation in the RAM Model. - Carmit Hazay; Avishay Yanai (J. Cryptol., 2019)

Is the Classical GMW Paradigm Practical? The Case of Non-Interactive Actively Secure 2PC. - Jackson Abascal; Mohammad Hossein Faghihi Sereshgi; Carmit Hazay; Yuval Ishai; Muthuramakrishnan Venkitasubramaniam (CCS, 2020)

Ligero++: A New Optimized Sublinear IOP. - Rishabh Bhadauria; Zhiyong Fang; Carmit Hazay; Muthuramakrishnan Venkitasubramaniam; Tiancheng Xie; Yupeng Zhang 001 (CCS, 2020)

Which Languages Have 4-Round Fully Black-Box Zero-Knowledge Arguments from One-Way Functions? - Carmit Hazay; Rafael Pass; Muthuramakrishnan Venkitasubramaniam (EUROCRYPT (3), 2020)

Multi-clients Verifiable Computation via Conditional Disclosure of Secrets. - Rishabh Bhadauria; Carmit Hazay (SCN, 2020)

Diogenes: Lightweight Scalable RSA Modulus Generation with a Dishonest Majority. - Megan Chen; Carmit Hazay; Yuval Ishai; Yuriy Kashnikov; Daniele Micciancio; Tarik Riviere; Abhi Shelat; Muthuramakrishnan Venkitasubramaniam; Ruihan Wang (IACR Cryptol. ePrint Arch., 2020)

LevioSA: Lightweight Secure Arithmetic Computation. - Carmit Hazay; Yuval Ishai; Antonio Marcedone; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2020)

Going Beyond Dual Execution: MPC for Functions with Efficient Verification. - Carmit Hazay; Abhi Shelat; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2020)

Low Cost Constant Round MPC Combining BMR and Oblivious Transfer. - Carmit Hazay; Peter Scholl; Eduardo Soria-Vazquez (J. Cryptol., 2020)

On the Power of Secure Two-Party Computation. - Carmit Hazay; Muthuramakrishnan Venkitasubramaniam (J. Cryptol., 2020)

A New Framework for Garbled Circuits. - Tomer Ashur; Efrat Cohen; Carmit Hazay; Avishay Yanai (IACR Cryptol. ePrint Arch., 2021)

Generic Compiler for Publicly Verifiable Covert Multi-Party Computation. - Sebastian Faust; Carmit Hazay; David Kretzler; Benjamin Schlosser (IACR Cryptol. ePrint Arch., 2021)

Financially Backed Covert Security. - Sebastian Faust; Carmit Hazay; David Kretzler; Benjamin Schlosser (IACR Cryptol. ePrint Arch., 2021)

Round-Optimal Secure Multi-party Computation. - Shai Halevi; Carmit Hazay; Antigoni Polychroniadou; Muthuramakrishnan Venkitasubramaniam (J. Cryptol., 2021)

Asymptotically Quasi-Optimal Cryptography. - Leo de Castro; Carmit Hazay; Yuval Ishai; Vinod Vaikuntanathan; Muthuramakrishnan Venkitasubramaniam (EUROCRYPT (1), 2022)

Comparison-based MPC in Star Topology. - Gowri R. Chandran; Carmit Hazay; Robin Hundt; Thomas Schneider 003 (SECRYPT, 2022)

SCALES: MPC with Small Clients and Larger Ephemeral Servers. - Anasuya Acharya; Carmit Hazay; Vladimir Kolesnikov; Manoj Prabhakaran 001 (IACR Cryptol. ePrint Arch., 2022)

On Black-Box Constructions of Time and Space Efficient Sublinear Arguments from Symmetric-Key Primitives. - Laasya Bangalore; Rishabh Bhadauria; Carmit Hazay; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2022)

Comparison-Based MPC in Star Topology (Full Version). - Gowri R. Chandran; Carmit Hazay; Robin Hundt; Thomas Schneider 003 (IACR Cryptol. ePrint Arch., 2022)

More Efficient (Reusable) Private Set Union. - S. Dov Gordon; Carmit Hazay; Phi Hung Le; Mingyu Liang (IACR Cryptol. ePrint Arch., 2022)

Your Reputation's Safe with Me: Framing-Free Distributed Zero-Knowledge Proofs. - Carmit Hazay; Muthuramakrishnan Venkitasubramaniam; Mor Weiss (IACR Cryptol. ePrint Arch., 2022)

Gradual GRAM and secure computation for RAM programs. - Carmit Hazay; Mor Lilintal (J. Comput. Secur., 2022)

TinyKeys: A New Approach to Efficient Multi-Party Computation. - Carmit Hazay; Emmanuela Orsini; Peter Scholl; Eduardo Soria-Vazquez (J. Cryptol., 2022)

ZK-PCPs from Leakage-Resilient Secret Sharing. - Carmit Hazay; Muthuramakrishnan Venkitasubramaniam; Mor Weiss (J. Cryptol., 2022)

Fully Secure PSI via MPC-in-the-Head. - S. Dov Gordon; Carmit Hazay; Phi Hung Le (Proc. Priv. Enhancing Technol., 2022)

A New Approach to Garbled Circuits. - Anasuya Acharya; Tomer Ashur; Efrat Cohen; Carmit Hazay; Avishay Yanai (ACNS, 2023)

Flag: A Framework for Lightweight Robust Secure Aggregation. - Laasya Bangalore; Mohammad Hossein Faghihi Sereshgi; Carmit Hazay; Muthuramakrishnan Venkitasubramaniam (AsiaCCS, 2023)

Towards Optimal Communication Byzantine Reliable Broadcast under a Message Adversary. - Timothé Albouy; Davide Frey; Ran Gelles; Carmit Hazay; Michel Raynal; Elad Michael Schiller; François Taïani; Vassilis Zikas (CoRR, 2023)

Best of Both Worlds: Revisiting the Spymasters Double Agent Problem. - Anasuya Acharya; Carmit Hazay; Oxana Poburinnaya; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2023)

Private Polynomial Commitments and Applications to MPC. - Rishabh Bhadauria; Carmit Hazay; Muthuramakrishnan Venkitasubramaniam; Wenxuan Wu; Yupeng Zhang 001 (IACR Cryptol. ePrint Arch., 2023)

Putting the Online Phase on a Diet: Covert Security from Short MACs. - Sebastian Faust; Carmit Hazay; David Kretzler; Benjamin Schlosser (IACR Cryptol. ePrint Arch., 2023)

Statement-Oblivious Threshold Witness Encryption. - Sebastian Faust; Carmit Hazay; David Kretzler; Benjamin Schlosser (IACR Cryptol. ePrint Arch., 2023)

Threshold BBS+ From Pseudorandom Correlations. - Sebastian Faust; Carmit Hazay; David Kretzler; Benjamin Schlosser (IACR Cryptol. ePrint Arch., 2023)

Beyond MPC-in-the-Head: Black-Box Constructions of Short Zero-Knowledge Proofs. - Carmit Hazay; Muthuramakrishnan Venkitasubramaniam; Mor Weiss (IACR Cryptol. ePrint Arch., 2023)

Batchman and Robin: Batched and Non-batched Branching for Interactive ZK. - Yibin Yang 001; David Heath; Carmit Hazay; Vladimir Kolesnikov; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2023)

Garbled Circuits from an SCA Perspective Free XOR can be Quite Expensive. . . - Itamar Levi; Carmit Hazay (IACR Trans. Cryptogr. Hardw. Embed. Syst., 2023)

Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model. - Carmit Hazay; Yuval Ishai; Muthuramakrishnan Venkitasubramaniam (J. Cryptol., 2023)

Ligero: lightweight sublinear arguments without a trusted setup. - Scott Ames; Carmit Hazay; Yuval Ishai; Muthuramakrishnan Venkitasubramaniam (Des. Codes Cryptogr., 2023)

sfLogRobin++: Optimizing Proofs of Disjunctive Statements in VOLE-Based ZK. - Carmit Hazay; David Heath; Vladimir Kolesnikov; Muthuramakrishnan Venkitasubramaniam; Yibin Yang 001 (ASIACRYPT (5), 2024)

Near-Optimal Communication Byzantine Reliable Broadcast Under a Message Adversary. - Timothé Albouy; Davide Frey; Ran Gelles; Carmit Hazay; Michel Raynal; Elad Michael Schiller; François Taïani; Vassilis Zikas (OPODIS, 2024)

sfLR-sfOT: Leakage-Resilient Oblivious Transfer. - Francesco Berti; Carmit Hazay; Itamar Levi (SCN (1), 2024)

Ligetron: Lightweight Scalable End-to-End Zero-Knowledge Proofs Post-Quantum ZK-SNARKs on a Browser. - Ruihan Wang; Carmit Hazay; Muthuramakrishnan Venkitasubramaniam (SP, 2024)

Brief Announcement: Towards Optimal Communication Byzantine Reliable Broadcast Under a Message Adversary. - Timothé Albouy; Davide Frey; Ran Gelles; Carmit Hazay; Michel Raynal; Elad Michael Schiller; François Taïani; Vassilis Zikas (DISC, 2024)

Malicious Security for SCALES: Outsourced Computation with Ephemeral Servers. - Anasuya Acharya; Carmit Hazay; Vladimir Kolesnikov; Manoj Prabhakaran 001 (IACR Cryptol. ePrint Arch., 2024)

On the Feasibility of Sliced Garbling. - Tomer Ashur; Carmit Hazay; Rahul Satish (IACR Cryptol. ePrint Arch., 2024)

LR-OT: Leakage-Resilient Oblivious Transfer. - Francesco Berti; Carmit Hazay; Itamar Levi (IACR Cryptol. ePrint Arch., 2024)

Private Laconic Oblivious Transfer with Preprocessing. - Rishabh Bhadauria; Nico Döttling; Carmit Hazay; Chuanwei Lin (IACR Cryptol. ePrint Arch., 2024)

LogRobin++: Optimizing Proofs of Disjunctive Statements in VOLE-Based ZK. - Carmit Hazay; David Heath; Vladimir Kolesnikov; Muthuramakrishnan Venkitasubramaniam; Yibin Yang 001 (IACR Cryptol. ePrint Arch., 2024)

Toward Malicious Constant-Rate 2PC via Arithmetic Garbling. - Carmit Hazay; Yibin Yang 001 (IACR Cryptol. ePrint Arch., 2024)

Tight ZK CPU: Batched ZK Branching with Cost Proportional to Evaluated Instruction. - Yibin Yang 001; David Heath; Carmit Hazay; Vladimir Kolesnikov; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2024)

The Price of Active Security in Cryptographic Protocols. - Carmit Hazay; Muthuramakrishnan Venkitasubramaniam; Mor Weiss (J. Cryptol., 2024)

ømega (1/λ )-Rate Boolean Garbling Scheme from Generic Groups. - Geoffroy Couteau; Carmit Hazay; Aditya Hegde 003; Naman Kumar 002 (CRYPTO (4), 2025)

Non-interactive Threshold BBS+ from Pseudorandom Correlations. - Sebastian Faust; Carmit Hazay; David Kretzler; Leandro Rometsch; Benjamin Schlosser (CT-RSA, 2025)

Towards Building Efficient SCALES Protocols. - Anasuya Acharya; Carmit Hazay; Vladimir Kolesnikov; Manoj Prabhakaran 001 (IACR Cryptol. ePrint Arch., 2025)

Laconic Cryptography with Preprocessing. - Rishabh Bhadauria; Nico Döttling; Carmit Hazay; Chuanwei Lin (IACR Cryptol. ePrint Arch., 2025)

휔(1/휆)-Rate Boolean Garbling Scheme from Generic Groups. - Geoffroy Couteau; Carmit Hazay; Aditya Hegde 003; Naman Kumar 002 (IACR Cryptol. ePrint Arch., 2025)

Breaking the 1/λ-Rate Barrier for Arithmetic Garbling. - Geoffroy Couteau; Carmit Hazay; Aditya Hegde 003; Naman Kumar 002 (IACR Cryptol. ePrint Arch., 2025)

Protecting Distributed Primitives Against Leakage: Equivocal Secret Sharing and more. - Carmit Hazay; Muthuramakrishnan Venkitasubramaniam; Mor Weiss (J. Cryptol., 2025)