5084 search results - page 107 / 1017 » Proving Possibility Properties |
136
click to vote
IJFCS
2007
15 years 5 months ago
2007
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and...
139
click to vote
CONCUR
2005
Springer
15 years 11 months ago
2005
Springer
Research on the automatic analysis of cryptographic protocols has so far mainly concentrated on reachability properties, such as secrecy and authentication. Only recently it was sh...
145
click to vote
VMCAI
2004
Springer
15 years 10 months ago
2004
Springer
The method of Invisible Invariants was developed originally in order to verify safety properties of parameterized systems fully automatically. Roughly speaking, the method is based...
134
click to vote
SOFSEM
2009
Springer
16 years 2 months ago
2009
Springer
We prove NP-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desir...
179
click to vote
CRYPTO
2007
Springer
15 years 9 months ago
2007
Springer
We consider the problem of secure identification: user U proves to server S that he knows an agreed (possibly low-entropy) password w, while giving away as little information on w ...