Sciweavers

4488 search results - page 127 / 898
» Properties of NP-Complete Sets
Sort
View
ESA
2004
Springer
120views Algorithms» more  ESA 2004»
14 years 1 months ago
Solving Geometric Covering Problems by Data Reduction
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core probl...
Steffen Mecke, Dorothea Wagner
CRYPTO
2008
Springer
123views Cryptology» more  CRYPTO 2008»
13 years 10 months ago
Collusion-Free Protocols in the Mediated Model
Prior approaches [15, 14] to building collusion-free protocols require exotic channels. By taking a conceptually new approach, we are able to use a more digitally-friendly communic...
Joël Alwen, Abhi Shelat, Ivan Visconti
SEC
2001
13 years 9 months ago
Security Analysis of the Cliques Protocols Suites: First Results
: The Cliques protocols are extensions of the Diffie-Hellman key exchange protocol to a group setting. In this paper, we are analysing the A-GDH.2 suite that is intended to allow a...
Olivier Pereira, Jean-Jacques Quisquater
MLQ
2008
63views more  MLQ 2008»
13 years 8 months ago
Generic cuts in models of arithmetic
We present some general results concerning the topological space of cuts of a countable model of arithmetic given by a particular indicator Y . The notion of `indicator' is d...
Richard Kaye
FORTE
2009
13 years 6 months ago
Epistemic Logic for the Applied Pi Calculus
We propose an epistemic logic for the applied pi calculus, which is a variant of the pi calculus with extensions for modeling cryptographic protocols. In such a calculus, the secur...
Rohit Chadha, Stéphanie Delaune, Steve Krem...