Sciweavers

5387 search results - page 473 / 1078
» Generating generic functions
Sort
View
CORR
2010
Springer
109views Education» more  CORR 2010»
15 years 7 months ago
Hybrid tractability of soft constraint problems
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable effort has been made in identifying properties which ensure tractabi...
Martin C. Cooper, Stanislav Zivný
FAC
2008
80views more  FAC 2008»
15 years 7 months ago
Verification of Mondex electronic purses with KIV: from transactions to a security protocol
The Mondex case study about the specification and refinement of an electronic purse as defined in the Oxford Technical Monograph PRG-126 has recently been proposed as a challenge f...
Dominik Haneberg, Gerhard Schellhorn, Holger Grand...
CN
2006
117views more  CN 2006»
15 years 7 months ago
Using equivalence-checking to verify robustness to denial of service
In this paper, we introduce a new security property which intends to capture the ability of a cryptographic protocol being resistant to denial of service. This property, called im...
Stéphane Lafrance
CORR
2006
Springer
100views Education» more  CORR 2006»
15 years 7 months ago
How to beat the sphere-packing bound with feedback
The sphere-packing bound Esp(R) bounds the reliability function for fixed-length block-codes. For symmetric channels, it remains a valid bound even when strictly causal noiseless ...
Anant Sahai
IJACT
2008
136views more  IJACT 2008»
15 years 7 months ago
Anonymous RFID authentication supporting constant-cost key-lookup against active adversaries
: In the absence of sufficiently optimised public key constructions, anonymous authentication for Radio-Frequency Identification Devices (RFIDs) requires state synchronisation betw...
Mike Burmester, Breno de Medeiros, Rossana Motta