1411 search results - page 74 / 283 » Interactive Coding for Interactive Proofs |
152
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
166
click to vote
COCO
1991
Springer
15 years 8 months ago
1991
Springer
Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...
125
click to vote
SIAMCOMP
2008
15 years 3 months ago
2008
We investigate structural properties of interactive perfect zero-knowledge (PZK) proofs. Specifically, we look into the closure properties of PZK languages under monotone boolean ...
151
click to vote
CHI
2006
ACM
16 years 5 months ago
2006
ACM
Navigating and understanding the source code of a program are highly challenging activities. This paper introduces a fisheye view of source code to a Java programming environment....
148
click to vote
CHI
2007
ACM
15 years 8 months ago
2007
ACM
Software developers must modify their programs to keep up with changing requirements and designs. Often, a conceptually simple change can require numerous edits that are similar b...