Carmit Hazay

发表

Low Cost Constant Round MPC Combining BMR and Oblivious Transfer

Peter Scholl, Eduardo Soria-Vazquez, Carmit Hazay, 2017, Journal of Cryptology.

Constant-Round Maliciously Secure Two-Party Computation in the RAM Model

Carmit Hazay, Avishay Yanai, 2016, IACR Cryptol. ePrint Arch..

Low Cost Constant Round MPC Combining BMR and Oblivious Transfer

Eduardo Soria-Vazquez, Carmit Hazay, Peter Scholl, 2020, Journal of Cryptology.

On the Power of Secure Two-Party Computation

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Muthuramakrishnan Venkitasubramaniam, 2016, Journal of Cryptology.

The Feasibility of Outsourced Database Search in the Plain Model

Carmit Hazay, Hila Zarosim, 2016, SCN.

Scalable Multi-party Private Set-Intersection

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Muthuramakrishnan Venkitasubramaniam, 2017, Public Key Cryptography.

Ligero++: A New Optimized Sublinear IOP

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Rishabh Bhadauria, 2020, CCS.

LevioSA: Lightweight Secure Arithmetic Computation

Yuval Ishai, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, 2019, CCS.

Efficient Set Operations in the Presence of Malicious Adversaries

Carmit Hazay, Kobbi Nissim, Kobbi Nissim, 2010, Journal of Cryptology.

Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries

Yehuda Lindell, Carmit Hazay, 2008, TCC.

TinyKeys: A New Approach to Efficient Multi-Party Computation

Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez, 2018, IACR Cryptol. ePrint Arch..

Adaptively Secure Computation with Partial Erasures

Yehuda Lindell, Carmit Hazay, Arpita Patra, 2015, IACR Cryptol. ePrint Arch..

On Compression of Data Encrypted With Block Ciphers

Hugo Krawczyk, Carmit Hazay, Tal Rabin, 2012, IEEE Transactions on Information Theory.

Going Beyond Dual Execution: MPC for Functions with Efficient Verification

Abhi Shelat, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, 2020, IACR Cryptol. ePrint Arch..

Signature Schemes Secure Against Hard-to-Invert Leakage

Carmit Hazay, Sebastian Faust, Jesper Buus Nielsen, 2015, Journal of Cryptology.

Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, 2016, TCC.

Multi-clients Verifiable Computation via Conditional Disclosure of Secrets

Carmit Hazay, Rishabh Bhadauria, 2020, SCN.

Gradual GRAM and Secure Computation for RAM Programs

Carmit Hazay, Mor Lilintal, 2020, SCN.

Round-Optimal Token-Based Secure Computation

Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam, 2015, IACR Cryptol. ePrint Arch..

Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions

Yehuda Lindell, Jonathan Katz, Carmit Hazay, 2007, TCC.

Text Search Protocols with Simulation Based Security

Carmit Hazay, Rosario Gennaro, Jeffrey S. Sorensen, 2010, Public Key Cryptography.

On Black-Box Complexity of Universally Composable Security in the CRS Model

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Muthuramakrishnan Venkitasubramaniam, 2015, Journal of Cryptology.

Outsourcing Private Machine Learning via Lightweight Secure Arithmetic Computation pdf

Yuval Ishai, Carmit Hazay, Zahra Ghodsi, 2018, ArXiv.

Two Dimensional Parameterized Matching

Moshe Lewenstein, Carmit Hazay, Dekel Tsur, 2005, CPM.

Approximate Parameterized Matching

Moshe Lewenstein, Carmit Hazay, Dina Sokol, 2004, ESA.

Efficient One-Sided Adaptively Secure Computation

Carmit Hazay, Arpita Patra, Carmit Hazay, 2015, Journal of Cryptology.

Complete Fairness in Secure Two-Party Computation

Yehuda Lindell, Jonathan Katz, Carmit Hazay, 2011, JACM.

What Security can we Achieve in 4-Rounds?

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Muthuramakrishnan Venkitasubramaniam, 2015, IACR Cryptol. ePrint Arch..

On Compression of Data Encrypted with Block Ciphers

Hugo Krawczyk, Carmit Hazay, Tal Rabin, 2009, DCC.

The Price of Active Security in Cryptographic Protocols

Carmit Hazay, Mor Weiss, Muthuramakrishnan Venkitasubramaniam, 2020, IACR Cryptol. ePrint Arch..

Leakage Resilient Secure Two-Party Computation

Ivan Damgård, Carmit Hazay, Arpita Patra, 2011, IACR Cryptol. ePrint Arch..

A Note on Zero-Knowledge Proofs of Knowledge and the ZKPOK Ideal Functionality

Yehuda Lindell, Carmit Hazay, 2010, IACR Cryptol. ePrint Arch..

Round-Optimal Secure Multi-party Computation

Carmit Hazay, Shai Halevi, Antigoni Polychroniadou, 2018, Journal of Cryptology.

Efficient Oblivious Polynomial Evaluation with Simulation-Based Security

Yehuda Lindell, Carmit Hazay, Yehuda Lindell, 2009, IACR Cryptol. ePrint Arch..

Two-Dimensional Parameterized Matching

Moshe Lewenstein, Richard Cole, Carmit Hazay, 2014, ACM Trans. Algorithms.

Efficient Secure Two-Party Protocols: Techniques and Constructions

Yehuda Lindell, Carmit Hazay, Yehuda Lindell, 2010 .

Computationally Secure Pattern Matching in the Presence of Malicious Adversaries

Carmit Hazay, Tomas Toft, Carmit Hazay, 2010, Journal of Cryptology.

Diogenes: Lightweight Scalable RSA Modulus Generation with a Dishonest Majority

Abhi Shelat, Yuval Ishai, Carmit Hazay, 2021, 2021 IEEE Symposium on Security and Privacy (SP).

Distributed public key schemes secure against continual leakage

Carmit Hazay, Shafi Goldwasser, Adi Akavia, 2012, PODC '12.

Ligero: Lightweight Sublinear Arguments Without a Trusted Setup

Yuval Ishai, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, 2017, Designs, Codes and Cryptography.

Semi-honest Adversaries

Yehuda Lindell, Carmit Hazay, 2010 .

What Security Can We Achieve Within 4 Rounds?

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, 2016, SCN.

Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Muthuramakrishnan Venkitasubramaniam, 2018, IACR Cryptol. ePrint Arch..

On the Power of Secure Two-Party Computation

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, 2019, Journal of Cryptology.

Oblivious Transfer and Applications

Yehuda Lindell, Carmit Hazay, Yehuda Lindell, 2010 .

Sigma Protocols and Efficient Zero-Knowledge1

Yehuda Lindell, Carmit Hazay, Yehuda Lindell, 2010 .

Is the Classical GMW Paradigm Practical? The Case of Non-Interactive Actively Secure 2PC

Yuval Ishai, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, 2020, CCS.

Toward a Game Theoretic View of Secure Computation

Ran Canetti, Carmit Hazay, Gilad Asharov, 2011, Journal of Cryptology.

Efficient Set Operations in the Presence of Malicious Adversaries

Carmit Hazay, Kobbi Nissim, 2010, Public Key Cryptography.

Efficient Set Intersection with Simulation-Based Security

Benny Pinkas, Carmit Hazay, Michael J. Freedman, 2014, Journal of Cryptology.

Efficient Secure Two-Party Protocols

Yehuda Lindell, Carmit Hazay, Yehuda Lindell, 2010, Information Security and Cryptography.

On Black-Box Complexity of Universally Composable Security in the CRS Model

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, 2015, ASIACRYPT.

Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs

Carmit Hazay, 2015, TCC.

Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT)

Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez, 2018, IACR Cryptol. ePrint Arch..

Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries

Yehuda Lindell, Carmit Hazay, Yehuda Lindell, 2008, Journal of Cryptology.

Outsourced Pattern Matching

Carmit Hazay, Daniele Venturi, Sebastian Faust, 2013, ICALP.

Automata Evaluation and Text Search Protocols with Simulation-Based Security

Carmit Hazay, Rosario Gennaro, Jeffrey S. Sorensen, 2014, Journal of Cryptology.

A Note on the Relation between the Definitions of Security for Semi-Honest and Malicious Adversaries

Yehuda Lindell, Carmit Hazay, 2010, IACR Cryptol. ePrint Arch..

Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs

Carmit Hazay, Carmit Hazay, 2015, Journal of Cryptology.

Towards a Game Theoretic View of Secure Computation

Ran Canetti, Carmit Hazay, Gilad Asharov, 2011 .

What Security Can We Achieve Within 4 Rounds?

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Muthuramakrishnan Venkitasubramaniam, 2016, Journal of Cryptology.

Computationally Secure Pattern Matching in the Presence of Malicious Adversaries

Carmit Hazay, Tomas Toft, 2010, ASIACRYPT.

Leakage-Resilient Cryptography from Minimal Assumptions

Carmit Hazay, Hoeteck Wee, Daniel Wichs, 2013, EUROCRYPT.

Constructions of truly practical secure protocols using standardsmartcards

Yehuda Lindell, Carmit Hazay, Yehuda Lindell, 2008, CCS.

Outsourced pattern matching

Carmit Hazay, Daniele Venturi, Sebastian Faust, 2017, International Journal of Information Security.

One-Sided Adaptively Secure Two-Party Computation

Carmit Hazay, Arpita Patra, Carmit Hazay, 2014, TCC.

Constant-Round Maliciously Secure Two-Party Computation in the RAM Model

Carmit Hazay, Avishay Yanai, 2019, Journal of Cryptology.

Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity

Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam, 2016, TCC.

Secure Two-Party Computation with Low Communication

Ivan Damgård, Carmit Hazay, Sebastian Faust, 2012, IACR Cryptol. ePrint Arch..

Leakage-Resilient Cryptography from Minimal Assumptions

Carmit Hazay, Hoeteck Wee, Daniel Wichs, 2015, Journal of Cryptology.

The k th-Ranked Element

Yehuda Lindell, Carmit Hazay, 2010 .

Which Languages Have 4-Round Fully Black-Box Zero-Knowledge Arguments from One-Way Functions?

Carmit Hazay, Rafael Pass, Muthuramakrishnan Venkitasubramaniam, 2020, EUROCRYPT.

Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting

Carmit Hazay, Tal Rabin, Tomas Toft, 2017, Journal of Cryptology.

Selective Opening Security for Receivers

Carmit Hazay, Bogdan Warinschi, Arpita Patra, 2015, ASIACRYPT.

Fast Actively Secure Five-Party Computation with Security Beyond Abort

Carmit Hazay, Arpita Patra, Megha Byali, 2019, IACR Cryptol. ePrint Arch..

Approximate parameterized matching

Moshe Lewenstein, Carmit Hazay, Dina Sokol, 2007, TALG.

Signature Schemes Secure against Hard-to-Invert Leakage

Carmit Hazay, Sebastian Faust, Jesper Buus Nielsen, 2012, ASIACRYPT.

Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model

Yuval Ishai, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, 2017, Journal of Cryptology.

Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model

Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam, 2017, Public Key Cryptography.

A New Framework for Garbled Circuits

Carmit Hazay, Avishay Yanai, Tomer Ashur, 2021, IACR Cryptol. ePrint Arch..

Generic Compiler for Publicly Verifiable Covert Multi-Party Computation

Carmit Hazay, Sebastian Faust, Benjamin Schlosser, 2021, IACR Cryptol. ePrint Arch..

Round-Optimal Secure Multi-party Computation

Carmit Hazay, Shai Halevi, Antigoni Polychroniadou, 2018, Journal of Cryptology.

Financially Backed Covert Security

Carmit Hazay, Sebastian Faust, Benjamin Schlosser, 2021, IACR Cryptol. ePrint Arch..

ZK-PCPs from Leakage-Resilient Secret Sharing

Carmit Hazay, Mor Weiss, Muthuramakrishnan Venkitasubramaniam, 2022, Journal of Cryptology.

Composable Security in the Tamper Proof Model under Minimal Complexity

Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam, 2016 .

On the Generic Hardness of DDH-II

Carmit Hazay, Ivan Damg̊ard, Angela Zottarel, 2012 .