8 search results - page 2 / 2 » Lower Bounds for Non-Black-Box Zero Knowledge |
ASIACRYPT
2001
Springer
13 years 10 months ago
2001
Springer
The number of communication rounds is a classic complexity measure for protocols; reducing round complexity is a major goal in protocol design. However, when the communication time...
TCC
2009
Springer
14 years 6 months ago
2009
Springer
The concept of witness-hiding suggested by Feige and Shamir is a natural relaxation of zero-knowledge. In this paper we identify languages and distributions for which many known co...
STOC
1999
ACM
13 years 10 months ago
1999
ACM
We considered non-clairvoyant multiprocessor scheduling of jobs with arbitrary arrival times and changing execution characteristics. The problem has been studied extensively when ...