dblp.uni-trier.dewww.uni-trier.de

Dan Gutfreund

Danny Gutfreund

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2008
13EEShafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum: A (de)constructive approach to program checking. STOC 2008: 143-152
2007
12EEDan Gutfreund, Amnon Ta-Shma: Worst-Case to Average-Case Reductions Revisited. APPROX-RANDOM 2007: 569-583
11EEShafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum: Verifying and decoding in constant depth. STOC 2007: 440-449
10EEDan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma: If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances. Computational Complexity 16(4): 412-441 (2007)
2006
9EEDan Gutfreund: Worst-Case Vs. Algorithmic Average-Case Complexity in the Polynomial-Time Hierarchy. APPROX-RANDOM 2006: 386-397
2005
8EEDan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma: If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances. IEEE Conference on Computational Complexity 2005: 243-257
2004
7EEDan Gutfreund, Emanuele Viola: Fooling Parity Tests with Parity Gates. APPROX-RANDOM 2004: 381-392
6EEEmanuele Viola, Dan Gutfreund: Fooling Parity Tests with Parity Gates Electronic Colloquium on Computational Complexity (ECCC)(088): (2004)
5EEHana Chockler, Dan Gutfreund: A lower bound for testing juntas. Inf. Process. Lett. 90(6): 301-305 (2004)
2003
4EEDan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma: Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games. IEEE Conference on Computational Complexity 2003: 33-47
3EEDan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma: Uniform hardness versus randomness tradeoffs for Arthur-Merlin games. Computational Complexity 12(3-4): 85-130 (2003)
2EEMichael Ben-Or, Danny Gutfreund: Trading Help for Interaction in Statistical Zero-Knowledge Proofs. J. Cryptology 16(2): 95-116 (2003)
2000
1EEDanny Gutfreund, Michael Ben-Or: Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems. ASIACRYPT 2000: 429-442

Coauthor Index

1Michael Ben-Or [1] [2]
2Hana Chockler [5]
3Shafi Goldwasser [11] [13]
4Alexander Healy [11] [13]
5Tali Kaufman [11] [13]
6Guy N. Rothblum [11] [13]
7Ronen Shaltiel [3] [4] [8] [10]
8Amnon Ta-Shma [3] [4] [8] [10] [12]
9Emanuele Viola [6] [7]

Colors in the list of coauthors

Copyright © Thu Jun 5 07:42:39 2008 by Michael Ley (ley@uni-trier.de)