793 search results - page 30 / 159 » Argumentation and standards of proof |
161
click to vote
CADE
2006
Springer
16 years 6 months ago
2006
Springer
In this paper, we discuss a lightweight approach to eliminate the overhead due to implicit type arguments during higher-order unification of dependently-typed terms. First, we show...
171
click to vote
CRYPTO
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, we continue the study the round complexity of black-box zero knowledge in the bare public-key (BPK, for short) model previously started by Micali and Reyzin in [11]....
174
click to vote
LPAR
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. Walther’s estimation calculus was designed to prove the termination of functional programs, and can also be used to solve the similar problem of proving the well-founde...
155
click to vote
STRINGOLOGY
2008
15 years 7 months ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
142
click to vote
ASIACRYPT
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between...