769 search results - page 20 / 154 » Where Is the Proof |
125
Voted
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
148
click to vote
ICS
2010
Tsinghua U.
16 years 1 months ago
2010
Tsinghua U.
: Design of secure systems can often be expressed as ensuring that some property is maintained at every step of a distributed computation among mutually-untrusting parties. Special...
135
Voted
TCC
2010
Springer
15 years 11 months ago
2010
Springer
Introduced by Micali, Rabin and Kilian (MRK), the basic primitive of zero-knowledge sets (ZKS) allows a prover to commit to a secret set S so as to be able to prove statements such...
146
Voted
TCC
2009
Springer
16 years 4 months ago
2009
Springer
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
131
click to vote
COMPGEOM
2007
ACM
15 years 8 months ago
2007
ACM
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...