Daniele Micciancio  Home/Search
Context
Related
| iacr.org/2004/286.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iacr.org/2004/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We investigate the average case complexity of a generalization of the compact knapsack problem to arbitrary rings: given m (random) ring elements a1, ..., am ∈ R and a (random) target value b ∈ R, find coefficients x1, ..., xm ∈ S (where S is an appropriately chosen subset of R) such that ∑ ai · xi = b. We consider compact versions of the generalized knapsack where the set S is large and the number of weights m is small. Most variants of this problem considered in the... (Update)
Similar documents based on text: More All
0.3: A Linear Space Algorithm for Computing the Hermite Normal Form - Micciancio, Warinschi (2001) (Correct)
0.2: Composition and Efficiency Tradeoffs for Forward-Secure.. - Malkin, Micciancio.. (2001) (Correct)
0.2: "Pseudo-Random" Number Generation within.. - Bellare, Goldwasser, .. (1997) (Correct)
BibTeX entry: (Update)
@misc{ micciancio-generalized,
author = "Daniele Micciancio",
title = "Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions
from Worst-Case Complexity Assumptions",
url = "citeseer.ist.psu.edu/micciancio04generalized.html" }
Citations (may not include all citations):773 Reducibility among combinatorial problems (context) - Karp - 1972
419 How to construct random functions (context) - Goldreich, Goldwasser et al. - 1986
208 Universal one-way hash functions and their cryptographic app.. - Naor, Yung - 1989
124 Bit commitment using pseudorandomness - Naor - 1991
122 How to recycle random bits - Impagliazzo, Zuckerman - 1989
120 The hardness of approximate optima in lattices (context) - Arora, Babai et al. - 1997
103 Factoring polynomials with rational coecients (context) - Lenstra, Lenstra et al. - 1982
90 A pseudorandom generator from any one-way function - Hastad, Impagliazzo et al. - 1999
84 Generating hard instances of lattice problems (context) - Ajtai - 1996
70 Hiding information and signatures in trapdoor knapsacks (context) - Merkle, Hellman - 1978
66 On Lovasz' lattice reduction and the nearest lattice point p.. (context) - Babai - 1986
60 Solving low-density subset sum problems (context) - Lagarias, Odlyzko - 1985
60 Lattice basis reduction: Improved practical algorithms and s.. - Schnorr, Euchner - 1991
53 One-way functions are necessary and sucient for secure signa.. (context) - Rompel - 1990
49 Improved low-density subset sum algorithms - Coster, Joux et al. - 1992
[Article contains additional citations not shown here]
Documents on the same site (http://eprint.iacr.org/2004/): More
The Security and Efficiency of Micciancio's Cryptosystem - Ludwig (2004) (Correct)
Entropic Security and the Encryption of High Entropy Messages - Dodis, Smith (2004) (Correct)
On Cheating Immune Secret Sharing - Braeken, Nikova, al. (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC