Carmit Hazay

	2012
32		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
31		Ivan Damgård, Sebastian Faust, Carmit Hazay: Secure Two-Party Computation with Low Communication. TCC 2012: 54-74
30		Sebastian Faust, Carmit Hazay, Jesper Buus Nielsen, Peter Sebastian Nordholt, Angela Zottarel: Signature Schemes Secure against Hard-to-Invert Leakage. IACR Cryptology ePrint Archive 2012: 45 (2012)
29		Carmit Hazay, Kobbi Nissim: Efficient Set Operations in the Presence of Malicious Adversaries. J. Cryptology 25(3): 383-433 (2012)
	2011
28		Gilad Asharov, Ran Canetti, Carmit Hazay: Towards a Game Theoretic View of Secure Computation. EUROCRYPT 2011: 426-445
27		Gilad Asharov, Ran Canetti, Carmit Hazay: Towards a Game Theoretic View of Secure Computation. IACR Cryptology ePrint Archive 2011: 137 (2011)
26		Ivan Damgård, Carmit Hazay, Arpita Patra: Leakage Resilient Secure Two-Party Computation. IACR Cryptology ePrint Archive 2011: 256 (2011)
25		Carmit Hazay, Gert Læssøe Mikkelsen, Tal Rabin, Tomas Toft: Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting. IACR Cryptology ePrint Archive 2011: 494 (2011)
24		Ivan Damgård, Sebastian Faust, Carmit Hazay: Secure Two-Party Computation with Low Communication. IACR Cryptology ePrint Archive 2011: 508 (2011)
23		S. Dov Gordon, Carmit Hazay, Jonathan Katz, Yehuda Lindell: Complete Fairness in Secure Two-Party Computation. J. ACM 58(6): 24 (2011)
	2010
22		Carmit Hazay, Tomas Toft: Computationally Secure Pattern Matching in the Presence of Malicious Adversaries. ASIACRYPT 2010: 195-212
21		Carmit Hazay, Kobbi Nissim: Efficient Set Operations in the Presence of Malicious Adversaries. Public Key Cryptography 2010: 312-331
20		Rosario Gennaro, Carmit Hazay, Jeffrey S. Sorensen: Text Search Protocols with Simulation Based Security. Public Key Cryptography 2010: 332-350
19		Demijan Klinc, Carmit Hazay, Ashish Jagmohan, Hugo Krawczyk, Tal Rabin: On Compression of Data Encrypted with Block Ciphers CoRR abs/1009.1759: (2010)
18		Demijan Klinc, Carmit Hazay, Ashish Jagmohan, Hugo Krawczyk, Tal Rabin: On Compression of Data Encrypted with Block Ciphers. IACR Cryptology ePrint Archive 2010: 477 (2010)
17		Rosario Gennaro, Carmit Hazay, Jeffrey S. Sorensen: Automata Evaluation and Text Search Protocols with Simulation Based Security. IACR Cryptology ePrint Archive 2010: 484 (2010)
16		Carmit Hazay, Yehuda Lindell: A Note on the Relation between the Definitions of Security for Semi-Honest and Malicious Adversaries. IACR Cryptology ePrint Archive 2010: 551 (2010)
15		Carmit Hazay, Yehuda Lindell: A Note on Zero-Knowledge Proofs of Knowledge and the ZKPOK Ideal Functionality. IACR Cryptology ePrint Archive 2010: 552 (2010)
14		Carmit Hazay, Yehuda Lindell: Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. J. Cryptology 23(3): 422-456 (2010)
	2009
13		Demijan Klinc, Carmit Hazay, Ashish Jagmohan, Hugo Krawczyk, Tal Rabin: On Compression of Data Encrypted with Block Ciphers. DCC 2009: 213-222
12		Carmit Hazay, Yehuda Lindell: Constructions of Truly Practical Secure Protocols using Standard Smartcards. IACR Cryptology ePrint Archive 2009: 36 (2009)
11		Carmit Hazay, Yehuda Lindell: Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. IACR Cryptology ePrint Archive 2009: 45 (2009)
10		Carmit Hazay, Yehuda Lindell: Efficient Oblivious Polynomial Evaluation with Simulation-Based Security. IACR Cryptology ePrint Archive 2009: 459 (2009)
9		Carmit Hazay, Kobbi Nissim: Efficient Set Operations in the Presence of Malicious Adversaries. IACR Cryptology ePrint Archive 2009: 594 (2009)
	2008
8		Carmit Hazay, Yehuda Lindell: Constructions of truly practical secure protocols using standardsmartcards. ACM Conference on Computer and Communications Security 2008: 491-500
7		S. Dov Gordon, Carmit Hazay, Jonathan Katz, Yehuda Lindell: Complete fairness in secure two-party computation. STOC 2008: 413-422
6		Carmit Hazay, Yehuda Lindell: Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. TCC 2008: 155-175
5		S. Dov Gordon, Carmit Hazay, Jonathan Katz, Yehuda Lindell: Complete Fairness in Secure Two-Party Computation. IACR Cryptology ePrint Archive 2008: 303 (2008)
	2007
4		Carmit Hazay, Jonathan Katz, Chiu-Yuen Koo, Yehuda Lindell: Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions. TCC 2007: 323-341
3		Carmit Hazay, Moshe Lewenstein, Dina Sokol: Approximate parameterized matching. ACM Transactions on Algorithms 3(3): (2007)
	2005
2		Carmit Hazay, Moshe Lewenstein, Dekel Tsur: Two Dimensional Parameterized Matching. CPM 2005: 266-279
	2004
1		Carmit Hazay, Moshe Lewenstein, Dina Sokol: Approximate Parameterized Matching. ESA 2004: 414-425

Coauthor Index

1	Gilad Asharov	[27] [28]
2	Ran Canetti	[27] [28]
3	Ivan Damgård (Ivan Bjerre Damgård)	[24] [26] [31]
4	Sebastian Faust	[24] [30] [31]
5	Rosario Gennaro	[17] [20]
6	S. Dov Gordon	[5] [7] [23]
7	Ashish Jagmohan	[13] [18] [19]
8	Jonathan Katz	[4] [5] [7] [23]
9	Demijan Klinc	[13] [18] [19]
10	Chiu-Yuen Koo	[4]
11	Hugo Krawczyk	[13] [18] [19]
12	Moshe Lewenstein	[1] [2] [3]
13	Yehuda Lindell	[4] [5] [6] [7] [8] [10] [11] [12] [14] [15] [16] [23]
14	Gert Læssøe Mikkelsen	[25] [32]
15	Jesper Buus Nielsen	[30]
16	Kobbi Nissim	[9] [21] [29]
17	Peter Sebastian Nordholt	[30]
18	Arpita Patra	[26]
19	Tal Rabin	[13] [18] [19] [25] [32]
20	Dina Sokol	[1] [3]
21	Jeffrey S. Sorensen	[17] [20]
22	Tomas Toft	[22] [25] [32]
23	Dekel Tsur	[2]
24	Angela Zottarel	[30]

Colors in the list of coauthors

Last update Thu May 31 18:55:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page