Sciweavers

719 search results - page 127 / 144
» Proving Security Protocols Correct
Sort
View
SIGCOMM
2004
ACM
15 years 3 months ago
A system for authenticated policy-compliant routing
Internet end users and ISPs alike have little control over how packets are routed outside of their own AS, restricting their ability to achieve levels of performance, reliability,...
Barath Raghavan, Alex C. Snoeren
WISEC
2010
ACM
15 years 2 months ago
Secret keys from entangled sensor motes: implementation and analysis
Key management in wireless sensor networks does not only face typical, but also several new challenges. The scale, resource limitations, and new threats such as node capture and c...
Matthias Wilhelm, Ivan Martinovic, Jens B. Schmitt
75
Voted
TIT
2008
164views more  TIT 2008»
14 years 9 months ago
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
Aggelos Kiayias, Moti Yung
ICDCS
2006
IEEE
15 years 3 months ago
Tolerating Byzantine Faulty Clients in a Quorum System
Byzantine quorum systems have been proposed that work properly even when up to f replicas fail arbitrarily. However, these systems are not so successful when confronted with Byzan...
Barbara Liskov, Rodrigo Rodrigues
81
Voted
CCS
2001
ACM
15 years 2 months ago
Interoperable strategies in automated trust negotiation
Automated trust negotiation is an approach to establishing trust between strangers through the exchange of digital credentials and the use of access control policies that specify ...
Ting Yu, Marianne Winslett, Kent E. Seamons