793 search results - page 43 / 159 » Argumentation and standards of proof |
87
Voted
CSR
2008
Springer
15 years 2 months ago
2008
Springer
Razborov and Rudich identified an imposing barrier that stands in the way of progress toward the goal of proving superpolynomial lower bounds on circuit size. Their work on "n...
106
Voted
JOC
2007
15 years 21 days ago
2007
We give an informal analysis and critique of several typical “provable security” results. In some cases there are intuitive but convincing arguments for rejecting the conclusi...
86
Voted
JOC
2002
15 years 14 days ago
2002
In theoretical cryptography, one formalizes the notion of an adversary's success probability being "too small to matter" by asking that it be a negligible function ...
124
click to vote
ENTCS
2006
15 years 25 days ago
2006
We describe novel computational techniques for constructing induction rules for deductive synthesis proofs. Deductive synthesis holds out the promise of automated construction of ...
109
Voted
CSFW
2007
IEEE
15 years 7 months ago
2007
IEEE
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...