Sciweavers

35 search results - page 6 / 7
» jcs 2006
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
2006
113views more  JCS 2006»
13 years 5 months ago
Blind Electronic Commerce
Privacy in Electronic Commerce transactions is the subject of ever increasing research. However, many challenges remain to be overcome. For example, let us consider a customer, Si...
Esma Aïmeur, Gilles Brassard, Flavien Serge M...
JCS
2006
81views more  JCS 2006»
13 years 5 months ago
Effective worm detection for various scan techniques
In recent years, the threats and damages caused by active worms have become more and more serious. In order to reduce the loss caused by fastspreading active worms, an effective de...
Jianhong Xia, Sarma Vangala, Jiang Wu, Lixin Gao, ...
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