7988 search results - page 1208 / 1598 » A Useful Undecidable Theory |
160
click to vote
OTM
2007
Springer
16 years 1 months ago
2007
Springer
Ad hoc and peer-to-peer (P2P) computing paradigms pose a number of security challenges. The deployment of classic security protocols to provide services such as node authentication...
221
click to vote
PKC
2007
Springer
16 years 1 months ago
2007
Springer
At PKC 2003 Paeng, Jung, and Ha proposed a lattice based public key cryptosystem(PJH). It is originated from GGH, and designed as a hybrid of GGH and NTRUEncrypt in order to reduce...
168
click to vote
PKDD
2007
Springer
16 years 1 months ago
2007
Springer
Most knowledge discovery processes are biased since some part of the knowledge structure must be given before extraction. We propose a framework that avoids this bias by supporting...
197
click to vote
PPDP
2007
Springer
16 years 1 months ago
2007
Springer
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
193
click to vote
PROVSEC
2007
Springer
16 years 1 months ago
2007
Springer
Game-playing is an approach to write security proofs that are easy to verify. In this approach, security definitions and intractable problems are written as programs called games ...