EUROCRYPT
14 years 3 months ago
2004 Springer
Informally, a public-key steganography protocol allows two parties, who have never met or exchanged a secret, to send hidden messages over a public channel so that an adversary can...
EUROCRYPT
14 years 3 months ago
2004 Springer
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...
EUROCRYPT
14 years 3 months ago
2004 Springer
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
EUROCRYPT
14 years 3 months ago
2004 Springer
We prove a tight lower bound for generic protocols for secure multicast key distribution where the messages sent by the group manager for rekeying the group are obtained by arbitra...
EUROCRYPT
14 years 1 months ago
2004 Springer
An extended abstract of this paper appears in C. Cachin and J. Camenisch, editors, Advances in Cryptology-EUROCRYPT 2004, volume 3027 of Lecture Notes in Computer Science, pages 22...
|