397 search results - page 33 / 80 » Pseudorandom Functions and Lattices |
165
click to vote
ICMCS
2009
IEEE
15 years 3 months ago
2009
IEEE
In this paper, we study the collision property of one of the robust hash functions proposed in [1]. This method was originally proposed for robust hash generation from blocks of i...
149
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
A belief-propagation decoder for low-density lattice codes, which represents messages explicitly as a mixture of Gaussians functions, is given. In order to prevent the mixture elem...
154
click to vote
ENTCS
2008
15 years 6 months ago
2008
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
128
click to vote
ICCV
2009
IEEE
15 years 3 months ago
2009
IEEE
In this paper, we present an algorithm for occlusion boundary detection. The main contribution is a probabilistic detection framework defined on spatio-temporal lattices, which en...
183
click to vote
ASIACRYPT
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Even and Mansour [EM97] proposed a block cipher construction that takes a publicly computable random permutation oracle P and XORs different keys prior to and after appl...