ICALP
2005
Springer
14 years 5 months ago
2005
Springer
ICALP
2005
Springer
14 years 5 months 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...
ICALP
2005
Springer
14 years 5 months ago
2005
Springer
We reduce the approximation factor for Vertex Cover to 2 − Θ( 1√ log n ) (instead of the previous 2 − Θ(log log n log n ), obtained by Bar-Yehuda and Even [2], and by Moni...
ICALP
2005
Springer
14 years 5 months 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...
ICALP
2005
Springer
14 years 5 months ago
2005
Springer
In this paper we initiate the study of the AND-OR directed feedback vertex set problem from the viewpoint of approximation algorithms. This AND-OR feedback vertex set problem is m...
ICALP
2005
Springer
14 years 5 months 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 ...
ICALP
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...
ICALP
2005
Springer
14 years 5 months ago
2005
Springer
We study a clean machine model for external memory and stream processing. We show that the number of scans of the external data induces a strict hierarchy (as long as work space is...
ICALP
2005
Springer
14 years 5 months ago
2005
Springer
We present a single-database private information retrieval (PIR) scheme with communication complexity O(k+d), where k ≥ log n is a security parameter that depends on the database...
ICALP
2005
Springer
14 years 5 months ago
2005
Springer