Carmit Hazay

Orcid: 0000-0002-8951-5099

Affiliations:
  • Bar-Ilan University, Ramat-Gan, Israel


According to our database1, Carmit Hazay authored at least 87 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Toward Malicious Constant-Rate 2PC via Arithmetic Garbling.
IACR Cryptol. ePrint Arch., 2024

On the Feasibility of Sliced Garbling.
IACR Cryptol. ePrint Arch., 2024

Malicious Security for SCALES: Outsourced Computation with Ephemeral Servers.
IACR Cryptol. ePrint Arch., 2024

2023
Ligero: lightweight sublinear arguments without a trusted setup.
Des. Codes Cryptogr., November, 2023

Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model.
J. Cryptol., July, 2023

Garbled Circuits from an SCA Perspective Free XOR can be Quite Expensive. . .
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2023

Batchman and Robin: Batched and Non-batched Branching for Interactive ZK.
IACR Cryptol. ePrint Arch., 2023

Beyond MPC-in-the-Head: Black-Box Constructions of Short Zero-Knowledge Proofs.
IACR Cryptol. ePrint Arch., 2023

Threshold BBS+ From Pseudorandom Correlations.
IACR Cryptol. ePrint Arch., 2023

Statement-Oblivious Threshold Witness Encryption.
IACR Cryptol. ePrint Arch., 2023

Putting the Online Phase on a Diet: Covert Security from Short MACs.
IACR Cryptol. ePrint Arch., 2023

Private Polynomial Commitments and Applications to MPC.
IACR Cryptol. ePrint Arch., 2023

Best of Both Worlds: Revisiting the Spymasters Double Agent Problem.
IACR Cryptol. ePrint Arch., 2023

Towards Optimal Communication Byzantine Reliable Broadcast under a Message Adversary.
CoRR, 2023

Flag: A Framework for Lightweight Robust Secure Aggregation.
Proceedings of the 2023 ACM Asia Conference on Computer and Communications Security, 2023

A New Approach to Garbled Circuits.
Proceedings of the Applied Cryptography and Network Security, 2023

2022
Fully Secure PSI via MPC-in-the-Head.
Proc. Priv. Enhancing Technol., 2022

ZK-PCPs from Leakage-Resilient Secret Sharing.
J. Cryptol., 2022

TinyKeys: A New Approach to Efficient Multi-Party Computation.
J. Cryptol., 2022

Gradual GRAM and secure computation for RAM programs.
J. Comput. Secur., 2022

Your Reputation's Safe with Me: Framing-Free Distributed Zero-Knowledge Proofs.
IACR Cryptol. ePrint Arch., 2022

Protecting Distributed Primitives against Leakage: Equivocal Secret Sharing and More.
IACR Cryptol. ePrint Arch., 2022

More Efficient (Reusable) Private Set Union.
IACR Cryptol. ePrint Arch., 2022

Comparison-Based MPC in Star Topology (Full Version).
IACR Cryptol. ePrint Arch., 2022

On Black-Box Constructions of Time and Space Efficient Sublinear Arguments from Symmetric-Key Primitives.
IACR Cryptol. ePrint Arch., 2022

SCALES: MPC with Small Clients and Larger Ephemeral Servers.
IACR Cryptol. ePrint Arch., 2022

Comparison-based MPC in Star Topology.
Proceedings of the 19th International Conference on Security and Cryptography, 2022

Asymptotically Quasi-Optimal Cryptography.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

2021
Round-Optimal Secure Multi-party Computation.
J. Cryptol., 2021

Financially Backed Covert Security.
IACR Cryptol. ePrint Arch., 2021

Generic Compiler for Publicly Verifiable Covert Multi-Party Computation.
IACR Cryptol. ePrint Arch., 2021

A New Framework for Garbled Circuits.
IACR Cryptol. ePrint Arch., 2021

2020
On the Power of Secure Two-Party Computation.
J. Cryptol., 2020

Low Cost Constant Round MPC Combining BMR and Oblivious Transfer.
J. Cryptol., 2020

Going Beyond Dual Execution: MPC for Functions with Efficient Verification.
IACR Cryptol. ePrint Arch., 2020

LevioSA: Lightweight Secure Arithmetic Computation.
IACR Cryptol. ePrint Arch., 2020

Diogenes: Lightweight Scalable RSA Modulus Generation with a Dishonest Majority.
IACR Cryptol. ePrint Arch., 2020

Multi-clients Verifiable Computation via Conditional Disclosure of Secrets.
Proceedings of the Security and Cryptography for Networks - 12th International Conference, 2020

Which Languages Have 4-Round Fully Black-Box Zero-Knowledge Arguments from One-Way Functions?
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Ligero++: A New Optimized Sublinear IOP.
Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

Is the Classical GMW Paradigm Practical? The Case of Non-Interactive Actively Secure 2PC.
Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

2019
Constant-Round Maliciously Secure Two-Party Computation in the RAM Model.
J. Cryptol., 2019

What Security Can We Achieve Within 4 Rounds?
J. Cryptol., 2019

On Black-Box Complexity of Universally Composable Security in the CRS Model.
J. Cryptol., 2019

Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting.
J. Cryptol., 2019

The Price of Active Security in Cryptographic Protocols.
IACR Cryptol. ePrint Arch., 2019

Fast Actively Secure Five-Party Computation with Security Beyond Abort.
IACR Cryptol. ePrint Arch., 2019

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

Outsourced pattern matching.
Int. J. Inf. Sec., 2018

Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations.
IACR Cryptol. ePrint Arch., 2018

Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT).
IACR Cryptol. ePrint Arch., 2018

Outsourcing Private Machine Learning via Lightweight Secure Arithmetic Computation.
CoRR, 2018

2017
Efficient One-Sided Adaptively Secure Computation.
J. Cryptol., 2017

Scalable Multi-Party Private Set-Intersection.
IACR Cryptol. ePrint Arch., 2017

Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model.
IACR Cryptol. ePrint Arch., 2017

2016
Leakage-Resilient Cryptography from Minimal Assumptions.
J. Cryptol., 2016

Automata Evaluation and Text Search Protocols with Simulation-Based Security.
J. Cryptol., 2016

Efficient Set Intersection with Simulation-Based Security.
J. Cryptol., 2016

Signature Schemes Secure Against Hard-to-Invert Leakage.
J. Cryptol., 2016

Toward a Game Theoretic View of Secure Computation.
J. Cryptol., 2016

Composable Adaptive Secure Protocols without Setup under Polytime Assumptions.
IACR Cryptol. ePrint Arch., 2016

Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016

2015
What Security can we Achieve in 4-Rounds?
IACR Cryptol. ePrint Arch., 2015

Selective Opening Security for Receivers.
IACR Cryptol. ePrint Arch., 2015

Round-Optimal Token-Based Secure Computation.
IACR Cryptol. ePrint Arch., 2015

Adaptively Secure Computation with Partial Erasures.
IACR Cryptol. ePrint Arch., 2015

2014
Two-Dimensional Parameterized Matching.
ACM Trans. Algorithms, 2014

Computationally Secure Pattern Matching in the Presence of Malicious Adversaries.
J. Cryptol., 2014

The Feasibility of Outsourced Database Search in the Plain Model.
IACR Cryptol. ePrint Arch., 2014

2013
One-Sided Adaptively Secure Two-Party Computation.
IACR Cryptol. ePrint Arch., 2013

2012
On Compression of Data Encrypted With Block Ciphers.
IEEE Trans. Inf. Theory, 2012

Efficient Set Operations in the Presence of Malicious Adversaries.
J. Cryptol., 2012

Distributed public key schemes secure against continual leakage.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

2011
Complete Fairness in Secure Two-Party Computation.
J. ACM, 2011

Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting.
IACR Cryptol. ePrint Arch., 2011

Secure Two-Party Computation with Low Communication.
IACR Cryptol. ePrint Arch., 2011

Towards a Game Theoretic View of Secure Computation.
IACR Cryptol. ePrint Arch., 2011

2010
Efficient Secure Two-Party Protocols - Techniques and Constructions
Information Security and Cryptography, Springer, ISBN: 978-3-642-14302-1, 2010

Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries.
J. Cryptol., 2010

A Note on Zero-Knowledge Proofs of Knowledge and the ZKPOK Ideal Functionality.
IACR Cryptol. ePrint Arch., 2010

A Note on the Relation between the Definitions of Security for Semi-Honest and Malicious Adversaries.
IACR Cryptol. ePrint Arch., 2010

Text Search Protocols with Simulation Based Security.
Proceedings of the Public Key Cryptography, 2010

2009
Efficient Oblivious Polynomial Evaluation with Simulation-Based Security.
IACR Cryptol. ePrint Arch., 2009

Constructions of Truly Practical Secure Protocols using Standard Smartcards.
IACR Cryptol. ePrint Arch., 2009

2007
Approximate parameterized matching.
ACM Trans. Algorithms, 2007

Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions.
Proceedings of the Theory of Cryptography, 4th Theory of Cryptography Conference, 2007

2005
Two Dimensional Parameterized Matching.
Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005


  Loading...