Publications

Books:

Journal Publications:

  1. C. Hazay, G. L. Mikkelsen, T. Rabin, T. Toft and A. A. Nicolosi. Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting. To appear in the Journal of Cryptology.
  2. C. Hazay. Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs. In the Journal of Cryptology 31(2): 537-586 (2018).
  3. S. Faust, C. Hazay and D. Venturi. Outsourced Pattern Matching. In the International Journal of Information Security 17(3): 327-346 (2018).
  4. C. Hazay and A. Patra. One-Sided Adaptively Secure Two-Party Computation. In the Journal of Cryptology 30(1): 321-371 (2017).
  5. G. Asharov, R. Canetti and C. Hazay. Towards a Game Theoretic View of Secure Computation. In the Journal of Cryptology 29(4): 879-926 (2016).
  6. S. Faust, C. Hazay, J. B. Nielsen, P. S. Nordholt and A. Zottarel. Signature Schemes Secure against Hard-to-Invert Leakage. In the Journal of Cryptology 29(2): 422-455 (2016).
  7. C. Hazay, A. Lopez-Alt, H. Wee and D. Wichs. Leakage-Resilient Cryptography from Minimal Assumptions. In the Journal of Cryptology 29(3): 514-551 (2016).
  8. M. J. Freedman, C. Hazay, K. Nissim and B. Pinkas.  Efficient Set Intersection with Simulation-Based Security. In the Journal of Cryptology 29(1): 115-155 (2016).
  9. R. Cole, C. Hazay, M. Lewenstein and D. Tsur. Two Dimensional Parameterized Matching. In ACM Transactions on Algorithms 11(2): 12:1-12:30 (2014).
  10. R. Gennaro, C. Hazay and J. Sorensen. Automata Evaluation and Text Search Protocols with Simulation Based Security. In the Journal of Cryptology 29(2): 243-282 (2016).
  11. C. Hazay and T. Toft. Computationally Secure Pattern Matching in the Presence of Malicious Adversaries. In the Journal of Cryptology 27(2): 358-395 (2014).
  12. D. Klinc, C. Hazay, A. Jagmohan, H. Krawczyk and T. Rabin. On Compressing Data Encrypted with Block Ciphers. In IEEE Transactions on Information Theory 58(11): 6989-7001 (2012).
  13. D. Gordon, C. Hazay, J. Katz and Y. Lindell. Complete Fairness in Secure Two-Party Computation. In the Journal of ACM 58(6): 24 (2011).
  14. C. Hazay and K. Nissim. Efficient Set Operations in the Presence of Malicious Adversaries. In the Journal of Cryptology 25(3): 383-433 (2012).
  15. C. Hazay and Y. Lindell. Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. In the Journal of Cryptology 23(3): 422-456, 2010.
  16. C. Hazay, M. Lewenstein and D. Sokol. Approximate Parameterized Matching. In ACM Transactions on Algorithms 3(3): 15, 2007.

Conference Publications:

  1. C. Hazay and M. Venkitasubramaniam. Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations. In TCC 2018.
  2. C. Hazay, E. Orsini, P. Scholl and E. Soria-Vazquez. Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT). In ASIACRYPT, 2018.
  3. S. Halevi, C. Hazay, A. Polychroniadou and M. Venkitasubramaniam. Round-Optimal Secure Multi-Party Computation. In CRYPTO, Springer-Verlag (LNCS 10993), pages 488-520, 2018.
  4. C. Hazay, E. Orsini, P. Scholl and E. Soria-Vazquez. Efficient MPC from Syndrome Decoding. In CRYPTO, Springer-Verlag (LNCS 10993), pages 3-33, 2018.
  5. C. Hazay, Y. Ishai, M. Venkitasubramaniam. Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model. In the Theory of Cryptography Conference (TCC), Springer-Verlag (LNCS 10678), pages 3-39, 2017.
  6. C. Hazay, P. Scholl and E. Soria-Vazquez. Low Cost Constant Round MPC Combining BMR and Oblivious Transfer. In ASIACRYPT, Springer-Verlag (LNCS 10624), pages 598-628, 2017.
  7. S. Ames, C. Hazay, Y. Ishai, M. Venkitasubramaniam. Ligero: Lightweight Sublinear Arguments Without a Trusted Setup. In the ACM Conference on Computer and Communications Security (ACM CCS), pages 2087-2104 2017.
  8. C. Hazay A. Polychroniadou and M. Venkitasubramaniam. Constant-Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model. In Public Key Cryptography (PKC), Springer-Verlag (LNCS 10175), pages 428-460, 2017.
  9. C. Hazay and M. Venkitasubramaniam. Scalable Multi-Party Private Set-Intersection. In Public Key Cryptography (PKC), Springer-Verlag (LNCS 10174), pages 175-203, 2017.
  10. C. Hazay and A. Yanay. Constant-Round Maliciously Secure Two-Party Computation in the RAM Model. In the Theory of Cryptography Conference (TCC-B), Springer-Verlag (LNCS 9985), pages 521-553, 2016.
  11. C. Hazay and M. Venkitasubramaniam. Composable Adaptive Secure Protocols without Setup under Polytime Assumptions. In the Theory of Cryptography Conference (TCC-B), Springer-Verlag (LNCS 9985), pages 400-432, 2016.
  12. C. Hazay, A. Polychroniadou and M. Venkitasubramaniam. Composable Security in the Tamper-Proof Hardware Model under Minimal Complexity. In the Theory of Cryptography Conference (TCC-B), Springer-Verlag (LNCS 9985), pages 367-399, 2016.
  13. C. Hazay and M. Venkitasubramaniam. What Security Can We Achieve within 4 Rounds? In SCN, pages 486-505, 2016.
  14. C. Hazay and H. Zarosim. The Feasibility of Outsourced Database Search in the Plain Model. In SCN, pages 313-332, 2016.
  15. C. Hazay and M. Venkitasubramaniam. On the Power of Secure Two-Party Computation. In CRYPTO, Springer-Verlag (LNCS 9815), pages 397-429, 2016.
  16. C. Hazay, A. Patra and B. Warinschi. Selective Opening Security for Receivers. In ASIACRYPT, Springer-Verlag (LNCS 9453), pages 443-469, 2015.
  17. C. Hazay and M. Venkitasubramaniam. On Black-Box Complexity of Universally Composable Security in the CRS model. In ASIACRYPT, Springer-Verlag (LNCS 9453), pages 183-209, 2015.
  18. C. Hazay, Y. Lindell and A. Patra. Adaptively Secure Computation with Partial Erasures. In PODC, pages 291-300, 2015.
  19. C. Hazay. Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs. In the Theory of Cryptography Conference (TCC), Springer-Verlag (LNCS 9015), pages 90-120, 2015.
  20. C. Hazay and A. Patra. One-Sided Adaptively Secure Two-Party Computation. In the Theory of Cryptography Conference (TCC), Springer-Verlag (LNCS 8349), pages 368-393, 2014.
  21. S. Faust, C. Hazay and D. Venturi. Outsourced Pattern Matching. In ICALP, Springer-Verlag (LNCS 7966), pages 545-556, 2013.
  22. C. Hazay, A. Lopez-Alt, H. Wee and D. Wichs. Leakage-Resilient Cryptography from Minimal Assumptions. In EUROCRYPT, Springer-Verlag (LNCS 7658), pages 160-176, 2013.
  23. S. Faust, C. Hazay, J. B. Nielsen, P. S. Nordholt and A. Zottarel. Signature Schemes Secure against Hard-to-Invert Leakage. In ASIACRYPT, Springer-Verlag (LNCS 7658), pages 98-115, 2012.
  24. Akavia, S. Goldwasser and C. Hazay. Distributed Public Key Schemes Secure against Continual Leakage. In PODC, pages 155-164, 2012.
  25. I. Damgard, S. Faust and C. Hazay. Secure Two-Party Computation with Low Communication. In the Theory of Cryptography Conference (TCC), Springer-Verlag (LNCS 7194), pages 54-74, 2012.
  26. C. Hazay, G. L. Mikkelsen, T. Rabin and T. Toft. Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting. In CT-RSA, Springer-Verlag (LNCS 7178), pages 313-331, 2012.
  27. G. Asharov, R. Canetti and C. Hazay. Towards a Game Theoretic View of Secure Computation. In EUROCRYPT, Springer-Verlag (LNCS 6632), pages 426-445, 2011.
  28. C. Hazay and T. Toft. Computationally Secure Pattern Matching in the Presence of Malicious Adversaries. In ASIACRYPT, Springer-Verlag (LNCS 6477), pages 195-212, 2010.
  29. R. Gennaro, C. Hazay and J. Sorensen. Text Search Protocols with Simulation Based Security. In Public Key Cryptography (PKC), pages 332-350, 2010.
  30. C. Hazay and K. Nissim. Efficient Set Operations in the Presence of Malicious Adversaries. In Public Key Cryptography (PKC), pages 312-331, 2010.
  31. D. Klinc, C. Hazay, A. Jagmohan, H. Krawczyk and T. Rabin. On Compressing Data Encrypted with Block Ciphers. In Data Compression Conference, 213-222, 2009.
  32. C. Hazay and Y. Lindell. Constructions of Truly Practical Secure Protocols using Standard Smartcards. In the ACM Conference on Computer and Communications Security (ACM CCS), pages 491-500, 2008.
  33. D. Gordon, C. Hazay, J. Katz and Y. Lindell. Complete Fairness in Secure Two-Party Computation. In the ACM Symposium on the Theory of Computing (STOC), pages 413-422, 2008.
  34. C. Hazay and Y. Lindell. Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. In the Theory of Cryptography Conference (TCC), Springer-Verlag (LNCS 4948), pages 155-175, 2008.
  35. C. Hazay, J. Katz, C.Y. Koo and Y. Lindell. Concurrently-Secure Blind Signatures without Random Oracles or Setup Assumptions. In the Theory of Cryptography Conference (TCC), Springer-Verlag (LNCS 4392), pages 323-341, 2007.
  36. C. Hazay, M. Lewenstein and D. Tzur. Faster Algorithm for 2D parameterized Matching. In the Symposium on Combinatorial Pattern Matching (CPM). Pages 266-279, 2005.
  37. C. Hazay, M. Lewenstein and D. Sokol. Approximate parameterized matching. In the 16th Annual European Symposium on Algorithms (ESA), pages 414-425, 2004.

Technical Reports:

  1. C. Hazay and Y. Lindell. A Note on Zero-Knowledge Proofs of Knowledge and the ZKPOK Ideal Functionality. Cryptology ePrint Archive, Report 2010/552, 2010.
  2. C. Hazay and Y. Lindell. A Note on the Relation between the Definitions of Security for Semi- Honest and Malicious Adversaries. Cryptology ePrint Archive, Report 2010/551, 2010.

Other Publications:

  • C. Hazay. Secure Two-Party Computation. Galileo Magazine, February 2010.