3228 search results - page 461 / 646 » Computationally Sound Proofs |
165
Voted
SPC
2005
Springer
15 years 9 months ago
2005
Springer
In pervasive computing environments, changes in context may trigger changes in an individual’s access permissions. We contend that existing access control frameworks do not provi...
154
click to vote
RTA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
139
Voted
ICALP
1995
Springer
15 years 7 months ago
1995
Springer
An infinite binary sequence x is defined to be (i) strongly useful if there is a computable time bound within which every decidable sequence is Turing reducible to x; and (ii) w...
151
click to vote
BIRTHDAY
2008
Springer
15 years 5 months ago
2008
Springer
The Church-Turing Thesis has been the subject of many variations and interpretations over the years. Specifically, there are versions that refer only to functions over the natural ...
157
Voted
JOC
2006
15 years 3 months ago
2006
Abstract. In response to the current need for fast, secure and cheap public-key cryptography, we propose an interactive zero-knowledge identification scheme and a derived signature...