10271 search results - page 1603 / 2055 » Computer Science |
156
click to vote
CCA
2005
Springer
16 years 12 days ago
2005
Springer
A function f is continuous iff the pre-image f −1[V ] of any open setV is open again. Dual to this topological7 property, f is called open iff the image f [U] of any open set U ...
185
click to vote
ICALP
2005
Springer
16 years 11 days ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
150
click to vote
ICALP
2005
Springer
16 years 11 days ago
2005
Springer
At TCC 2005, Backes and Cachin proposed a new and very strong notion of security for public key steganography: secrecy against adaptive chosen covertext attack (SS-CCA); and posed ...
155
click to vote
ICALP
2005
Springer
16 years 11 days ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
146
click to vote
ICALP
2005
Springer
16 years 11 days ago
2005
Springer
We present a new primitive—Append-only Signatures (AOS)—with the property that any party given an AOS signature Sig[M1] on message M1 can compute Sig[M1 M2] for any message M2...