On the public citation graph

On the Lattice Smoothing Parameter Problem

0 signed · 58 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jcss.1999.1686openalex-snapshot
On the Limits of Nonapproximability of Lattice Problems
inferredcites →https://doi.org/10.1007/3-540-48910-x_5openalex-snapshot
On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
inferredcites →https://doi.org/10.1007/978-3-540-45146-4_17openalex-snapshot
Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More
inferredcites →https://doi.org/10.1007/978-3-540-78524-8_28openalex-snapshot
Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model
inferredcites →https://doi.org/10.1007/978-3-642-13190-5_27openalex-snapshot
Bonsai Trees, or How to Delegate a Lattice Basis
inferredcites →https://doi.org/10.1007/978-3-642-14623-7_5openalex-snapshot
An Efficient and Parallel Gaussian Sampler for Lattices
inferredcites →https://doi.org/10.1007/978-3-642-14623-7_7openalex-snapshot
Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
inferredcites →https://doi.org/10.1007/bf01445125openalex-snapshot
New bounds in some transference theorems in the geometry of numbers
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1007/bf02574039openalex-snapshot
Inequalities for convex bodies and polar reciprocal lattices inR n
inferredcites →https://doi.org/10.1007/bf02711514openalex-snapshot
Inequalities for convex bodies and polar reciprocal lattices inR n II: Application ofK-convexity
inferredcites →https://doi.org/10.1007/s00037-005-0193-yopenalex-snapshot
The complexity of the covering radius problem
inferredcites →https://doi.org/10.1007/s00037-008-0251-3openalex-snapshot
Limits on the Hardness of Lattice Problems in ℓ p Norms
inferredcites →https://doi.org/10.1007/s00145-002-0113-0openalex-snapshot
Trading Help for Interaction in Statistical Zero-Knowledge Proofs
inferredcites →https://doi.org/10.1007/s001459900018openalex-snapshot
A language-dependent cryptographic primitive
inferredcites →https://doi.org/10.1007/s001459900030openalex-snapshot
Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities
inferredcites →https://doi.org/10.1016/0020-0190(87)90232-8openalex-snapshot
Does co-NP have short interactive proofs?
inferredcites →https://doi.org/10.1017/9781009701853.002openalex-snapshot
An Elementary Introduction to Modern Convex Geometry
inferredcites →https://doi.org/10.1109/focs.2011.12openalex-snapshot
Efficient Fully Homomorphic Encryption from (Standard) LWE
inferredcites →https://doi.org/10.1109/focs.2011.31openalex-snapshot
Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
inferredcites →https://doi.org/10.1137/0217018openalex-snapshot
Complexity Measures for Public-Key Cryptosystems
inferredcites →https://doi.org/10.1137/080733954openalex-snapshot
Lossy Trapdoor Functions and Their Applications
inferredcites →https://doi.org/10.1137/s0097539705447360openalex-snapshot
Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
inferredcites →https://doi.org/10.1145/1039488.1039490openalex-snapshot
New lattice-based cryptographic constructions
inferredcites →https://doi.org/10.1145/1089023.1089025openalex-snapshot
Lattice problems in NP ∩ coNP
inferredcites →https://doi.org/10.1145/12130.12137openalex-snapshot
Private coins versus public coins in interactive proof systems
inferredcites →https://doi.org/10.1145/1374376.1374407openalex-snapshot
Trapdoors for hard lattices and new cryptographic constructions
inferredcites →https://doi.org/10.1145/1536414.1536440openalex-snapshot
Fully homomorphic encryption using ideal lattices
inferredcites →https://doi.org/10.1145/1536414.1536461openalex-snapshot
Public-key cryptosystems from the worst-case shortest vector problem
inferredcites →https://doi.org/10.1145/1568318.1568324openalex-snapshot
On lattices, learning with errors, random linear codes, and cryptography
inferredcites →https://doi.org/10.1145/1806689.1806739openalex-snapshot
A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
inferredcites →https://doi.org/10.1145/276698.276852openalex-snapshot
Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge
inferredcites →https://doi.org/10.1145/636865.636868openalex-snapshot
A complete problem for statistical zero knowledge
inferredcites →https://doi.org/10.3934/amc.2015.9.311openalex-snapshot
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
inferredcites →https://doi.org/10.4230/dagsemproc.08491.4openalex-snapshot
Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-03810-6_14openalex-snapshot
Two-Message Statistically Sender-Private OT from LWE
inferred← citeshttps://doi.org/10.1007/978-3-030-26948-7_4openalex-snapshot
Noninteractive Zero Knowledge for NP from (Plain) Learning with Errors
inferred← citeshttps://doi.org/10.1007/978-3-030-64834-3_13openalex-snapshot
Simpler Statistically Sender Private Oblivious Transfer from Ideals of Cyclotomic Integers
inferred← citeshttps://doi.org/10.1007/978-3-031-38271-0_31openalex-snapshot
Revisiting Lattice Tiling Decomposition and Dithered Quantisation
inferred← citeshttps://doi.org/10.1007/978-3-031-86602-9_3openalex-snapshot
Discrete Gaussian Sampling for BKZ-Reduced Basis
inferred← citeshttps://doi.org/10.1007/978-3-032-25327-9_4openalex-snapshot
Solving the Shortest Vector Problem in $$2^{0.63269n+o(n)}$$ Time on Random Lattices
inferred← citeshttps://doi.org/10.1007/978-3-319-76581-5_21openalex-snapshot
New (and Old) Proof Systems for Lattice Problems
inferred← citeshttps://doi.org/10.1007/s00200-020-00417-zopenalex-snapshot
Discrete Gaussian measures and new bounds of the smoothing parameter for lattices
inferred← citeshttps://doi.org/10.1109/access.2023.3294844openalex-snapshot
Star-Specific Key-Homomorphic PRFs From Learning With Linear Regression
inferred← citeshttps://doi.org/10.1109/ccc.2014.18openalex-snapshot
On the Closest Vector Problem with a Distance Guarantee
inferred← citeshttps://doi.org/10.1109/focs.2016.55openalex-snapshot
Towards Strong Reverse Minkowski-Type Inequalities for Lattices
inferred← citeshttps://doi.org/10.1109/tit.2018.2875004openalex-snapshot
AWGN-Goodness Is Enough: Capacity-Achieving Lattice Codes Based on Dithered Probabilistic Shaping
inferred← citeshttps://doi.org/10.1109/tit.2023.3266033openalex-snapshot
Optimal Rate-Limited Secret Key Generation From Gaussian Sources Using Lattices
inferred← citeshttps://doi.org/10.1145/2746539.2746606openalex-snapshot
Solving the Shortest Vector Problem in 2 n Time Using Discrete Gaussian Sampling
inferred← citeshttps://doi.org/10.1145/3055399.3055434openalex-snapshot
A reverse Minkowski theorem
inferred← citeshttps://doi.org/10.1371/journal.pone.0328688openalex-snapshot
New bounds of the smoothing parameter for lattices
inferred← citeshttps://doi.org/10.1515/jmc-2020-0076openalex-snapshot
Towards a Ring Analogue of the Leftover Hash Lemma
inferred← citeshttps://doi.org/10.3390/psf2022005019openalex-snapshot
Information Properties of a Random Variable Decomposition through Lattices
inferred← citeshttps://doi.org/10.4007/annals.2024.199.1.1openalex-snapshot
A reverse Minkowski theorem
inferred← citeshttps://doi.org/10.48550/arxiv.1409.8063openalex-snapshot
On the Closest Vector Problem with a Distance Guarantee
inferred← citeshttps://doi.org/10.48550/arxiv.1412.7994openalex-snapshot
Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian Sampling
inferred← citeshttps://doi.org/10.48550/arxiv.2002.07955openalex-snapshot
Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding
inferred← citeshttps://doi.org/10.70675/c36a63dbz469ez406azba4fza2fd2c7ca09bopenalex-snapshot
Classical and quantum cryptanalysis for Euclidean lattices and subset sums
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.