Sciweavers

2687 search results - page 211 / 538
» Formal Analysis of PKCS
Sort
View
JOC
2007
169views more  JOC 2007»
15 years 4 months ago
Another Look at "Provable Security"
We give an informal analysis and critique of several typical “provable security” results. In some cases there are intuitive but convincing arguments for rejecting the conclusi...
Neal Koblitz, Alfred Menezes
IPL
2010
93views more  IPL 2010»
15 years 3 months ago
Compiling and securing cryptographic protocols
Protocol narrations are widely used in security as semi-formal notations to specify conversations between roles. We define a translation from a protocol narration to the sequence...
Yannick Chevalier, Michaël Rusinowitch
ISOLA
2010
Springer
15 years 2 months ago
Analysing Message Sequence Graph Specifications
We give a detailed construction of a finite-state transition system for a com-connected Message Sequence Graph. Though this result is fairly well-known in the literature there has...
Joy Chakraborty, Deepak D'Souza, K. Narayan Kumar
COLING
2010
14 years 11 months ago
Near-synonym Lexical Choice in Latent Semantic Space
We explore the near-synonym lexical choice problem using a novel representation of near-synonyms and their contexts in the latent semantic space. In contrast to traditional latent...
Tong Wang, Graeme Hirst
SAS
2012
Springer
208views Formal Methods» more  SAS 2012»
13 years 7 months ago
Finding Non-terminating Executions in Distributed Asynchronous Programs
Programming distributed and reactive asynchronous systems is complex due to the lack of synchronization between concurrently executing tasks, and arbitrary delay of message-based c...
Michael Emmi, Akash Lal