Sciweavers

989 search results - page 41 / 198
» Pebbling and Proofs of Work
Sort
View
IJCGT
2011
112views more  IJCGT 2011»
12 years 11 months ago
Tactical Agent Personality
This paper proposes an automatic model-based approach that enables adaptive decision making in modern virtual games. It builds upon the Integrated MDP and POMDP Learning AgeNT (IM...
Chek Tien Tan, Ho-Lun Cheng
CHES
2011
Springer
254views Cryptology» more  CHES 2011»
12 years 8 months ago
Extractors against Side-Channel Attacks: Weak or Strong?
Randomness extractors are important tools in cryptography. Their goal is to compress a high-entropy source into a more uniform output. Beyond their theoretical interest, they have ...
Marcel Medwed, François-Xavier Standaert
IACR
2011
94views more  IACR 2011»
12 years 8 months ago
After-the-Fact Leakage in Public-Key Encryption
What does it mean for an encryption scheme to be leakage-resilient? Prior formulations require that the scheme remains semantically secure even in the presence of leakage, but onl...
Shai Halevi, Huijia Lin
CORR
2012
Springer
232views Education» more  CORR 2012»
12 years 4 months ago
A Formal Comparison of Approaches to Datatype-Generic Programming
-generic programming increases program abstraction and reuse by making functions operate uniformly across different types. Many approaches to generic programming have been proposed...
José Pedro Magalhães, Andres Lö...
FSTTCS
2005
Springer
14 years 1 months ago
Quantitative Models and Implicit Complexity
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...
Ugo Dal Lago, Martin Hofmann