Carmit Hazay

ORCID

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 120

Top Venues

IACR Cryptol. ePrint Arch.

J. Cryptol.

CCS

TCC (1)

Publications

Anasuya Acharya, Carmit Hazay, Vladimir Kolesnikov, Manoj Prabhakaran
Malicious Security for SCALES - Outsourced Computation with Ephemeral Servers. CRYPTO (9) (2024)
Tomer Ashur, Carmit Hazay, Rahul Satish
On the Feasibility of Sliced Garbling. IACR Cryptol. ePrint Arch. 2024 (2024)
Carmit Hazay, Yibin Yang
Toward Malicious Constant-Rate 2PC via Arithmetic Garbling. IACR Cryptol. ePrint Arch. 2024 (2024)
Anasuya Acharya, Carmit Hazay, Vladimir Kolesnikov, Manoj Prabhakaran
Malicious Security for SCALES: Outsourced Computation with Ephemeral Servers. IACR Cryptol. ePrint Arch. 2024 (2024)
Yibin Yang, David Heath, Carmit Hazay, Vladimir Kolesnikov, Muthuramakrishnan Venkitasubramaniam
Tight ZK CPU: Batched ZK Branching with Cost Proportional to Evaluated Instruction. IACR Cryptol. ePrint Arch. 2024 (2024)
Carmit Hazay, Yibin Yang
Toward Malicious Constant-Rate 2PC via Arithmetic Garbling. EUROCRYPT (5) (2024)
Francesco Berti, Carmit Hazay, Itamar Levi
LR-OT: Leakage-Resilient Oblivious Transfer. IACR Cryptol. ePrint Arch. 2024 (2024)
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss
The Price of Active Security in Cryptographic Protocols. J. Cryptol. 37 (3) (2024)
Timothé Albouy, Davide Frey, Ran Gelles, Carmit Hazay, Michel Raynal, Elad Michael Schiller, François Taïani, Vassilis Zikas
Towards Optimal Communication Byzantine Reliable Broadcast under a Message Adversary. CoRR (2023)
Anasuya Acharya, Carmit Hazay, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam
Best of Both Worlds - Revisiting the Spymasters Double Agent Problem. CRYPTO (1) (2023)
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss
Beyond MPC-in-the-Head: Black-Box Constructions of Short Zero-Knowledge Proofs. TCC (1) (2023)
Anasuya Acharya, Carmit Hazay, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam
Best of Both Worlds: Revisiting the Spymasters Double Agent Problem. IACR Cryptol. ePrint Arch. 2023 (2023)
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss
Beyond MPC-in-the-Head: Black-Box Constructions of Short Zero-Knowledge Proofs. IACR Cryptol. ePrint Arch. 2023 (2023)
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss
Your Reputation's Safe with Me: Framing-Free Distributed Zero-Knowledge Proofs. TCC (1) (2023)
Laasya Bangalore, Mohammad Hossein Faghihi Sereshgi, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
Flag: A Framework for Lightweight Robust Secure Aggregation. AsiaCCS (2023)
Scott Ames, Carmit Hazay, Yuval Ishai, Muthuramakrishnan Venkitasubramaniam
Ligero: lightweight sublinear arguments without a trusted setup. Des. Codes Cryptogr. 91 (11) (2023)
Sebastian Faust, Carmit Hazay, David Kretzler, Benjamin Schlosser
Putting the Online Phase on a Diet: Covert Security from Short MACs. IACR Cryptol. ePrint Arch. 2023 (2023)
Itamar Levi, Carmit Hazay
Garbled Circuits from an SCA Perspective Free XOR can be Quite Expensive. . . IACR Trans. Cryptogr. Hardw. Embed. Syst. 2023 (2) (2023)
Rishabh Bhadauria, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Wenxuan Wu, Yupeng Zhang
Private Polynomial Commitments and Applications to MPC. Public Key Cryptography (2) (2023)
Sebastian Faust, Carmit Hazay, David Kretzler, Benjamin Schlosser
Threshold BBS+ From Pseudorandom Correlations. IACR Cryptol. ePrint Arch. 2023 (2023)
Rishabh Bhadauria, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Wenxuan Wu, Yupeng Zhang
Private Polynomial Commitments and Applications to MPC. IACR Cryptol. ePrint Arch. 2023 (2023)
Anasuya Acharya, Tomer Ashur, Efrat Cohen, Carmit Hazay, Avishay Yanai
A New Approach to Garbled Circuits. ACNS (2023)
Carmit Hazay, Yuval Ishai, Muthuramakrishnan Venkitasubramaniam
Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model. J. Cryptol. 36 (3) (2023)
Sebastian Faust, Carmit Hazay, David Kretzler, Benjamin Schlosser
Statement-Oblivious Threshold Witness Encryption. CSF (2023)
Yibin Yang, David Heath, Carmit Hazay, Vladimir Kolesnikov, Muthuramakrishnan Venkitasubramaniam
Batchman and Robin: Batched and Non-batched Branching for Interactive ZK. CCS (2023)
Yibin Yang, David Heath, Carmit Hazay, Vladimir Kolesnikov, Muthuramakrishnan Venkitasubramaniam
Batchman and Robin: Batched and Non-batched Branching for Interactive ZK. IACR Cryptol. ePrint Arch. 2023 (2023)
Sebastian Faust, Carmit Hazay, David Kretzler, Benjamin Schlosser
Statement-Oblivious Threshold Witness Encryption. IACR Cryptol. ePrint Arch. 2023 (2023)
Sebastian Faust, Carmit Hazay, David Kretzler, Benjamin Schlosser
Putting the Online Phase on a Diet: Covert Security from Short MACs. CT-RSA (2023)
S. Dov Gordon, Carmit Hazay, Phi Hung Le
Fully Secure PSI via MPC-in-the-Head. Proc. Priv. Enhancing Technol. 2022 (3) (2022)
S. Dov Gordon, Carmit Hazay, Phi Hung Le, Mingyu Liang
More Efficient (Reusable) Private Set Union. IACR Cryptol. ePrint Arch. 2022 (2022)
Anasuya Acharya, Carmit Hazay, Vladimir Kolesnikov, Manoj Prabhakaran
SCALES - MPC with Small Clients and Larger Ephemeral Servers. TCC (2) (2022)
Scott Ames, Carmit Hazay, Yuval Ishai, Muthuramakrishnan Venkitasubramaniam
Ligero: Lightweight Sublinear Arguments Without a Trusted Setup. IACR Cryptol. ePrint Arch. 2022 (2022)
Laasya Bangalore, Rishabh Bhadauria, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
On Black-Box Constructions of Time and Space Efficient Sublinear Arguments from Symmetric-Key Primitives. IACR Cryptol. ePrint Arch. 2022 (2022)
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss
ZK-PCPs from Leakage-Resilient Secret Sharing. J. Cryptol. 35 (4) (2022)
Sebastian Faust, Carmit Hazay, David Kretzler, Benjamin Schlosser
Financially Backed Covert Security. Public Key Cryptography (2) (2022)
Gowri R. Chandran, Carmit Hazay, Robin Hundt, Thomas Schneider
Comparison-Based MPC in Star Topology (Full Version). IACR Cryptol. ePrint Arch. 2022 (2022)
Carmit Hazay, Mor Lilintal
Gradual GRAM and secure computation for RAM programs. J. Comput. Secur. 30 (1) (2022)
S. Dov Gordon, Carmit Hazay, Phi Hung Le
Fully Secure PSI via MPC-in-the-Head. IACR Cryptol. ePrint Arch. 2022 (2022)
Laasya Bangalore, Rishabh Bhadauria, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
On Black-Box Constructions of Time and Space Efficient Sublinear Arguments from Symmetric-Key Primitives. TCC (1) (2022)
Anasuya Acharya, Carmit Hazay, Vladimir Kolesnikov, Manoj Prabhakaran
SCALES: MPC with Small Clients and Larger Ephemeral Servers. IACR Cryptol. ePrint Arch. 2022 (2022)
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss
Protecting Distributed Primitives Against Leakage: Equivocal Secret Sharing and More. ITC (2022)
Itamar Levi, Carmit Hazay
Garbled-Circuits from an SCA Perspective: Free XOR can be Quite Expensive. . . IACR Cryptol. ePrint Arch. 2022 (2022)
Leo de Castro, Carmit Hazay, Yuval Ishai, Vinod Vaikuntanathan, Muthu Venkitasubramaniam
Asymptotically Quasi-Optimal Cryptography. EUROCRYPT (1) (2022)
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss
Your Reputation's Safe with Me: Framing-Free Distributed Zero-Knowledge Proofs. IACR Cryptol. ePrint Arch. 2022 (2022)
Gowri R. Chandran, Carmit Hazay, Robin Hundt, Thomas Schneider
Comparison-based MPC in Star Topology. SECRYPT (2022)
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss
Protecting Distributed Primitives against Leakage: Equivocal Secret Sharing and More. IACR Cryptol. ePrint Arch. 2022 (2022)
Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez
TinyKeys: A New Approach to Efficient Multi-Party Computation. J. Cryptol. 35 (2) (2022)
Sebastian Faust, Carmit Hazay, David Kretzler, Benjamin Schlosser
Financially Backed Covert Security. IACR Cryptol. ePrint Arch. 2021 (2021)
Tomer Ashur, Efrat Cohen, Carmit Hazay, Avishay Yanai
A New Framework for Garbled Circuits. IACR Cryptol. ePrint Arch. 2021 (2021)
Shai Halevi, Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam
Round-Optimal Secure Multi-party Computation. J. Cryptol. 34 (3) (2021)
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss
ZK-PCPs from Leakage-Resilient Secret Sharing. ITC (2021)
Sebastian Faust, Carmit Hazay, David Kretzler, Benjamin Schlosser
Generic Compiler for Publicly Verifiable Covert Multi-Party Computation. EUROCRYPT (2) (2021)
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss
ZK-PCPs from Leakage-Resilient Secret Sharing. IACR Cryptol. ePrint Arch. 2021 (2021)
Megan Chen, Carmit Hazay, Yuval Ishai, Yuriy Kashnikov, Daniele Micciancio, Tarik Riviere, Abhi Shelat, Muthu Venkitasubramaniam, Ruihan Wang
Diogenes: Lightweight Scalable RSA Modulus Generation with a Dishonest Majority. IEEE Symposium on Security and Privacy (2021)
Sebastian Faust, Carmit Hazay, David Kretzler, Benjamin Schlosser
Generic Compiler for Publicly Verifiable Covert Multi-Party Computation. IACR Cryptol. ePrint Arch. 2021 (2021)
Megan Chen, Carmit Hazay, Yuval Ishai, Yuriy Kashnikov, Daniele Micciancio, Tarik Riviere, Abhi Shelat, Muthuramakrishnan Venkitasubramaniam, Ruihan Wang
Diogenes: Lightweight Scalable RSA Modulus Generation with a Dishonest Majority. IACR Cryptol. ePrint Arch. 2020 (2020)
Carmit Hazay, Rafael Pass, Muthuramakrishnan Venkitasubramaniam
Which Languages Have 4-Round Fully Black-Box Zero-Knowledge Arguments from One-Way Functions? EUROCRYPT (3) (2020)
Rishabh Bhadauria, Zhiyong Fang, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Tiancheng Xie, Yupeng Zhang
Ligero++: A New Optimized Sublinear IOP. CCS (2020)
Jackson Abascal, Mohammad Hossein Faghihi Sereshgi, Carmit Hazay, Yuval Ishai, Muthuramakrishnan Venkitasubramaniam
Is the Classical GMW Paradigm Practical? The Case of Non-Interactive Actively Secure 2PC. CCS (2020)
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss
The Price of Active Security in Cryptographic Protocols. EUROCRYPT (2) (2020)
Carmit Hazay, Abhi Shelat, Muthuramakrishnan Venkitasubramaniam
Going Beyond Dual Execution: MPC for Functions with Efficient Verification. Public Key Cryptography (2) (2020)
Carmit Hazay, Yuval Ishai, Antonio Marcedone, Muthuramakrishnan Venkitasubramaniam
LevioSA: Lightweight Secure Arithmetic Computation. IACR Cryptol. ePrint Arch. 2020 (2020)
Carmit Hazay, Abhi Shelat, Muthuramakrishnan Venkitasubramaniam
Going Beyond Dual Execution: MPC for Functions with Efficient Verification. IACR Cryptol. ePrint Arch. 2020 (2020)
Rishabh Bhadauria, Carmit Hazay
Multi-clients Verifiable Computation via Conditional Disclosure of Secrets. SCN (2020)
Carmit Hazay, Mor Lilintal
Gradual GRAM and Secure Computation for RAM Programs. SCN (2020)
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
On the Power of Secure Two-Party Computation. J. Cryptol. 33 (1) (2020)
Carmit Hazay, Peter Scholl, Eduardo Soria-Vazquez
Low Cost Constant Round MPC Combining BMR and Oblivious Transfer. J. Cryptol. 33 (4) (2020)
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
What Security Can We Achieve Within 4 Rounds? J. Cryptol. 32 (4) (2019)
Megha Byali, Carmit Hazay, Arpita Patra, Swati Singla
Fast Actively Secure Five-Party Computation with Security Beyond Abort. CCS (2019)
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
On Black-Box Complexity of Universally Composable Security in the CRS Model. J. Cryptol. 32 (3) (2019)
Carmit Hazay, Yuval Ishai, Antonio Marcedone, Muthuramakrishnan Venkitasubramaniam
LevioSA: Lightweight Secure Arithmetic Computation. CCS (2019)
Carmit Hazay, Avishay Yanai
Constant-Round Maliciously Secure Two-Party Computation in the RAM Model. J. Cryptol. 32 (4) (2019)
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss
The Price of Active Security in Cryptographic Protocols. IACR Cryptol. ePrint Arch. 2019 (2019)
Carmit Hazay, Gert Læssøe Mikkelsen, Tal Rabin, Tomas Toft, Angelo Agatino Nicolosi
Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting. J. Cryptol. 32 (2) (2019)
Megha Byali, Carmit Hazay, Arpita Patra, Swati Singla
Fast Actively Secure Five-Party Computation with Security Beyond Abort. IACR Cryptol. ePrint Arch. 2019 (2019)
Shai Halevi, Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam
Round-Optimal Secure Multi-Party Computation. CRYPTO (2) (2018)
Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez
TinyKeys: A New Approach to Efficient Multi-Party Computation. CRYPTO (3) (2018)
Sebastian Faust, Carmit Hazay, Daniele Venturi
Outsourced pattern matching. Int. J. Inf. Sec. 17 (3) (2018)
Siddharth Garg, Zahra Ghodsi, Carmit Hazay, Yuval Ishai, Antonio Marcedone, Muthuramakrishnan Venkitasubramaniam
Outsourcing Private Machine Learning via Lightweight Secure Arithmetic Computation. CoRR (2018)
Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez
Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT). ASIACRYPT (3) (2018)
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations. TCC (1) (2018)
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations. IACR Cryptol. ePrint Arch. 2018 (2018)
Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez
Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT). IACR Cryptol. ePrint Arch. 2018 (2018)
Carmit Hazay
Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs. J. Cryptol. 31 (2) (2018)
Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez
TinyKeys: A New Approach to Efficient Multi-Party Computation. IACR Cryptol. ePrint Arch. 2018 (2018)
Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam
Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model. IACR Cryptol. ePrint Arch. 2017 (2017)
Carmit Hazay, Yuval Ishai, Muthuramakrishnan Venkitasubramaniam
Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model. IACR Cryptol. ePrint Arch. 2017 (2017)
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
Scalable Multi-party Private Set-Intersection. Public Key Cryptography (1) (2017)
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
Scalable Multi-Party Private Set-Intersection. IACR Cryptol. ePrint Arch. 2017 (2017)
Carmit Hazay, Arpita Patra
Efficient One-Sided Adaptively Secure Computation. J. Cryptol. 30 (1) (2017)
Scott Ames, Carmit Hazay, Yuval Ishai, Muthuramakrishnan Venkitasubramaniam
Ligero: Lightweight Sublinear Arguments Without a Trusted Setup. CCS (2017)
Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam
Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model. Public Key Cryptography (2) (2017)
Carmit Hazay, Peter Scholl, Eduardo Soria-Vazquez
Low Cost Constant Round MPC Combining BMR and Oblivious Transfer. ASIACRYPT (1) (2017)
Shai Halevi, Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam
Round-Optimal Secure Multi-Party Computation. IACR Cryptol. ePrint Arch. 2017 (2017)
Carmit Hazay, Yuval Ishai, Muthuramakrishnan Venkitasubramaniam
Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model. TCC (2) (2017)
Carmit Hazay, Peter Scholl, Eduardo Soria-Vazquez
Low Cost Constant Round MPC Combining BMR and Oblivious Transfer. IACR Cryptol. ePrint Arch. 2017 (2017)
Carmit Hazay, Adriana López-Alt, Hoeteck Wee, Daniel Wichs
Leakage-Resilient Cryptography from Minimal Assumptions. J. Cryptol. 29 (3) (2016)
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
On the Power of Secure Two-Party Computation. CRYPTO (2) (2016)
Gilad Asharov, Ran Canetti, Carmit Hazay
Toward a Game Theoretic View of Secure Computation. J. Cryptol. 29 (4) (2016)
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions. TCC (B1) (2016)

Carmit Hazay.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Carmit Hazay