793 search results - page 15 / 159 » Argumentation and standards of proof |
101
Voted
AIML
2008
15 years 1 months ago
2008
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for "Valentini&q...
92
Voted
CRYPTO
2003
Springer
15 years 4 months ago
2003
Springer
We revisit the definitions of zero-knowledge in the Common Reference String (CRS) model and the Random Oracle (RO) model. We argue that even though these definitions syntacticall...
ASIACRYPT
2006
Springer
15 years 3 months ago
2006
Springer
Currently, the best and only evidence of the security of the OAEP encryption scheme is a proof in the contentious random oracle model. Here we give further arguments in support of...
162
Voted
EXACT
2009
14 years 9 months ago
2009
In this paper a representative example is chosen that is meant be fairly simple for illustrating the point that in a very common kind of instance, argument and explanation are mixe...
TCC
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We establish new lower bounds and impossibility results for noninteractive zero-knowledge proofs and arguments with set-up assumptions. – For the common random string m...