Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarmit Hazay
Person information
- affiliation: Bar-Ilan University, Ramat-Gan, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j27]Itamar Levi, Carmit Hazay:
Garbled Circuits from an SCA Perspective Free XOR can be Quite Expensive. . . IACR Trans. Cryptogr. Hardw. Embed. Syst. 2023(2): 54-79 (2023)- [c58]Anasuya Acharya, Tomer Ashur, Efrat Cohen, Carmit Hazay, Avishay Yanai:
A New Approach to Garbled Circuits. ACNS 2023: 611-641 - [c57]Sebastian Faust
, Carmit Hazay, David Kretzler, Benjamin Schlosser:
Putting the Online Phase on a Diet: Covert Security from Short MACs. CT-RSA 2023: 360-386 - [c56]Rishabh Bhadauria, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Wenxuan Wu, Yupeng Zhang:
Private Polynomial Commitments and Applications to MPC. Public Key Cryptography (2) 2023: 127-158 - [e5]Carmit Hazay, Martijn Stam:
Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part I. Lecture Notes in Computer Science 14004, Springer 2023, ISBN 978-3-031-30544-3 [contents] - [e4]Carmit Hazay, Martijn Stam:
Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part II. Lecture Notes in Computer Science 14005, Springer 2023, ISBN 978-3-031-30616-7 [contents] - [e3]Carmit Hazay, Martijn Stam:
Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part III. Lecture Notes in Computer Science 14006, Springer 2023, ISBN 978-3-031-30619-8 [contents] - [e2]Carmit Hazay, Martijn Stam:
Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part IV. Lecture Notes in Computer Science 14007, Springer 2023, ISBN 978-3-031-30633-4 [contents] - [e1]Carmit Hazay, Martijn Stam:
Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part V. Lecture Notes in Computer Science 14008, Springer 2023, ISBN 978-3-031-30588-7 [contents] - [i55]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: 52 (2023) - 2022
- [j26]Carmit Hazay, Mor Lilintal:
Gradual GRAM and secure computation for RAM programs. J. Comput. Secur. 30(1): 197-229 (2022) - [j25]Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez:
TinyKeys: A New Approach to Efficient Multi-Party Computation. J. Cryptol. 35(2): 13 (2022) - [j24]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss:
ZK-PCPs from Leakage-Resilient Secret Sharing. J. Cryptol. 35(4): 23 (2022) - [j23]S. Dov Gordon, Carmit Hazay, Phi Hung Le:
Fully Secure PSI via MPC-in-the-Head. Proc. Priv. Enhancing Technol. 2022(3): 291-313 (2022) - [c55]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss:
Protecting Distributed Primitives Against Leakage: Equivocal Secret Sharing and More. ITC 2022: 3:1-3:24 - [c54]Leo de Castro, Carmit Hazay, Yuval Ishai, Vinod Vaikuntanathan, Muthu Venkitasubramaniam:
Asymptotically Quasi-Optimal Cryptography. EUROCRYPT (1) 2022: 303-334 - [c53]Sebastian Faust, Carmit Hazay, David Kretzler, Benjamin Schlosser:
Financially Backed Covert Security. Public Key Cryptography (2) 2022: 99-129 - [c52]Gowri R. Chandran, Carmit Hazay, Robin Hundt, Thomas Schneider:
Comparison-based MPC in Star Topology. SECRYPT 2022: 69-82 - [c51]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: 417-446 - [c50]Anasuya Acharya, Carmit Hazay, Vladimir Kolesnikov, Manoj Prabhakaran:
SCALES - MPC with Small Clients and Larger Ephemeral Servers. TCC (2) 2022: 502-531 - [i54]S. Dov Gordon, Carmit Hazay, Phi Hung Le:
Fully Secure PSI via MPC-in-the-Head. IACR Cryptol. ePrint Arch. 2022: 379 (2022) - [i53]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss:
Protecting Distributed Primitives against Leakage: Equivocal Secret Sharing and More. IACR Cryptol. ePrint Arch. 2022: 497 (2022) - [i52]Gowri R. Chandran, Carmit Hazay, Robin Hundt, Thomas Schneider:
Comparison-Based MPC in Star Topology (Full Version). IACR Cryptol. ePrint Arch. 2022: 574 (2022) - [i51]S. Dov Gordon, Carmit Hazay, Phi Hung Le, Mingyu Liang:
More Efficient (Reusable) Private Set Union. IACR Cryptol. ePrint Arch. 2022: 713 (2022) - [i50]Anasuya Acharya, Carmit Hazay, Vladimir Kolesnikov, Manoj Prabhakaran:
SCALES: MPC with Small Clients and Larger Ephemeral Servers. IACR Cryptol. ePrint Arch. 2022: 751 (2022) - [i49]Itamar Levi, Carmit Hazay:
Garbled-Circuits from an SCA Perspective: Free XOR can be Quite Expensive. . . IACR Cryptol. ePrint Arch. 2022: 901 (2022) - [i48]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss:
Your Reputation's Safe with Me: Framing-Free Distributed Zero-Knowledge Proofs. IACR Cryptol. ePrint Arch. 2022: 1523 (2022) - [i47]Scott Ames, Carmit Hazay, Yuval Ishai, Muthuramakrishnan Venkitasubramaniam:
Ligero: Lightweight Sublinear Arguments Without a Trusted Setup. IACR Cryptol. ePrint Arch. 2022: 1608 (2022) - [i46]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: 1612 (2022) - 2021
- [j22]Shai Halevi, Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam:
Round-Optimal Secure Multi-party Computation. J. Cryptol. 34(3): 19 (2021) - [c49]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss:
ZK-PCPs from Leakage-Resilient Secret Sharing. ITC 2021: 6:1-6:21 - [c48]Sebastian Faust, Carmit Hazay, David Kretzler, Benjamin Schlosser:
Generic Compiler for Publicly Verifiable Covert Multi-Party Computation. EUROCRYPT (2) 2021: 782-811 - [c47]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: 590-607 - [i45]Sebastian Faust, Carmit Hazay, David Kretzler, Benjamin Schlosser:
Generic Compiler for Publicly Verifiable Covert Multi-Party Computation. IACR Cryptol. ePrint Arch. 2021: 251 (2021) - [i44]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss:
ZK-PCPs from Leakage-Resilient Secret Sharing. IACR Cryptol. ePrint Arch. 2021: 606 (2021) - [i43]Tomer Ashur, Efrat Cohen, Carmit Hazay, Avishay Yanai:
A New Framework for Garbled Circuits. IACR Cryptol. ePrint Arch. 2021: 739 (2021) - [i42]Sebastian Faust, Carmit Hazay, David Kretzler, Benjamin Schlosser:
Financially Backed Covert Security. IACR Cryptol. ePrint Arch. 2021: 1652 (2021) - 2020
- [j21]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam:
On the Power of Secure Two-Party Computation. J. Cryptol. 33(1): 271-318 (2020) - [j20]Carmit Hazay, Peter Scholl, Eduardo Soria-Vazquez:
Low Cost Constant Round MPC Combining BMR and Oblivious Transfer. J. Cryptol. 33(4): 1732-1786 (2020) - [c46]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: 1591-1605 - [c45]Rishabh Bhadauria, Zhiyong Fang, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Tiancheng Xie, Yupeng Zhang:
Ligero++: A New Optimized Sublinear IOP. CCS 2020: 2025-2038 - [c44]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss:
The Price of Active Security in Cryptographic Protocols. EUROCRYPT (2) 2020: 184-215 - [c43]Carmit Hazay, Rafael Pass, Muthuramakrishnan Venkitasubramaniam:
Which Languages Have 4-Round Fully Black-Box Zero-Knowledge Arguments from One-Way Functions? EUROCRYPT (3) 2020: 599-619 - [c42]Carmit Hazay, Abhi Shelat, Muthuramakrishnan Venkitasubramaniam:
Going Beyond Dual Execution: MPC for Functions with Efficient Verification. Public Key Cryptography (2) 2020: 328-356 - [c41]Rishabh Bhadauria, Carmit Hazay:
Multi-clients Verifiable Computation via Conditional Disclosure of Secrets. SCN 2020: 150-171 - [c40]Carmit Hazay, Mor Lilintal:
Gradual GRAM and Secure Computation for RAM Programs. SCN 2020: 233-252 - [i41]Carmit Hazay, Abhi Shelat, Muthuramakrishnan Venkitasubramaniam:
Going Beyond Dual Execution: MPC for Functions with Efficient Verification. IACR Cryptol. ePrint Arch. 2020: 139 (2020) - [i40]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: 374 (2020) - [i39]Carmit Hazay, Yuval Ishai, Antonio Marcedone, Muthuramakrishnan Venkitasubramaniam:
LevioSA: Lightweight Secure Arithmetic Computation. IACR Cryptol. ePrint Arch. 2020: 393 (2020)
2010 – 2019
- 2019
- [j19]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): 265-323 (2019) - [j18]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam:
On Black-Box Complexity of Universally Composable Security in the CRS Model. J. Cryptol. 32(3): 635-689 (2019) - [j17]Carmit Hazay, Avishay Yanai:
Constant-Round Maliciously Secure Two-Party Computation in the RAM Model. J. Cryptol. 32(4): 1144-1199 (2019) - [j16]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam:
What Security Can We Achieve Within 4 Rounds? J. Cryptol. 32(4): 1200-1262 (2019) - [c39]Carmit Hazay, Yuval Ishai, Antonio Marcedone, Muthuramakrishnan Venkitasubramaniam:
LevioSA: Lightweight Secure Arithmetic Computation. CCS 2019: 327-344 - [c38]Megha Byali, Carmit Hazay, Arpita Patra, Swati Singla:
Fast Actively Secure Five-Party Computation with Security Beyond Abort. CCS 2019: 1573-1590 - [i38]Megha Byali, Carmit Hazay, Arpita Patra, Swati Singla:
Fast Actively Secure Five-Party Computation with Security Beyond Abort. IACR Cryptol. ePrint Arch. 2019: 863 (2019) - [i37]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss:
The Price of Active Security in Cryptographic Protocols. IACR Cryptol. ePrint Arch. 2019: 1250 (2019) - 2018
- [j15]Sebastian Faust, Carmit Hazay, Daniele Venturi:
Outsourced pattern matching. Int. J. Inf. Sec. 17(3): 327-346 (2018) - [j14]Carmit Hazay:
Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs. J. Cryptol. 31(2): 537-586 (2018) - [c37]Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez:
Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT). ASIACRYPT (3) 2018: 86-117 - [c36]Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez:
TinyKeys: A New Approach to Efficient Multi-Party Computation. CRYPTO (3) 2018: 3-33 - [c35]Shai Halevi, Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam:
Round-Optimal Secure Multi-Party Computation. CRYPTO (2) 2018: 488-520 - [c34]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam:
Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations. TCC (1) 2018: 263-285 - [i36]Siddharth Garg, Zahra Ghodsi, Carmit Hazay, Yuval Ishai, Antonio Marcedone, Muthuramakrishnan Venkitasubramaniam:
Outsourcing Private Machine Learning via Lightweight Secure Arithmetic Computation. CoRR abs/1812.01372 (2018) - [i35]Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez:
TinyKeys: A New Approach to Efficient Multi-Party Computation. IACR Cryptol. ePrint Arch. 2018: 208 (2018) - [i34]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: 843 (2018) - [i33]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam:
Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations. IACR Cryptol. ePrint Arch. 2018: 912 (2018) - 2017
- [j13]Carmit Hazay, Arpita Patra:
Efficient One-Sided Adaptively Secure Computation. J. Cryptol. 30(1): 321-371 (2017) - [c33]Carmit Hazay, Peter Scholl, Eduardo Soria-Vazquez:
Low Cost Constant Round MPC Combining BMR and Oblivious Transfer. ASIACRYPT (1) 2017: 598-628 - [c32]Scott Ames, Carmit Hazay, Yuval Ishai, Muthuramakrishnan Venkitasubramaniam:
Ligero: Lightweight Sublinear Arguments Without a Trusted Setup. CCS 2017: 2087-2104 - [c31]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam:
Scalable Multi-party Private Set-Intersection. Public Key Cryptography (1) 2017: 175-203 - [c30]Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam:
Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model. Public Key Cryptography (2) 2017: 428-460 - [c29]Carmit Hazay, Yuval Ishai, Muthuramakrishnan Venkitasubramaniam:
Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model. TCC (2) 2017: 3-39 - [i32]Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam:
Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model. IACR Cryptol. ePrint Arch. 2017: 26 (2017) - [i31]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam:
Scalable Multi-Party Private Set-Intersection. IACR Cryptol. ePrint Arch. 2017: 27 (2017) - [i30]Carmit Hazay, Peter Scholl, Eduardo Soria-Vazquez:
Low Cost Constant Round MPC Combining BMR and Oblivious Transfer. IACR Cryptol. ePrint Arch. 2017: 214 (2017) - [i29]Carmit Hazay, Yuval Ishai, Muthuramakrishnan Venkitasubramaniam:
Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model. IACR Cryptol. ePrint Arch. 2017: 947 (2017) - [i28]Shai Halevi, Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam:
Round-Optimal Secure Multi-Party Computation. IACR Cryptol. ePrint Arch. 2017: 1056 (2017) - 2016
- [j12]Michael J. Freedman, Carmit Hazay, Kobbi Nissim, Benny Pinkas:
Efficient Set Intersection with Simulation-Based Security. J. Cryptol. 29(1): 115-155 (2016) - [j11]Rosario Gennaro, Carmit Hazay, Jeffrey S. Sorensen:
Automata Evaluation and Text Search Protocols with Simulation-Based Security. J. Cryptol. 29(2): 243-282 (2016) - [j10]Sebastian Faust, Carmit Hazay, Jesper Buus Nielsen, Peter Sebastian Nordholt, Angela Zottarel:
Signature Schemes Secure Against Hard-to-Invert Leakage. J. Cryptol. 29(2): 422-455 (2016) - [j9]Carmit Hazay, Adriana López-Alt, Hoeteck Wee, Daniel Wichs:
Leakage-Resilient Cryptography from Minimal Assumptions. J. Cryptol. 29(3): 514-551 (2016) - [j8]Gilad Asharov, Ran Canetti, Carmit Hazay:
Toward a Game Theoretic View of Secure Computation. J. Cryptol. 29(4): 879-926 (2016) - [c28]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam:
On the Power of Secure Two-Party Computation. CRYPTO (2) 2016: 397-429 - [c27]Carmit Hazay, Hila Zarosim:
The Feasibility of Outsourced Database Search in the Plain Model. SCN 2016: 313-332 - [c26]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam:
What Security Can We Achieve Within 4 Rounds? SCN 2016: 486-505 - [c25]Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam:
Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity. TCC (B1) 2016: 367-399 - [c24]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam:
Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions. TCC (B1) 2016: 400-432 - [c23]Carmit Hazay, Avishay Yanai:
Constant-Round Maliciously Secure Two-Party Computation in the RAM Model. TCC (B1) 2016: 521-553 - [i27]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam:
On the Power of Secure Two-Party Computation. IACR Cryptol. ePrint Arch. 2016: 74 (2016) - [i26]Carmit Hazay, Avishay Yanai:
Constant-Round Maliciously Secure Two-Party Computation in the RAM Model. IACR Cryptol. ePrint Arch. 2016: 805 (2016) - [i25]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam:
Composable Adaptive Secure Protocols without Setup under Polytime Assumptions. IACR Cryptol. ePrint Arch. 2016: 818 (2016) - 2015
- [c22]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam:
On Black-Box Complexity of Universally Composable Security in the CRS Model. ASIACRYPT (2) 2015: 183-209 - [c21]Carmit Hazay, Arpita Patra, Bogdan Warinschi:
Selective Opening Security for Receivers. ASIACRYPT (1) 2015: 443-469 - [c20]Carmit Hazay, Yehuda Lindell, Arpita Patra:
Adaptively Secure Computation with Partial Erasures. PODC 2015: 291-300 - [c19]Carmit Hazay:
Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs. TCC (2) 2015: 90-120 - [i24]Carmit Hazay:
Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs. IACR Cryptol. ePrint Arch. 2015: 4 (2015) - [i23]Carmit Hazay, Yehuda Lindell, Arpita Patra:
Adaptively Secure Computation with Partial Erasures. IACR Cryptol. ePrint Arch. 2015: 450 (2015) - [i22]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam:
On Black-Box Complexity of Universally Composable Security in the CRS model. IACR Cryptol. ePrint Arch. 2015: 488 (2015) - [i21]Carmit Hazay, Muthuramakrishnan Venkitasubramaniam:
What Security can we Achieve in 4-Rounds? IACR Cryptol. ePrint Arch. 2015: 797 (2015) - [i20]Carmit Hazay, Arpita Patra, Bogdan Warinschi:
Selective Opening Security for Receivers. IACR Cryptol. ePrint Arch. 2015: 860 (2015) - [i19]Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam:
Round-Optimal Token-Based Secure Computation. IACR Cryptol. ePrint Arch. 2015: 887 (2015) - 2014
- [j7]Carmit Hazay, Tomas Toft:
Computationally Secure Pattern Matching in the Presence of Malicious Adversaries. J. Cryptol. 27(2): 358-395 (2014) - [j6]Richard Cole, Carmit Hazay, Moshe Lewenstein, Dekel Tsur:
Two-Dimensional Parameterized Matching. ACM Trans. Algorithms 11(2): 12:1-12:30 (2014) - [c18]Carmit Hazay, Arpita Patra:
One-Sided Adaptively Secure Two-Party Computation. TCC 2014: 368-393 - [i18]Sebastian Faust, Carmit Hazay, Daniele Venturi:
Outsourced Pattern Matching. IACR Cryptol. ePrint Arch. 2014: 662 (2014) - [i17]Carmit Hazay, Hila Zarosim:
The Feasibility of Outsourced Database Search in the Plain Model. IACR Cryptol. ePrint Arch. 2014: 706 (2014) - 2013
- [c17]Carmit Hazay, Adriana López-Alt, Hoeteck Wee, Daniel Wichs:
Leakage-Resilient Cryptography from Minimal Assumptions. EUROCRYPT 2013: 160-176 - [c16]Sebastian Faust, Carmit Hazay, Daniele Venturi:
Outsourced Pattern Matching. ICALP (2) 2013: 545-556 - [i16]Carmit Hazay, Arpita Patra:
One-Sided Adaptively Secure Two-Party Computation. IACR Cryptol. ePrint Arch. 2013: 593 (2013) - 2012
- [j5]Carmit Hazay, Kobbi Nissim:
Efficient Set Operations in the Presence of Malicious Adversaries. J. Cryptol. 25(3): 383-433 (2012) - [j4]Demijan Klinc, Carmit Hazay, Ashish Jagmohan, Hugo Krawczyk, Tal Rabin:
On Compression of Data Encrypted With Block Ciphers. IEEE Trans. Inf. Theory 58(11): 6989-7001 (2012) - [c15]Sebastian Faust, Carmit Hazay, Jesper Buus Nielsen, Peter Sebastian Nordholt, Angela Zottarel:
Signature Schemes Secure against Hard-to-Invert Leakage. ASIACRYPT 2012: 98-115 - [c14]Carmit Hazay, Gert Læssøe Mikkelsen, Tal Rabin, Tomas Toft:
Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting. CT-RSA 2012: 313-331 - [c13]Adi Akavia, Shafi Goldwasser, Carmit Hazay:
Distributed public key schemes secure against continual leakage. PODC 2012: 155-164 - [c12]Ivan Damgård, Sebastian Faust, Carmit Hazay:
Secure Two-Party Computation with Low Communication. TCC 2012: 54-74 - [i15]Sebastian Faust, Carmit Hazay, Jesper Buus Nielsen, Peter Sebastian Nordholt, Angela Zottarel:
Signature Schemes Secure against Hard-to-Invert Leakage. IACR Cryptol. ePrint Arch. 2012: 45 (2012) - [i14]Carmit Hazay, Adriana López-Alt, Hoeteck Wee, Daniel Wichs:
Leakage-Resilient Cryptography from Minimal Assumptions. IACR Cryptol. ePrint Arch. 2012: 604 (2012) - 2011
- [j3]S. Dov Gordon, Carmit Hazay, Jonathan Katz, Yehuda Lindell:
Complete Fairness in Secure Two-Party Computation. J. ACM 58(6): 24:1-24:37 (2011) - [c11]Gilad Asharov, Ran Canetti, Carmit Hazay:
Towards a Game Theoretic View of Secure Computation. EUROCRYPT 2011: 426-445 - [i13]Gilad Asharov, Ran Canetti, Carmit Hazay:
Towards a Game Theoretic View of Secure Computation. IACR Cryptol. ePrint Arch. 2011: 137 (2011) - [i12]Carmit Hazay, Gert Læssøe Mikkelsen, Tal Rabin, Tomas Toft:
Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting. IACR Cryptol. ePrint Arch. 2011: 494 (2011) - [i11]Ivan Damgård, Sebastian Faust, Carmit Hazay:
Secure Two-Party Computation with Low Communication. IACR Cryptol. ePrint Arch. 2011: 508 (2011) - 2010
- [b1]Carmit Hazay, Yehuda Lindell:
Efficient Secure Two-Party Protocols - Techniques and Constructions. Information Security and Cryptography, Springer 2010, ISBN 978-3-642-14302-1, pp. 3-254 - [j2]Carmit Hazay, Yehuda Lindell:
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. J. Cryptol. 23(3): 422-456 (2010) - [c10]Carmit Hazay, Tomas Toft:
Computationally Secure Pattern Matching in the Presence of Malicious Adversaries. ASIACRYPT 2010: 195-212 - [c9]