Sciweavers

16 search results - page 3 / 4
» jcs 2010
Sort
View
JCS
2010
121views more  JCS 2010»
13 years 3 months ago
Computational soundness of symbolic zero-knowledge proofs
raction of cryptographic operations by term algebras, called Dolev-Yao models, is essential in almost all tool-supported methods for proving security protocols. Recently significa...
Michael Backes, Dominique Unruh
JCS
2010
112views more  JCS 2010»
13 years 3 months ago
Inductive trace properties for computational security
Protocol authentication properties are generally trace-based, meaning that authentication holds for the protocol if authentication holds for individual traces (runs of the protoco...
Arnab Roy, Anupam Datta, Ante Derek, John C. Mitch...
JCS
2010
80views more  JCS 2010»
13 years 3 days ago
Constraint differentiation: Search-space reduction for the constraint-based analysis of security protocols
We introduce constraint differentiation, a powerful technique for reducing search when model-checking security protocols using constraint-based methods. Constraint differentiation...
Sebastian Mödersheim, Luca Viganò, Dav...
JCS
2010
104views more  JCS 2010»
13 years 3 months ago
Finding the PKI needles in the Internet haystack
Public-key cryptography can uniquely enable trust within distributed settings. Employing it usually requires deploying a set of tools and services collectively known as a public k...
Massimiliano Pala, Sean W. Smith
JCS
2010
135views more  JCS 2010»
13 years 3 months ago
New filtering approaches for phishing email
Phishing emails usually contain a message from a credible looking source requesting a user to click a link to a website where she/he is asked to enter a password or other confide...
André Bergholz, Jan De Beer, Sebastian Glah...