scientific article; zbMATH DE number 2120513

Daniele Micciancio, Shafi Goldwasser

Publication date: 1 December 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Combinatorial aspects of packing and covering (05B40)

Related Items

Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography, A chaotic lattice field theory in one dimension*, Local Testing of Lattices, Unnamed Item, Large algebraic integers, From approximate to exact integer programming, Reconstructing points of superelliptic curves over a prime finite field, Log-$\mathcal{S}$-unit lattices using explicit Stickelberger generators to solve approx ideal-SVP, The Random Phase Approximation for Interacting Fermi Gases in the Mean-Field Regime, A New Insight—Proxy Re-encryption Under LWE with Strong Anti-collusion, Norm relations and computational problems in number fields, A short basis of the Stickelberger ideal of a cyclotomic field, On elliptic curve $L$-functions integrated encryption scheme, Security and Trust in Sensor Networks, Revisiting Lattice Attacks on Overstretched NTRU Parameters, Unnamed Item, Short Bases of Lattices over Number Fields, Improved Zero-Knowledge Identification with Lattices, Predicting nonlinear pseudorandom number generators, Hermite’s Constant and Lattice Algorithms, Cryptographic Functions from Worst-Case Complexity Assumptions, Algorithmic Problems for Metrics on Permutation Groups, Intersection cuts for nonlinear integer programming: convexification techniques for structured sets, Predicting Lattice Reduction, Cryptography Based on Quadratic Forms: Complexity Considerations, Torsion part of $\mathbb{Z}$-module, A trace map attack against special ring-LWE samples, The inapproximability of lattice and coding problems with preprocessing, Lattice-based linearly homomorphic signatures in the standard model, Divisible $\mathbb{Z}$-modules, Lattice of $\mathbb{Z}$-module, Zero-Knowledge Interactive Proof Systems for New Lattice Problems, Lattice-based fault attacks on deterministic signature schemes of ECDSA and EdDSA, Application of automorphic forms to lattice problems, Recovering zeros of polynomials modulo a prime, Post-quantum cryptography: lattice signatures, Rotated $A_n $-lattice codes of full diversity, Dense packings from algebraic number fields and codes, On ideal lattices, Gröbner bases and generalized hash functions, On some computational problems in local fields, A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme, Characterizing the performance of wireless communication architectures via basic Diophantine approximation bounds, On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography, Duplication free public keys based on SIS-type problems, Dual lattice of $\mathbb{Z}$-module lattice, Discrete Gaussian measures and new bounds of the smoothing parameter for lattices, List-decoding Barnes-Wall lattices, A Fast Phase-based Enumeration Algorithm for SVP Challenge Through $$y$$-Sparse Representations of Short Lattice Vectors, Lattice-based algorithms for number partitioning in the hard phase, Commutative group codes in $\mathbb R^4$, $\mathbb R^6$, $\mathbb R^8$ and $\mathbb R^{16}$-approaching the bound, Bonsai trees, or how to delegate a lattice basis, Improvements in closest point search based on dual HKZ-bases, Cryptanalysis of Boyen's attribute-based encryption scheme in TCC 2013, Algorithms for computing bases for 3-variable homogeneous integer-valued polynomials, PotLLL: a polynomial time version of LLL with deep insertions, On the number of lattice points in a small sphere and a recursive lattice decoding algorithm, Isomorphism theorem on vector spaces over a ring, On the asymptotic complexity of solving LWE, Greedy algorithm computing Minkowski reduced lattice bases with quadratic bit complexity of input vectors, On the equivalence of two post-quantum cryptographic families, A note on suborthogonal lattices, Convex minization over $\mathbb Z^2$, Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices, Simultaneous approximation problems of $p$-adic numbers and $p$-adic knapsack cryptosystems -- Alice in $p$-adic numberland, Hardness of approximating the closest vector problem with pre-processing, On projections of arbitrary lattices, The irreducible vectors of a lattice: some theory and applications, On the probability of generating a lattice, Recovering a sum of two squares decomposition, Cubic sieve congruence of the discrete logarithm problem, and fractional part sequences, Rotated $D_n$-lattices, STP-LWE: A variant of learning with error for a flexible encryption, On the geometry of cyclic lattices, Lattice-based completely non-malleable public-key encryption in the standard model, Submodule of free $\mathbb Z$-module, Lattices from maximal orders into quaternion algebras, The Reductions for the Approximating Covering Radius Problem, Two Efficient Tag-Based Encryption Schemes on Lattices, Simplified Revocable Hierarchical Identity-Based Encryption from Lattices, ETRU: NTRU over the Eisenstein integers, Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification, Algorithms for the Shortest and Closest Lattice Vector Problems, LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme, Vulnerable public keys in NTRU cryptosystem, Better path-finding algorithms in LPS Ramanujan graphs, A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE, Optimum commutative group codes, Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra, Restricted parameter range promise set cover problems are easy, On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in $\mathbb{Q}(\zeta_{2^s})$, Bounding the sum of square roots via lattice reduction, Fast LLL-type lattice reduction, Hardness of approximating the shortest vector problem in high $\ell_{p}$ norms, Nonembeddability theorems via Fourier analysis, The RSA group is pseudo-free, Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures, An effective branch-and-bound algorithm for convex quadratic integer programming, Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems, Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme, Split cuts and extended formulations for mixed integer conic quadratic programming, Optimal routing in double loop networks, Cryptographic Assumptions: A Position Paper, Lattice-based unidirectional infinite-use proxy re-signatures with private re-signature key, Matrix of $\mathbb{Z}$-module, Local formulas for Ehrhart coefficients from lattice tiles, Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits, Sampling methods for shortest vectors, closest vectors and successive minima, An LWE-based verifiable threshold secret sharing scheme, Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures, Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle, Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures, On the ideal shortest vector problem over random rational primes, The Geometry of Lattice Cryptography, Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2, A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengths, Quotient Module of Z-module, Free ℤ-module, Computing the covering radius of a polytope with an application to lonely runners, Formalization of Integral Linear Space, Z-modules, Worst-case to average-case reductions for module lattices, The remote set problem on lattices, Torsion $\mathbb Z$-module and torsion-free $\mathbb Z$-module, Search for combinatorial objects using lattice algorithms -- revisited, Embedded lattice and properties of Gram matrix

Uses Software

NTRU