Sciweavers

8728 search results - page 422 / 1746
» On Reduct Construction Algorithms
Sort
View
TCC
2005
Springer
139views Cryptology» more  TCC 2005»
16 years 10 days ago
The Relationship Between Password-Authenticated Key Exchange and Other Cryptographic Primitives
Abstract. We consider the problem of password-authenticated key exchange (PAK) also known as session-key generation using passwords: constructing session-key generation protocols t...
Minh-Huyen Nguyen
ISCA
2000
IEEE
92views Hardware» more  ISCA 2000»
15 years 11 months ago
Trace preconstruction
Trace caches enable high bandwidth, low latency instruction supply, but have a high miss penalty and relatively large working sets. Consequently, their performance may suffer due ...
Quinn Jacobson, James E. Smith
ESOP
2008
Springer
15 years 8 months ago
Typing Safe Deallocation
In this work we address the problem of proving, by static analysis means, that allocating and deallocating regions in the store provides a safe way to achieve memory management. Th...
Gérard Boudol
ECCC
2010
80views more  ECCC 2010»
15 years 7 months ago
Query Complexity in Errorless Hardness Amplification
An errorless circuit for a boolean function is one that outputs the correct answer or "don't know" on each input (and never outputs the wrong answer). The goal of e...
Thomas Watson
LPAR
2010
Springer
15 years 4 months ago
A Simple Class of Kripke-Style Models in Which Logic and Computation Have Equal Standing
We present a sound and complete model of lambda-calculus reductions based on structures inspired by modal logic (closely related to Kripke structures). Accordingly we can construct...
Michael Gabbay, Murdoch James Gabbay