490 search results - page 7 / 98 » Equivalent Keys of HPC |
IPL
2007
13 years 8 months ago
2007
We consider the problem Monet—given two monotone formulas ϕ in DNF and ψ in CNF, decide whether they are equivalent. While Monet is probably not coNPhard, it is a long standin...
ESORICS
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We define a framework to reason about implementations of equational theories in the presence of an adaptive adversary. We particularly focus on soundess of static equiva...
APAL
2008
13 years 8 months ago
2008
An oversight in Guaspari and Solovay's "Rosser sentences" (1979, Ann. Math. Log., 16, 81) is pointed out and emended. It concerns the premisses of their proof that ...
BC
1998
13 years 8 months ago
1998
A non-uniform equivalent cable model of membrane voltage changes in branching neuronal trees with active ion channels has been developed. A general branching condition is formulate...
ENTCS
2006
13 years 8 months ago
2006
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...