Sciweavers

165 search results - page 5 / 33
» Cryptographic Complexity Classes and Computational Intractab...
Sort
View
DSN
2007
IEEE
15 years 3 months ago
Protecting Cryptographic Keys from Memory Disclosure Attacks
Cryptography has become an indispensable mechanism for securing systems, communications and applications. While offering strong protection, cryptography makes the assumption that ...
Keith Harrison, Shouhuai Xu
IJCAI
2003
14 years 11 months ago
Causal Theories of Action: A Computational Core
We propose a framework for simple causal theories of action, and study the computational complexity in it of various reasoning tasks such as determinism, progression and regressio...
Jérôme Lang, Fangzhen Lin, Pierre Mar...
62
Voted
CSR
2008
Springer
14 years 11 months ago
Cracks in the Defenses: Scouting Out Approaches on Circuit Lower Bounds
Razborov and Rudich identified an imposing barrier that stands in the way of progress toward the goal of proving superpolynomial lower bounds on circuit size. Their work on "n...
Eric Allender
CRYPTO
2010
Springer
201views Cryptology» more  CRYPTO 2010»
14 years 10 months ago
Protecting Cryptographic Keys against Continual Leakage
Side-channel attacks have often proven to have a devastating effect on the security of cryptographic schemes. In this paper, we address the problem of storing cryptographic keys a...
Ali Juma, Yevgeniy Vahlis
COCO
2009
Springer
113views Algorithms» more  COCO 2009»
15 years 4 months ago
Are PCPs Inherent in Efficient Arguments?
Starting with Kilian (STOC ‘92), several works have shown how to use probabilistically checkable proofs (PCPs) and cryptographic primitives such as collision-resistant hashing to...
Guy N. Rothblum, Salil P. Vadhan