Sciweavers

437 search results - page 12 / 88
» Randomized Lattice Decoding
Sort
View
JC
2006
115views more  JC 2006»
15 years 24 days ago
Randomly shifted lattice rules on the unit cube for unbounded integrands in high dimensions
We study the problem of multivariate integration on the unit cube for unbounded integrands. Our study is motivated by problems in statistics and mathematical finance, where unboun...
Benjamin J. Waterhouse, Frances Y. Kuo, Ian H. Slo...
CRYPTO
2009
Springer
154views Cryptology» more  CRYPTO 2009»
15 years 7 months ago
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
We prove the equivalence, up to a small polynomial approximation factor n/ log n, of the lattice problems uSVP (unique Shortest Vector Problem), BDD (Bounded Distance Decoding) and...
Vadim Lyubashevsky, Daniele Micciancio
CRYPTO
2011
Springer
179views Cryptology» more  CRYPTO 2011»
14 years 19 days ago
Smaller Decoding Exponents: Ball-Collision Decoding
Very few public-key cryptosystems are known that can encrypt and decrypt in time b2+o(1) with conjectured security level 2b against conventional computers and quantum computers. Th...
Daniel J. Bernstein, Tanja Lange, Christiane Peter...
104
Voted
TIT
1998
78views more  TIT 1998»
15 years 14 days ago
Stationary Markov Random Fields on a Finite Rectangular Lattice
—This paper provides a complete characterization of stationary Markov random fields on a finite rectangular (nontoroidal) lattice in the basic case of a second-order neighborho...
Fréderic Champagnat, Jérôme Id...
PQCRYPTO
2010
250views Cryptology» more  PQCRYPTO 2010»
15 years 4 months ago
Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles
Abstract. We propose a variant of the “bonsai tree” signature scheme, a latticebased existentially unforgeable signature scheme in the standard model. Our construction offers ...
Markus Rückert