Skip header Section
Skip Bibliometrics Section
Complexity of Lattice ProblemsMarch 2002
- Authors:
- Daniele Micciancio,
- S. Goldwasser
Abstract
No abstract available.
Cited By
- Hasabelnaby M and Chaaban A (2022). Multi-Pair Computation for Two-Way Intra Cloud Radio-Access Network Communications, IEEE Transactions on Wireless Communications, 21:7, (5586-5599), Online publication date: 1-Jul-2022.
Bhattacharyya A, Bonnet É, Egri L, Ghoshal S, S. K, Lin B, Manurangsi P and Marx D (2021). Parameterized Intractability of Even Set and Shortest Vector Problem, Journal of the ACM, 68:3, (1-40), Online publication date: 30-Jun-2021.- Li J On the Smallest Ratio Problem of Lattice Bases Proceedings of the 2021 on International Symposium on Symbolic and Algebraic Computation, (289-296)
- Frank T, Haik O, Jumabayeva A, Allebach J and Yitzhaky Y (2020). New Design for Compact Color Screen Sets for High-End Digital Color Press, IEEE Transactions on Image Processing, 29, (3023-3038), Online publication date: 1-Jan-2020.
- Gao W, Chen L, Hu Y, Newton C, Wang B and Chen J (2019). Lattice-based deniable ring signatures, International Journal of Information Security, 18:3, (355-370), Online publication date: 1-Jun-2019.
- Li J and Nguyen P Computing a Lattice Basis Revisited Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, (275-282)
- Wang H, Feng Y, Ding Y and Tang S (2019). A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE, Soft Computing - A Fusion of Foundations, Methodologies and Applications, 23:5, (1735-1744), Online publication date: 1-Mar-2019.
- Herold G, Kirshanova E and May A (2018). On the asymptotic complexity of solving LWE, Designs, Codes and Cryptography, 86:1, (55-83), Online publication date: 1-Jan-2018.
- Silva D, Pivaro G, Fraidenraich G and Aazhang B (2017). On Integer-Forcing Precoding for the Gaussian MIMO Broadcast Channel, IEEE Transactions on Wireless Communications, 16:7, (4476-4488), Online publication date: 1-Jul-2017.
- Dean T and Goldsmith A (2017). Physical-Layer Cryptography Through Massive MIMO, IEEE Transactions on Information Theory, 63:8, (5419-5436), Online publication date: 1-Aug-2017.
- Pilaram H and Eghlidos T (2017). An Efficient Lattice Based Multi-Stage Secret Sharing Scheme, IEEE Transactions on Dependable and Secure Computing, 14:1, (2-8), Online publication date: 1-Jan-2017.
- Modaresi S, Kılınç M and Vielma J (2016). Intersection cuts for nonlinear integer programming, Mathematical Programming: Series A and B, 155:1-2, (575-611), Online publication date: 1-Jan-2016.
- Ouaknine J, Pouly A, Sousa-Pinto J and Worrell J Solvability of Matrix-Exponential Equations Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, (798-806)
- Wen J, Zhou B, Mow W and Chang X (2016). An Efficient Algorithm for Optimally Solving a Shortest Vector Problem in Compute-and-Forward Design, IEEE Transactions on Wireless Communications, 15:10, (6541-6555), Online publication date: 1-Oct-2016.
- Hadian Dehkordi M and Ghasemi R (2016). A Lightweight Public Verifiable Multi Secret Sharing Scheme Using Short Integer Solution, Wireless Personal Communications: An International Journal, 91:3, (1459-1469), Online publication date: 1-Dec-2016.
- Goldwasser S and Tauman Kalai Y Cryptographic Assumptions Proceedings, Part I, of the 13th International Conference on Theory of Cryptography - Volume 9562, (505-522)
- Jarvis K and Nevins M (2015). ETRU, Designs, Codes and Cryptography, 74:1, (219-242), Online publication date: 1-Jan-2015.
- Kim K and Jeong I (2015). A new certificateless signature scheme under enhanced security models, Security and Communication Networks, 8:5, (801-810), Online publication date: 25-Mar-2015.
- Yan J, Wang L, Dong M, Yang Y and Yao W (2015). Identity-based signcryption from lattices, Security and Communication Networks, 8:18, (3751-3770), Online publication date: 1-Dec-2015.
- Wang M An Improved Analysis of Broadcast Attacks on the GGH Cryptosystem Revised Selected Papers of the 16th International Workshop on Information Security Applications - Volume 9503, (146-158)
- Crépeau C and Kazmi R Zero-Knowledge Interactive Proof Systems for New Lattice Problems Proceedings of the 15th IMA International Conference on Cryptography and Coding - Volume 9496, (152-169)
- Józsa C, Kolumbán G, Vidal A, Martínez-Zaldívar F and González A (2015). Parallel sphere detector algorithm providing optimal MIMO detection on massively parallel architectures, Concurrency and Computation: Practice & Experience, 27:17, (4993-5018), Online publication date: 10-Dec-2015.
- Ding D, Zhu G and Wang X A Genetic Algorithm for Searching the Shortest Lattice Vector of SVP Challenge Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, (823-830)
- Plantard T, Susilo W and Zhang Z (2015). LLL for ideal lattices, Designs, Codes and Cryptography, 76:2, (325-344), Online publication date: 1-Aug-2015.
- Wang Q and Chen S (2015). Attribute-based signature for threshold predicates from lattices, Security and Communication Networks, 8:5, (811-821), Online publication date: 25-Mar-2015.
- Fontein F, Schneider M and Wagner U (2014). PotLLL, Designs, Codes and Cryptography, 73:2, (355-368), Online publication date: 1-Nov-2014.
- Albrecht M, Faugére J, Fitzpatrick R, Perret L, Todo Y and Xagawa K Practical Cryptanalysis of a Public-Key Encryption Scheme Based on New Multivariate Quadratic Assumptions Proceedings of the 17th International Conference on Public-Key Cryptography --- PKC 2014 - Volume 8383, (446-464)
- Ding D and Zhu G A Simulated Annealing Algorithm for SVP Challenge Through y-Sparse Representations of Short Lattice Vectors Revised Selected Papers of the 6th International Conference on Trusted Systems - Volume 9473, (51-69)
- Fukshansky L and Sun X (2014). On the Geometry of Cyclic Lattices, Discrete & Computational Geometry, 52:2, (240-259), Online publication date: 1-Sep-2014.
- Haviv I and Regev O On the lattice isomorphism problem Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, (391-404)
- García-Morchón O, Gómez-Pérez D, Gutiérrez J, Rietman R and Tolhuizen L The MMO problem Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, (186-193)
- Li W New Variants of Lattice Problems and Their NP-Hardness Proceedings of the 10th International Conference on Information Security Practice and Experience - Volume 8434, (511-523)
- Hu G, Pan Y and Zhang F Solving Random Subset Sum Problem by lp-norm SVP Oracle Proceedings of the 17th International Conference on Public-Key Cryptography --- PKC 2014 - Volume 8383, (399-410)
- Meyer A (2013). On the number of lattice points in a small sphere and a recursive lattice decoding algorithm, Designs, Codes and Cryptography, 66:1-3, (375-390), Online publication date: 1-Jan-2013.
- Dadush D and Micciancio D Algorithms for the densest sub-lattice problem Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms, (1103-1122)
- Dadush D and Kun G Lattice sparsification and the approximate closest vector problem Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms, (1088-1102)
- Georgescu A Anonymous lattice-based broadcast encryption Proceedings of the 2013 international conference on Information and Communication Technology, (353-362)
- Chen W, Peng L, Wang J, Li F, Tang M, Xiong W and Wang S (2013). Inapproximability results for the minimum integral solution problem with preprocessing over l∞ norm, Theoretical Computer Science, 478, (127-131), Online publication date: 1-Mar-2013.
- Cheng Q and Zhuang J (2013). On certain computations of Pisot numbers, Information Processing Letters, 113:8, (271-275), Online publication date: 1-Apr-2013.
- Hu G and Pan Y Improvements on Reductions among Different Variants of SVP and CVP Revised Selected Papers of the 14th International Workshop on Information Security Applications - Volume 8267, (39-51)
- Camenisch J, Neven G and Rückert M Fully anonymous attribute tokens from lattices Proceedings of the 8th international conference on Security and Cryptography for Networks, (57-75)
- Cohen G, Shpilka A and Tal A On the degree of univariate polynomials over the integers Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, (409-427)
- Buchheim C, Caprara A and Lodi A (2012). An effective branch-and-bound algorithm for convex quadratic integer programming, Mathematical Programming: Series A and B, 135:1-2, (369-395), Online publication date: 1-Oct-2012.
- Micciancio D The geometry of lattice cryptography Foundations of security analysis and design VI, (185-210)
- Aggarwal D and Maurer U The leakage-resilience limit of a computational problem is equal to its unpredictability entropy Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security, (686-701)
- Novocin A, Stehlé D and Villard G An LLL-reduction algorithm with quasi-linear time complexity Proceedings of the forty-third annual ACM symposium on Theory of computing, (403-412)
- Dubey C and Holenstein T Approximating the closest vector problem using an approximate shortest vector oracle Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques, (184-193)
- Hanrot G, Pujol X and Stehlé D Algorithms for the shortest and closest lattice vector problems Proceedings of the Third international conference on Coding and cryptology, (159-190)
- Malekian E and Zakerolhosseini A NTRU-like public key cryptosystems beyond dedekind domain up to alternative algebra Transactions on computational science X, (25-41)
- Cayrel P, Lindner R, Rückert M and Silva R Improved zero-knowledge identification with lattices Proceedings of the 4th international conference on Provable security, (1-17)
- Hermans J, Schneider M, Buchmann J, Vercauteren F and Preneel B Parallel shortest lattice vector enumeration on graphics cards Proceedings of the Third international conference on Cryptology in Africa, (52-68)
- Rückert M Adaptively secure identity-based identification from lattices without random oracles Proceedings of the 7th international conference on Security and cryptography for networks, (345-362)
- Cash D, Hofheinz D, Kiltz E and Peikert C Bonsai trees, or how to delegate a lattice basis Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques, (523-552)
- Haviv I and Regev O The Euclidean distortion of flat tori Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques, (232-245)
- Micciancio D and Voulgaris P Faster exponential time algorithms for the shortest vector problem Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms, (1468-1480)
- Micciancio D and Voulgaris P A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations Proceedings of the forty-second ACM symposium on Theory of computing, (351-358)
- Plantard T and Susilo W Recursive lattice reduction Proceedings of the 7th international conference on Security and cryptography for networks, (329-344)
- Agrawal S, Boneh D and Boyen X Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE Proceedings of the 30th annual conference on Advances in cryptology, (98-115)
- Agrawal S, Boneh D and Boyen X Efficient lattice (H)IBE in the standard model Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques, (553-572)
- Buchheim C, Caprara A and Lodi A An effective branch-and-bound algorithm for convex quadratic integer programming Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization, (285-298)
- May A and Ritzenhofen M Implicit Factoring Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09, (1-14)
- Vetter H, Ponnampalam V, Sandell M and Hoeher P (2009). Fixed complexity LLL algorithm, IEEE Transactions on Signal Processing, 57:4, (1634-1637), Online publication date: 1-Apr-2009.
- Grover P, Sahai A and Park S The finite-dimensional Witsenhausen counterexample Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, (604-613)
- Nguyen P and Stehlé D (2009). Low-dimensional lattice basis reduction revisited, ACM Transactions on Algorithms, 5:4, (1-48), Online publication date: 1-Oct-2009.
- Regev O (2009). On lattices, learning with errors, random linear codes, and cryptography, Journal of the ACM, 56:6, (1-40), Online publication date: 1-Sep-2009.
- Stehlé D, Steinfeld R, Tanaka K and Xagawa K Efficient Public Key Encryption Based on Ideal Lattices Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology, (617-635)
- Backes W and Wetzel S Parallel Lattice Basis Reduction Using a Multi-threaded Schnorr-Euchner LLL Algorithm Proceedings of the 15th International Euro-Par Conference on Parallel Processing, (960-973)
- Hartung R Cryptography Based on Quadratic Forms Research in Cryptology, (52-64)
- Gama N and Nguyen P Predicting lattice reduction Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology, (31-51)
- Peikert C and Vaikuntanathan V Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology, (536-553)
- Micciancio D Efficient reductions among lattice problems Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, (84-93)
- Gama N and Nguyen P Finding short lattice vectors within mordell's inequality Proceedings of the fortieth annual ACM symposium on Theory of computing, (207-216)
- Gentry C, Peikert C and Vaikuntanathan V Trapdoors for hard lattices and new cryptographic constructions Proceedings of the fortieth annual ACM symposium on Theory of computing, (197-206)
- Hayashi S and Tada M (2008). A Digital Signature Scheme Based on NP-Complete Lattice Problems, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E91-A:5, (1253-1264), Online publication date: 1-May-2008.
- Arvind V and Joglekar P Algorithmic problems for metrics on permutation groups Proceedings of the 34th conference on Current trends in theory and practice of computer science, (136-147)
- Kawachi A, Tanaka K and Xagawa K Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology, (372-389)
- Han D, Kim M and Yeom Y Cryptanalysis of the Paeng-Jung-Ha cryptosystem from PKC 2003 Proceedings of the 10th international conference on Practice and theory in public-key cryptography, (107-117)
- Haviv I and Regev O Tensor-based hardness of the shortest vector problem to within almost polynomial factors Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, (469-477)
- Hayashi S and Tada M (2007). New NP-Complete Problems Associated with Lattices, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E90-A:5, (941-948), Online publication date: 1-May-2007.
- Micciancio D (2007). Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions, Computational Complexity, 16:4, (365-411), Online publication date: 1-Dec-2007.
- Blömer J and Naewe S Sampling methods for shortest vectors, closest vectors and successive minima Proceedings of the 34th international conference on Automata, Languages and Programming, (65-77)
- Hanrot G and Stehlé D Improved analysis of Kannan's shortest lattice vector algorithm Proceedings of the 27th annual international cryptology conference on Advances in cryptology, (170-186)
- Kawachi A, Tanaka K and Xagawa K Multi-bit cryptosystems based on lattice problems Proceedings of the 10th international conference on Practice and theory in public-key cryptography, (315-329)
- Gutierrez J and Ibeas Á (2007). Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits, Designs, Codes and Cryptography, 45:2, (199-212), Online publication date: 1-Nov-2007.
- Lyubashevsky V and Micciancio D Generalized compact knapsacks are collision resistant Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II, (144-155)
- Gama N, Howgrave-Graham N, Koy H and Nguyen P Rankin's constant and blockwise lattice reduction Proceedings of the 26th annual international conference on Advances in Cryptology, (112-130)
- Nguyen P and Stehlé D LLL on the average Proceedings of the 7th international conference on Algorithmic Number Theory, (238-256)
- Liu Y, Lyubashevsky V and Micciancio D On bounded distance decoding for general lattices Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation, (450-461)
- Bogdanov A and Trevisan L (2006). Average-case complexity, Foundations and Trends® in Theoretical Computer Science, 2:1, (1-106), Online publication date: 1-Oct-2006.
- Regev O and Rosen R Lattice problems and norm embeddings Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing, (447-456)
- Schnorr C (2006). Fast LLL-type lattice reduction, Information and Computation, 204:1, (1-25), Online publication date: 1-Jan-2006.
- Khot S (2006). Hardness of approximating the Shortest Vector Problem in high ℓp norms, Journal of Computer and System Sciences, 72:2, (206-219), Online publication date: 1-Mar-2006.
- Blackburn S, Gomez-Perez D, Gutierrez J and Shparlinski I (2006). Reconstructing noisy polynomial evaluation in residue rings, Journal of Algorithms, 61:2, (47-59), Online publication date: 1-Nov-2006.
- Regev O Lattice-based cryptography Proceedings of the 26th annual international conference on Advances in Cryptology, (131-141)
- Nguyen P and Regev O Learning a parallelepiped Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques, (271-288)
- Peikert C and Rosen A Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices Proceedings of the Third conference on Theory of Cryptography, (145-166)
- Nguyêñ P and Stern J Adapting density attacks to low-weight knapsacks Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security, (41-58)
- Gomez D, Gutierrez J and Ibeas A Cryptanalysis of the quadratic generator Proceedings of the 6th international conference on Cryptology in India, (118-129)
- Takashima K Practical modifications of leadbitter et al.'s repeated-bits side-channel analysis on (EC)DSA Proceedings of the 6th international conference on Information Security Applications, (259-270)
- Gómez D, Gutierrez J, Ibeas Á, Martínez C and Beivide R On Finding a Shortest Path in Circulant Graphs with Two Jumps Proceedings of the 11th Annual International Conference on Computing and Combinatorics - Volume 3595, (777-786)
- Nguên P and Stehlé D Floating-Point LLL revisited Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques, (215-233)
- Hallgren S Fast quantum algorithms for computing the unit group and class group of a number field Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, (468-474)
- Regev O On lattices, learning with errors, random linear codes, and cryptography Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, (84-93)
- Micciancio D The RSA group is pseudo-free Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques, (387-403)
- Regev O New lattice based cryptographic constructions Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, (407-416)
- Micciancio D Improved cryptographic hash functions with worst-case/average-case connection Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, (609-618)
Recommendations
Lattice implication ordered semigroups
From the viewpoint of semantics, lattice implication algebras provide a basis to establish lattice-valued logic with truth value in a relatively general lattice. In this paper, we first introduce two notions of lattice implication n-ordered semigroup ...
Lattice pseudoeffect algebras as double residuated structures
Special Issue on Evolutionary Fuzzy SystemsPseudoeffect algebras are partial algebraic structures which are non-commutative generalizations of effect algebras. The main result of the paper is a characterization of lattice pseudoeffect algebras in terms of so-called pseudo Sasaki algebras. In ...