60 search results - page 9 / 12 » Zero knowledge with efficient provers |
PODC
2011
ACM
12 years 10 months ago
2011
ACM
We present a cryptographic framework to achieve access control, privacy of social relations, secrecy of resources, and anonymity of users in social networks. The main idea is to u...
FOCS
2000
IEEE
13 years 12 months ago
2000
IEEE
A zap is a two-round, public coin witness-indistinguishable protocol in which the first round, consisting of a message from the verifier to the prover, can be fixed “once and...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of resettable zeroknowledge proofs, where the protocol must be zero-knowledge even if a cheating veri...
AMC
2008
13 years 7 months ago
2008
ct 7 Two third order methods for finding multiple zeros of nonlinear functions are developed. One method is based on 8 Chebyshev's third order scheme (for simple roots) and th...
IJCAI
1993
13 years 9 months ago
1993
The problem of representing and reasoning about two notions of time that are relevant in the context of knowledge bases is addressed. These are called historical time and belief t...