Guy N. Rothblum

	2009
18		Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum, Salil P. Vadhan: On the complexity of differentially private data release: efficient algorithms and hardness results. STOC 2009: 381-390
17		Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod Vaikuntanathan: How Efficient Can Memory Checking Be?. TCC 2009: 503-520
16		Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum, Vinod Vaikuntanathan: Weak Verifiable Random Functions. TCC 2009: 558-576
15		Moni Naor, Guy N. Rothblum: The complexity of online memory checking. J. ACM 56(1): (2009)
	2008
14		Dan Gutfreund, Guy N. Rothblum: The Complexity of Local List Decoding. APPROX-RANDOM 2008: 455-468
13		Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothblum: One-Time Programs. CRYPTO 2008: 39-56
12		Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothblum: Delegating computation: interactive proofs for muggles. STOC 2008: 113-122
11		Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum: A (de)constructive approach to program checking. STOC 2008: 143-152
10		Dan Gutfreund, Guy N. Rothblum: The Complexity of Local List Decoding. Electronic Colloquium on Computational Complexity (ECCC) 15(034): (2008)
	2007
9		Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum: Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles. FUN 2007: 166-182
8		Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum: Verifying and decoding in constant depth. STOC 2007: 440-449
7		Shafi Goldwasser, Guy N. Rothblum: On Best-Possible Obfuscation. TCC 2007: 194-213
6		Susan Hohenberger, Guy N. Rothblum, Abhi Shelat, Vinod Vaikuntanathan: Securely Obfuscating Re-encryption. TCC 2007: 233-252
5		Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum: A (De)constructive Approach to Program Checking. Electronic Colloquium on Computational Complexity (ECCC) 14(047): (2007)
	2006
4		Moni Naor, Guy N. Rothblum: Learning to impersonate. ICML 2006: 649-656
3		Moni Naor, Guy N. Rothblum: The Complexity of Online Memory Checking. Electronic Colloquium on Computational Complexity (ECCC) 13(034): (2006)
	2005
2		Moni Naor, Guy N. Rothblum: The Complexity of Online Memory Checking. FOCS 2005: 573-584
	2004
1		Erez Petrank, Guy N. Rothblum: Selection from Structured Data Sets Electronic Colloquium on Computational Complexity (ECCC)(085): (2004)

Coauthor Index

1	Zvika Brakerski	[16]
2	Cynthia Dwork	[17] [18]
3	Shafi Goldwasser	[5] [7] [8] [11] [12] [13] [16]
4	Ronen Gradwohl	[9]
5	Dan Gutfreund (Danny Gutfreund)	[5] [8] [10] [11] [14]
6	Alexander Healy	[5] [8] [11]
7	Susan Hohenberger	[6]
8	Yael Tauman Kalai (Yael Tauman)	[12] [13]
9	Tali Kaufman	[5] [8] [11]
10	Moni Naor	[2] [3] [4] [9] [15] [17] [18]
11	Erez Petrank	[1]
12	Benny Pinkas	[9]
13	Omer Reingold	[18]
14	Abhi Shelat	[6]
15	Salil P. Vadhan	[18]
16	Vinod Vaikuntanathan (V. Vinod)	[6] [16] [17]

Colors in the list of coauthors