Sciweavers

1853 search results - page 53 / 371
» Cryptographic Protocols and Network Security
Sort
View
CN
2008
128views more  CN 2008»
14 years 12 months ago
Autonomous security for autonomous systems
The Internet's interdomain routing protocol, BGP, supports a complex network of Autonomous Systems which is vulnerable to a number of potentially crippling attacks. Several p...
Josh Karlin, Stephanie Forrest, Jennifer Rexford
HICSS
2005
IEEE
148views Biometrics» more  HICSS 2005»
15 years 5 months ago
Public-Key-Infrastructure Based on a Peer-to-Peer Network
The goal of a Public-Key-Infrastructure (PKI) is to prove whether a cryptographic public key is authentic for a certain user. This information is crucial for the reliability of as...
Thomas Wölfl
ICALP
2005
Springer
15 years 5 months ago
Probabilistic Polynomial-Time Semantics for a Protocol Security Logic
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
Anupam Datta, Ante Derek, John C. Mitchell, Vitaly...
CSFW
2007
IEEE
15 years 6 months ago
Computationally Sound Mechanized Proofs of Correspondence Assertions
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
Bruno Blanchet
TIT
2008
164views more  TIT 2008»
14 years 11 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