Sciweavers

1058 search results - page 69 / 212
» Secure Group Communications Using Key Graphs
Sort
View
FM
2006
Springer
146views Formal Methods» more  FM 2006»
15 years 4 months ago
Formal Modeling of Communication Protocols by Graph Transformation
Formal modeling is a crucial first step in the analysis of safety critical communication protocols such as IP Telephony. These protocols are notoriously resistant to formal modelin...
Zarrin Langari, Richard J. Trefler
154
Voted
EUC
2008
Springer
15 years 2 months ago
An Improved Password-Based Authenticated Key Agreement Scheme for Pervasive Applications
Password authentication is a popular approach used for user authentication in pervasive computing environments due to its simplicity and convenience. To secure the transmission be...
Maw-Jinn Tsaur, Wei-Chi Ku, Hao-Rung Chung
109
Voted
TIT
2008
187views more  TIT 2008»
15 years 2 days ago
The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement
Abstract--In the bounded-storage model (BSM) for information-theoretic secure encryption and key agreement, one makes use of a random string R whose length t is greater than the as...
Stefan Dziembowski, Ueli M. Maurer
IACR
2011
196views more  IACR 2011»
14 years 8 days ago
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
Gilad Asharov, Abhishek Jain, Daniel Wichs
113
Voted
GLOBECOM
2009
IEEE
15 years 7 months ago
On the Connectivity of Key-Distribution Strategies in Wireless Sensor Networks
Abstract—Wireless sensor networks (WSNs) are usually missioned to gather critical information in hostile and adversarial environments, which make them susceptible to compromise a...
Hosein Shafiei, Ahmad Khonsari, Mohammad Sadegh Ta...