Sciweavers

300 search results - page 50 / 60
» Formal Methods for Smartcard Security
Sort
View
ENTCS
2007
168views more  ENTCS 2007»
13 years 7 months ago
Bytecode Rewriting in Tom
In this paper, we present a term rewriting based library for manipulating Java bytecode. We define a mapping from bytecode programs to algebraic terms, and we use Tom, an extensi...
Emilie Balland, Pierre-Etienne Moreau, Antoine Rei...
WPES
2006
ACM
14 years 1 months ago
Measuring relationship anonymity in mix networks
Many applications of mix networks such as anonymous Web browsing require relationship anonymity: it should be hard for the attacker to determine who is communicating with whom. Co...
Vitaly Shmatikov, Ming-Hsiu Wang
CCS
2008
ACM
13 years 9 months ago
Reducing protocol analysis with XOR to the XOR-free case in the horn theory based approach
In the Horn theory based approach for cryptographic protocol analysis, cryptographic protocols and (Dolev-Yao) intruders are modeled by Horn theories and security analysis boils d...
Ralf Küsters, Tomasz Truderung
WWW
2004
ACM
14 years 8 months ago
OREL: an ontology-based rights expression language
This paper proposes an Ontology-based Rights Expression Language, called OREL. Based on OWL Web Ontology Language, OREL allows not only users but also machines to handle digital r...
Yuzhong Qu, Xiang Zhang, Huiying Li
IPPS
2008
IEEE
14 years 1 months ago
What is the best way to prove a cryptographic protocol correct?
In this paper, we identify that protocol verification using invariants have significant limitations such as inapplicability to some protocols, non-standard attacker inferences a...
Sreekanth Malladi, Gurdeep S. Hura