29908 search results - page 567 / 5982 » On the Complexity of |
205
click to vote
FOCS
2002
IEEE
16 years 5 days 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,...
224
click to vote
ICDCS
2002
IEEE
16 years 5 days ago
2002
IEEE
In this paper, we focus our attention on the problem of automating the addition of failsafe fault-tolerance where fault-tolerance is added to an existing (fault-intolerant) progra...