10715 search results - page 86 / 2143 » Proofs from Tests |
95
Voted
JIIS
2008
15 years 23 days ago
2008
We propose a natural framework, called NF, which supports development of formal proofs on a computer. NF is based on a theory of Judgments and Derivations. NF is designed by observ...
116
Voted
TCS
2008
15 years 21 days ago
2008
This article presents formalized intuitionistic proofs for the polyhedra genus theorem, the Euler formula and a sufficient condition of planarity. They are based on a hypermap mod...
102
Voted
TCC
2010
Springer
15 years 9 months ago
2010
Springer
Goldreich-Krawczyk (Siam J of Comp’96) showed that only languages in BPP have constant-round public-coin black-box zero-knowledge protocols. We extend their lower bound to “ful...
CTRSA
2005
Springer
15 years 6 months ago
2005
Springer
Traditional password-based authentication and key-exchange protocols suffer from the simple fact that a single server stores the sensitive user password. In practice, when such a ...
115
Voted
HIP
2005
Springer
15 years 6 months ago
2005
Springer
In this paper, we propose a new class of Human Interactive Proofs (HIPs) that allow a human to distinguish one computer from another. Unlike traditional HIPs, where the computer is...