Sciweavers

1779 search results - page 185 / 356
» Secure Communications in ATM Networks
Sort
View
205
Voted
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
15 years 11 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
CN
2007
117views more  CN 2007»
15 years 7 months ago
Secure multicast in dynamic environments
A secure multicast framework should only allow authorized members of a group to decrypt received messages; usually, one ‘‘group key’’ is shared by all approved members. Ho...
Chun-Ying Huang, Yun-Peng Chiu, Kuan-Ta Chen, Chin...
SASN
2004
ACM
16 years 14 days ago
Revisiting random key pre-distribution schemes for wireless sensor networks
Key management is one of the fundamental building blocks of security services. In a network with resource constrained nodes like sensor networks, traditional key management techni...
Joengmin Hwang, Yongdae Kim
WPES
2006
ACM
16 years 1 months ago
Measuring relationship anonymity in mix networks
Many applications of mix networks such as anonymous Web browsing require relationship anonymity: it should be hard for the attacker to determine who is communicating with whom. Co...
Vitaly Shmatikov, Ming-Hsiu Wang
ACMSE
2009
ACM
16 years 1 months ago
Bit vector algorithms enabling high-speed and memory-efficient firewall blacklisting
In a world of increasing Internet connectivity coupled with increasing computer security risks, security conscious network applications implementing blacklisting technology are be...
J. Lane Thames, Randal Abler, David Keeling