Carmit Hazay

According to our database1, Carmit Hazay authored at least 53 papers between 2005 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

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

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

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

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

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

The Price of Active Security in Cryptographic Protocols.
IACR Cryptology ePrint Archive, 2019

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

LevioSA: Lightweight Secure Arithmetic Computation.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

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

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

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

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

TinyKeys: A New Approach to Efficient Multi-Party Computation.
IACR Cryptology ePrint Archive, 2018

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

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

Scalable Multi-Party Private Set-Intersection.
IACR Cryptology ePrint Archive, 2017

Low Cost Constant Round MPC Combining BMR and Oblivious Transfer.
IACR Cryptology ePrint Archive, 2017

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

Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model.
IACR Cryptology ePrint Archive, 2017

Round-Optimal Secure Multi-Party Computation.
IACR Cryptology ePrint Archive, 2017

Ligero: Lightweight Sublinear Arguments Without a Trusted Setup.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, TX, USA, October 30, 2017

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

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

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

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

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

Composable Adaptive Secure Protocols without Setup under Polytime Assumptions.
IACR Cryptology ePrint Archive, 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 Cryptology ePrint Archive, 2015

Selective Opening Security for Receivers.
IACR Cryptology ePrint Archive, 2015

Round-Optimal Token-Based Secure Computation.
IACR Cryptology ePrint Archive, 2015

Adaptively Secure Computation with Partial Erasures.
IACR Cryptology ePrint Archive, 2015

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

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

The Feasibility of Outsourced Database Search in the Plain Model.
IACR Cryptology ePrint Archive, 2014

2013
One-Sided Adaptively Secure Two-Party Computation.
IACR Cryptology ePrint Archive, 2013

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

Efficient Set Operations in the Presence of Malicious Adversaries.
J. Cryptology, 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 Cryptology ePrint Archive, 2011

Secure Two-Party Computation with Low Communication.
IACR Cryptology ePrint Archive, 2011

Towards a Game Theoretic View of Secure Computation.
IACR Cryptology ePrint Archive, 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. Cryptology, 2010

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

A Note on the Relation between the Definitions of Security for Semi-Honest and Malicious Adversaries.
IACR Cryptology ePrint Archive, 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 Cryptology ePrint Archive, 2009

Constructions of Truly Practical Secure Protocols using Standard Smartcards.
IACR Cryptology ePrint Archive, 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...