FSTTCS
2003
Springer
13 years 9 months ago
2003
Springer
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
FSTTCS
2003
Springer
13 years 9 months ago
2003
Springer
A key idea in cryptography is using hard functions in order to obtain secure schemes. The theory of hard functions (e.g. one-way functions) has been a great success story, and the ...
FSTTCS
2003
Springer
13 years 9 months ago
2003
Springer
FSTTCS
2003
Springer
13 years 9 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
FSTTCS
2003
Springer
13 years 9 months ago
2003
Springer
Given a polygonal path P with vertices p1, p2, . . . , pn and a real number t ≥ 1, a path Q = (pi1 , pi2 , . . . , pik ) is a t-distance-preserving approximation of P if 1 = i1 &...
FSTTCS
2003
Springer
13 years 9 months ago
2003
Springer
Recently, Jain, Mahdian and Saberi [5] had given a FPTAS for the problem of computing a market equilibrium in the Arrow-Debreu setting, when the utilities are linear functions. The...
FSTTCS
2003
Springer
13 years 9 months ago
2003
Springer
FSTTCS
2003
Springer
13 years 9 months ago
2003
Springer
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...
FSTTCS
2003
Springer
13 years 9 months ago
2003
Springer
For monoids that satisfy a weak cancellation condition, it is shown that the decidability of the existential theory of word equations is preserved under graph products. Furthermore...
FSTTCS
2003
Springer
13 years 9 months ago
2003
Springer
We prove the Needham-Schroeder-Lowe public-key protocol secure under real, active cryptographic attacks including concurrent protocol runs. This proof is based on an abstract crypt...