397 search results - page 30 / 80 » Pseudorandom Functions and Lattices |
PAMI
1998
15 years 28 days ago
1998
—The bitmap obtained by scanning a printed pattern depends on the exact location of the scanning grid relative to the pattern. We consider ideal sampling with a regular lattice o...
LPNMR
2009
Springer
15 years 7 months ago
2009
Springer
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
115
click to vote
JCT
2007
15 years 1 months ago
2007
Hyperplanes of the form xj = xi + c are called affinographic. For an affinographic hyperplane arrangement in Rn, such as the Shi arrangement, we study the function f(m) that counts...
EJC
2010
14 years 12 months ago
2010
Prudent walks are self-avoiding walks on a lattice which never step into the direction of an already occupied vertex. We study the closed version of these walks, called prudent po...
108
click to vote
IACR
2011
14 years 28 days ago
2011
We present the hash-based signature scheme XMSS. It is the first provably (forward) secure and practical signature scheme with minimal security requirements: a pseudorandom and a ...