397 search results - page 9 / 80 » Pseudorandom Functions and Lattices |
COMBINATORICS
1998
13 years 6 months ago
1998
The Galois number Gn(q) is defined to be the number of subspaces of the n-dimensional vector space over the finite field GF(q). When q is prime, we prove that Gn(q) is equal to...
ASIACRYPT
2006
Springer
13 years 10 months ago
2006
Springer
We point out that the seemingly strong pseudorandom oracle preserving (PRO-Pr) property of hash function domain-extension transforms defined and implemented by Coron et. al. [12] ...
CTRSA
2008
Springer
13 years 8 months ago
2008
Springer
We motivate and describe the problem of finding protocols for multiparty computations that only use a single broadcast round per computation (latency-free computations). We show t...
SIAMDM
2008
13 years 6 months ago
2008
Recently, a strong link has been discovered between supermodularity on lattices and tractability of optimization problems known as maximum constraint satisfaction problems. The pre...
JAT
2010
13 years 5 months ago
2010
Sampling and reconstruction of generic multivariate functions is more efficient on non-Cartesian root lattices, such as the BCC (Body-Centered Cubic) lattice, than on the Cartesia...