659 search results - page 33 / 132 » Compiling and securing cryptographic protocols |
127
click to vote
IFIP
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
111
click to vote
SAINT
2003
IEEE
15 years 5 months ago
2003
IEEE
A public key infrastructure is generally (and effectively) used for cryptographically secure authentication in the networks. Ad-hoc networks are formed in haphazard manner. Securi...
95
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
105
click to vote
CSFW
2007
IEEE
15 years 6 months ago
2007
IEEE
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
92
Voted
TIT
2008
15 years 10 days ago
2008
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...