Sciweavers

17 search results - page 2 / 4
» Lower Bounds for Multicast Message Authentication
Sort
View
CRYPTO
2006
Springer
111views Cryptology» more  CRYPTO 2006»
13 years 8 months ago
Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models
We address the message authentication problem in two seemingly different communication models. In the first model, the sender and receiver are connected by an insecure channel and...
Moni Naor, Gil Segev, Adam Smith
TPDS
1998
78views more  TPDS 1998»
13 years 4 months ago
Resource Deadlocks and Performance of Wormhole Multicast Routing Algorithms
—We show that deadlocks due to dependencies on consumption channels are a fundamental problem in wormhole multicast routing. This type of resource deadlocks has not been addresse...
Rajendra V. Boppana, Suresh Chalasani, C. S. Ragha...
SP
2010
IEEE
156views Security Privacy» more  SP 2010»
13 years 3 months ago
Round-Efficient Broadcast Authentication Protocols for Fixed Topology Classes
Abstract--We consider resource-constrained broadcast authentication for n receivers in a static, known network topology. There are only two known broadcast authentication protocols...
Haowen Chan, Adrian Perrig
HICSS
2006
IEEE
165views Biometrics» more  HICSS 2006»
13 years 11 months ago
Efficient Algorithms for Batch Re-Keying Operations in Secure Multicast
Secure multicast has a variety of applications in ecommerce, e-banking, command and control, video-ondemand, and other internet-based services. In this paper, we present algorithm...
Mohammad Hossain Heydari, Linda Morales, Ivan Hal ...
FOCS
2007
IEEE
13 years 11 months ago
Lower Bounds on Signatures From Symmetric Primitives
We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most 2(1+o(1))q , where q is the total number of oracle queries a...
Boaz Barak, Mohammad Mahmoody-Ghidary