On the public citation graph
New bounds in some transference theorems in the geometry of numbers
0 signed · 421 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-642-62035-5openalex-snapshot
An Introduction to the Geometry of Numbers
inferredcites →https://doi.org/10.1007/bf01472136openalex-snapshot
Pontryagin duality for subgroups and quotients of nuclear spaces
inferredcites →https://doi.org/10.1007/bf02122554openalex-snapshot
Dual vectors and lower bounds for the nearest lattice point problem
inferredcites →https://doi.org/10.1007/bf02128669openalex-snapshot
Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
inferredcites →https://doi.org/10.1007/bf02579403openalex-snapshot
On Lovász’ lattice reduction and the nearest lattice point problem
inferredcites →https://doi.org/10.1007/bfb0089147openalex-snapshot
Additive Subgroups of Topological Vector Spaces
inferredcites →https://doi.org/10.1112/blms/4.2.231openalex-snapshot
ABSTRACT HARMONIC ANALYSIS, VOL. II
inferredcites →https://doi.org/10.4064/sm-80-2-119-128openalex-snapshot
Closed subgroups of nuclear spaces are weakly closed
inferredcites →https://doi.org/10.5209/rev_rema.1989.v2.18061openalex-snapshot
Polar lattices from the point of view of nuclear spaces
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpa.10082openalex-snapshot
Stable systolic inequalities and cohomology products
inferred← citeshttps://doi.org/10.1002/ett.4540openalex-snapshot
Secure cloud‐based data storage scheme using postquantum integer lattices‐based signcryption for IoT applications
inferred← citeshttps://doi.org/10.1002/sec.1685openalex-snapshot
Efficient identity‐based leveled fully homomorphic encryption from RLWE
inferred← citeshttps://doi.org/10.1002/sec.1766openalex-snapshot
Strong designated verifier signature scheme from lattices in the standard model
inferred← citeshttps://doi.org/10.1006/jcss.1999.1686openalex-snapshot
On the Limits of Nonapproximability of Lattice Problems
inferred← citeshttps://doi.org/10.1007/10722028_1openalex-snapshot
The Complexity of Some Lattice Problems
inferred← citeshttps://doi.org/10.1007/11830924_41openalex-snapshot
On Bounded Distance Decoding for General Lattices
inferred← citeshttps://doi.org/10.1007/3-540-44670-2_12openalex-snapshot
The Two Faces of Lattices in Cryptology
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_22openalex-snapshot
Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices
inferred← citeshttps://doi.org/10.1007/3-540-45418-7_18openalex-snapshot
Information Leakage Attacks against Smart Card Implementations of the Elliptic Curve Digital Signature Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-48686-0_11openalex-snapshot
A New Transference Theorem in the Geometry of Numbers
inferred← citeshttps://doi.org/10.1007/978-3-030-03807-6_4openalex-snapshot
On Basing Search SIVP on NP-Hardness
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_7openalex-snapshot
Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs
inferred← citeshttps://doi.org/10.1007/978-3-030-34621-8_17openalex-snapshot
Homomorphic Encryption for Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-44223-1_14openalex-snapshot
Efficient Post-quantum SNARKs for RSIS and RLWE and Their Applications to Privacy
inferred← citeshttps://doi.org/10.1007/978-3-030-44329-0openalex-snapshot
Theta Invariants of Euclidean Lattices and Infinite-Dimensional Hermitian Vector Bundles over Arithmetic Curves
inferred← citeshttps://doi.org/10.1007/978-3-030-45724-2_12openalex-snapshot
On the Quantum Complexity of the Continuous Hidden Subgroup Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-56880-1_16openalex-snapshot
A Non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-030-56880-1_17openalex-snapshot
Practical Product Proofs for Lattice Commitments
inferred← citeshttps://doi.org/10.1007/978-3-030-56880-1_9openalex-snapshot
Random Self-reducibility of Ideal-SVP via Arakelov Random Walks
inferred← citeshttps://doi.org/10.1007/978-3-030-57559-5_3openalex-snapshot
Chapter II: Minima and Slopes of Rigid Adelic Spaces
inferred← citeshttps://doi.org/10.1007/978-3-030-57559-5_5openalex-snapshot
Chapter IV: Euclidean Lattices, Theta Invariants, and Thermodynamic Formalism
inferred← citeshttps://doi.org/10.1007/978-3-030-61303-7_2openalex-snapshot
Characterizing the Performance of Wireless Communication Architectures via Basic Diophantine Approximation Bounds
inferred← citeshttps://doi.org/10.1007/978-3-030-64834-3_10openalex-snapshot
Towards Classical Hardness of Module-LWE: The Linear Rank Case
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-030-75245-3_9openalex-snapshot
Shorter Lattice-Based Zero-Knowledge Proofs via One-Time Commitments
inferred← citeshttps://doi.org/10.1007/978-3-030-75248-4_10openalex-snapshot
Round-Optimal Verifiable Oblivious Pseudorandom Functions from Ideal Lattices
inferred← citeshttps://doi.org/10.1007/978-3-030-86872-7_3openalex-snapshot
Cubic Forms via Weyl Differencing
inferred← citeshttps://doi.org/10.1007/978-3-030-92068-5_6openalex-snapshot
Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy
inferred← citeshttps://doi.org/10.1007/978-3-030-92068-5_8openalex-snapshot
Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations
inferred← citeshttps://doi.org/10.1007/978-3-030-92641-0_11openalex-snapshot
Black-Box Accumulation Based on Lattices
inferred← citeshttps://doi.org/10.1007/978-3-030-97121-2_14openalex-snapshot
Two-Round Oblivious Linear Evaluation from Learning with Errors
inferred← citeshttps://doi.org/10.1007/978-3-030-97131-1_17openalex-snapshot
Efficient Lattice-Based Blind Signatures via Gaussian One-Time Signatures
inferred← citeshttps://doi.org/10.1007/978-3-031-07085-3_6openalex-snapshot
Batch-OT with Optimal Rate
inferred← citeshttps://doi.org/10.1007/978-3-031-09234-3_24openalex-snapshot
Covert Authentication from Lattices
inferred← citeshttps://doi.org/10.1007/978-3-031-15255-9_9openalex-snapshot
Quantum-Resistant 1-out-of-N Oblivious Signatures from Lattices
inferred← citeshttps://doi.org/10.1007/978-3-031-15979-4_3openalex-snapshot
Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More General
inferred← citeshttps://doi.org/10.1007/978-3-031-15982-4_21openalex-snapshot
Statistically Sender-Private OT from LPN and Derandomization
inferred← citeshttps://doi.org/10.1007/978-3-031-17146-8_25openalex-snapshot
Puncturable Signature: A Generic Construction and Instantiations
inferred← citeshttps://doi.org/10.1007/978-3-031-22972-5_3openalex-snapshot
Hawk: Module LIP Makes Lattice Signatures Fast, Compact and Simple
inferred← citeshttps://doi.org/10.1007/978-3-031-22972-5_4openalex-snapshot
BLOOM: Bimodal Lattice One-out-of-Many Proofs and Applications
inferred← citeshttps://doi.org/10.1007/978-3-031-29371-9_23openalex-snapshot
Preimage Sampling in the Higher-bit Approximate Setting with a Non-spherical Gaussian Sampler
inferred← citeshttps://doi.org/10.1007/978-3-031-33488-7_24openalex-snapshot
Shorter and Faster Identity-Based Signatures with Tight Security in the (Q)ROM from Lattices
inferred← citeshttps://doi.org/10.1007/978-3-031-35305-5_8openalex-snapshot
Enumeration and Unimodular Equivalence of Empty Delta-Modular Simplices
inferred← citeshttps://doi.org/10.1007/978-3-031-37679-5_10openalex-snapshot
The Special Case of Cyclotomic Fields in Quantum Algorithms for Unit Groups
inferred← citeshttps://doi.org/10.1007/978-3-031-37679-5_15openalex-snapshot
Concrete Security from Worst-Case to Average-Case Lattice Reductions
inferred← citeshttps://doi.org/10.1007/978-3-031-38545-2_12openalex-snapshot
Lattice Signature with Efficient Protocols, Application to Anonymous Credentials
inferred← citeshttps://doi.org/10.1007/978-3-031-38545-2_13openalex-snapshot
A Framework for Practical Anonymous Credentials from Lattices
inferred← citeshttps://doi.org/10.1007/978-3-031-48624-1_2openalex-snapshot
On the Multi-user Security of LWE-Based NIKE
inferred← citeshttps://doi.org/10.1007/978-3-031-57722-2_9openalex-snapshot
Ring/Module Learning with Errors Under Linear Leakage – Hardness and Applications
inferred← citeshttps://doi.org/10.1007/978-3-031-57725-3_5openalex-snapshot
On Algebraic Embedding for Unstructured Lattices
inferred← citeshttps://doi.org/10.1007/978-3-031-58740-5_5openalex-snapshot
Constant-Round Simulation-Secure Coin Tossing Extension with Guaranteed Output
inferred← citeshttps://doi.org/10.1007/978-3-031-58754-2_10openalex-snapshot
Provable Dual Attacks on Learning with Errors
inferred← citeshttps://doi.org/10.1007/978-3-031-58868-6_10openalex-snapshot
Lattice-Based Threshold, Accountable, and Private Signature
inferred← citeshttps://doi.org/10.1007/978-3-031-62743-9_9openalex-snapshot
Phoenix: Hash-and-Sign with Aborts from Lattice Gadgets
inferred← citeshttps://doi.org/10.1007/978-3-031-64948-6_18openalex-snapshot
Certificateless Aggregate Signature Without Trapdoor for Cloud Storage
inferred← citeshttps://doi.org/10.1007/978-3-031-68376-3_10openalex-snapshot
Ring Signatures for Deniable AKEM: Gandalf’s Fellowship
inferred← citeshttps://doi.org/10.1007/978-3-031-68379-4_14openalex-snapshot
Provable Security Against Decryption Failure Attacks from LWE
inferred← citeshttps://doi.org/10.1007/978-3-031-68382-4_7openalex-snapshot
A Systematic Study of Sparse LWE
inferred← citeshttps://doi.org/10.1007/978-3-031-78020-2_9openalex-snapshot
Quantum Key-Revocable Dual-Regev Encryption, Revisited
inferred← citeshttps://doi.org/10.1007/978-3-031-91095-1_2openalex-snapshot
On Algebraic Homomorphic Encryption and Its Applications to Doubly-Efficient PIR
inferred← citeshttps://doi.org/10.1007/978-3-031-91820-9_15openalex-snapshot
Lattice-Based Proof-Friendly Signatures from Vanishing Short Integer Solutions
inferred← citeshttps://doi.org/10.1007/978-3-032-01855-7_12openalex-snapshot
Wagner’s Algorithm Provably Runs in Subexponential Time for $$\textrm{SIS}^\infty $$
inferred← citeshttps://doi.org/10.1007/978-3-032-01855-7_16openalex-snapshot
Improved Lattice Blind Signatures from Recycled Entropy
inferred← citeshttps://doi.org/10.1007/978-3-032-01878-6_14openalex-snapshot
A Quasi-polynomial Time Algorithm for the Extrapolated Dihedral Coset Problem over Power-of-Two Moduli
inferred← citeshttps://doi.org/10.1007/978-3-032-01878-6_17openalex-snapshot
LWE with Quantum Amplitudes: Algorithm, Hardness, and Oblivious Sampling
inferred← citeshttps://doi.org/10.1007/978-3-032-08124-7_7openalex-snapshot
Conditional Attribute-Based PRE: Definition and Construction from LWE
inferred← citeshttps://doi.org/10.1007/978-3-032-12296-4_11openalex-snapshot
Dimensional e$$\textsf{ROS}$$ion: Improving the $$\textsf{ROS}$$ Attack with Decomposition in Higher Bases
inferred← citeshttps://doi.org/10.1007/978-3-032-25327-9_3openalex-snapshot
Leftover Hash Lemma(s) Over Cyclotomic Rings
inferred← citeshttps://doi.org/10.1007/978-3-032-25327-9_5openalex-snapshot
A Gaussian Leftover Hash Lemma for Modules over Number Fields
inferred← citeshttps://doi.org/10.1007/978-3-032-25330-9_14openalex-snapshot
Lattice EPID with Efficient Revocation
inferred← citeshttps://doi.org/10.1007/978-3-032-25330-9_21openalex-snapshot
Fully Asymmetric Anamorphic Homomorphic Encryption from LWE
inferred← citeshttps://doi.org/10.1007/978-3-032-26731-3_1openalex-snapshot
Hardness of M-LWE with General Distributions and Applications to Leaky Variants
inferred← citeshttps://doi.org/10.1007/978-3-032-26731-3_11openalex-snapshot
Revisiting the Concrete Security of $$\mathrm {\textsc {{Falcon}}}$$-Type Signatures
inferred← citeshttps://doi.org/10.1007/978-3-032-26731-3_5openalex-snapshot
Efficient RLWE Based Chosen-Ciphertext Secure Dual-Receiver Encryption and Sender-Binding KEM in the Standard Model
inferred← citeshttps://doi.org/10.1007/978-3-032-35377-1_8openalex-snapshot
Hardness of Hinted ISIS from the Space-Time Hardness of Lattice Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-03515-4_1openalex-snapshot
Key-Private Proxy Re-encryption under LWE
inferred← citeshttps://doi.org/10.1007/978-3-319-06089-7_28openalex-snapshot
Modular Form Approach to Solving Lattice Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-12160-4_18openalex-snapshot
On the Efficacy of Solving LWE by Reduction to Unique-SVP
inferred← citeshttps://doi.org/10.1007/978-3-319-27466-9_4openalex-snapshot
Multidimensional Extremal Logan’s and Bohman’s Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-29814-6_4openalex-snapshot
On Promise Problem of the Generalized Shortest Vector Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-39555-5_8openalex-snapshot
A Lattice-Based Group Signature Scheme with Message-Dependent Opening
inferred← citeshttps://doi.org/10.1007/978-3-319-56620-7_1openalex-snapshot
Revisiting Lattice Attacks on Overstretched NTRU Parameters
inferred← citeshttps://doi.org/10.1007/978-3-319-63697-9_13openalex-snapshot
Amortization with Fewer Equations for Proving Knowledge of Small Secrets
inferred← citeshttps://doi.org/10.1007/978-3-319-67882-5_2openalex-snapshot
Lattices and Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-69659-1_5openalex-snapshot
Choosing Parameters for the Subfield Lattice Attack Against Overstretched NTRU
inferred← citeshttps://doi.org/10.1007/978-3-319-70694-8_10openalex-snapshot
Large Modulus Ring-LWE $$\ge $$ Module-LWE
inferred← citeshttps://doi.org/10.1007/978-3-319-70700-6_11openalex-snapshot
Zero-Knowledge Arguments for Lattice-Based PRFs and Applications to E-Cash
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/978-3-319-76581-5_22openalex-snapshot
Hash Proof Systems over Lattices Revisited
inferred← citeshttps://doi.org/10.1007/978-3-319-76581-5_24openalex-snapshot
Learning with Errors and Extrapolated Dihedral Cosets
inferred← citeshttps://doi.org/10.1007/978-3-319-89500-0_5openalex-snapshot
The Reductions for the Approximating Covering Radius Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-93387-0_9openalex-snapshot
Floppy-Sized Group Signatures from Lattices
inferred← citeshttps://doi.org/10.1007/978-3-319-96878-0_3openalex-snapshot
Quantum FHE (Almost) As Secure As Classical
inferred← citeshttps://doi.org/10.1007/978-3-319-96881-0_23openalex-snapshot
Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits
inferred← citeshttps://doi.org/10.1007/978-3-319-98113-0_20openalex-snapshot
More Efficient Commitments from Structured Lattice Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-319-99136-8_1openalex-snapshot
Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs
inferred← citeshttps://doi.org/10.1007/978-3-319-99807-7_36openalex-snapshot
A New Insight—Proxy Re-encryption Under LWE with Strong Anti-collusion
inferred← citeshttps://doi.org/10.1007/978-3-540-71677-8_21openalex-snapshot
Multi-bit Cryptosystems Based on Lattice Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-85174-5_30openalex-snapshot
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-88403-3_6openalex-snapshot
Explicit Hard Instances of the Shortest Vector Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-02295-1_14openalex-snapshot
Inapproximability Results for Computational Problems on Lattices
inferred← citeshttps://doi.org/10.1007/978-3-642-02295-1_15openalex-snapshot
On the Complexity of Lattice Problems with Polynomial Approximation Factors
inferred← citeshttps://doi.org/10.1007/978-3-642-14623-7_7openalex-snapshot
Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_18openalex-snapshot
The Euclidean Distortion of Flat Tori
inferred← citeshttps://doi.org/10.1007/978-3-642-19074-2_21openalex-snapshot
Better Key Sizes (and Attacks) for LWE-Based Encryption
inferred← citeshttps://doi.org/10.1007/978-3-642-20901-7_10openalex-snapshot
Algorithms for the Shortest and Closest Lattice Vector Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-22935-0_16openalex-snapshot
Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle
inferred← citeshttps://doi.org/10.1007/978-3-642-23082-0_7openalex-snapshot
The Geometry of Lattice Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-642-29011-4_41openalex-snapshot
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
inferred← citeshttps://doi.org/10.1007/978-3-642-29011-4_43openalex-snapshot
Lattice Signatures without Trapdoors
inferred← citeshttps://doi.org/10.1007/978-3-642-38348-9_3openalex-snapshot
A Toolkit for Ring-LWE Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-642-42033-7_6openalex-snapshot
Discrete Gaussian Leftover Hash Lemma over Infinite Domains
inferred← citeshttps://doi.org/10.1007/978-3-642-42045-0_3openalex-snapshot
Lattice-Based Group Signatures with Logarithmic Signature Size
inferred← citeshttps://doi.org/10.1007/978-3-642-54631-0_5openalex-snapshot
Proxy Re-encryption from Lattices
inferred← citeshttps://doi.org/10.1007/978-3-662-43414-7_20openalex-snapshot
Discrete Ziggurat: A Time-Memory Trade-Off for Sampling from a Gaussian Distribution over the Integers
inferred← citeshttps://doi.org/10.1007/978-3-662-43414-7_3openalex-snapshot
Improvement and Efficient Implementation of a Lattice-Based Signature Scheme
inferred← citeshttps://doi.org/10.1007/978-3-662-46447-2_32openalex-snapshot
Simple Lattice Trapdoor Sampling from a Broad Class of Distributions
inferred← citeshttps://doi.org/10.1007/978-3-662-46800-5_8openalex-snapshot
Better Algorithms for LWE and LWR
inferred← citeshttps://doi.org/10.1007/978-3-662-47989-6_3openalex-snapshot
An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
inferred← citeshttps://doi.org/10.1007/978-3-662-49896-5_12openalex-snapshot
Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
inferred← citeshttps://doi.org/10.1007/978-3-662-49896-5_20openalex-snapshot
Recovering Short Generators of Principal Ideals in Cyclotomic Rings
inferred← citeshttps://doi.org/10.1007/978-3-662-53890-6_13openalex-snapshot
Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-662-53890-6_4openalex-snapshot
Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption
inferred← citeshttps://doi.org/10.1007/978-3-662-63958-0_25openalex-snapshot
Post-quantum Online Voting Scheme
inferred← citeshttps://doi.org/10.1007/978-981-19-7644-5openalex-snapshot
Modern Cryptography Volume 2
inferred← citeshttps://doi.org/10.1007/978-981-95-5099-9_15openalex-snapshot
A Lattice-Based IND-CCA Threshold KEM from the BCHK+ Transform
inferred← citeshttps://doi.org/10.1007/978-981-95-5099-9_2openalex-snapshot
On the Provable Dual Attack for LWE by Modulus Switching
inferred← citeshttps://doi.org/10.1007/978-981-95-5113-2_3openalex-snapshot
Lattice-Based Group Signatures in the Standard Model, Revisited
inferred← citeshttps://doi.org/10.1007/978-981-96-0947-5_7openalex-snapshot
Adaptive Hardcore Bit and Quantum Key Leasing over Classical Channel from LWE with Polynomial Modulus
inferred← citeshttps://doi.org/10.1007/978-981-97-5028-3_3openalex-snapshot
Lattice-Based, More General Anti-leakage Model and Its Application in Decentralization
inferred← citeshttps://doi.org/10.1007/978-981-99-2366-3openalex-snapshot
Proceedings of the Second International Forum on Financial Mathematics and Financial Technology
inferred← citeshttps://doi.org/10.1007/978-981-99-2366-3_7openalex-snapshot
Cyclic Lattices, Ideal Lattices, and Bounds for the Smoothing Parameter
inferred← citeshttps://doi.org/10.1007/978-981-99-7563-1_19openalex-snapshot
CTA: Confidential Transactions Protocol with State Accumulator
inferred← citeshttps://doi.org/10.1007/978-981-99-8739-9_6openalex-snapshot
NEV: Faster and Smaller NTRU Encryption Using Vector Decoding
inferred← citeshttps://doi.org/10.1007/bf02574039openalex-snapshot
Inequalities for convex bodies and polar reciprocal lattices inR n
inferred← citeshttps://doi.org/10.1007/bf02711514openalex-snapshot
Inequalities for convex bodies and polar reciprocal lattices inR n II: Application ofK-convexity
inferred← citeshttps://doi.org/10.1007/s00022-023-00685-3openalex-snapshot
Extending Gromov’s optimal systolic inequality
inferred← citeshttps://doi.org/10.1007/s00037-005-0193-yopenalex-snapshot
The complexity of the covering radius problem
inferred← citeshttps://doi.org/10.1007/s00037-008-0251-3openalex-snapshot
Limits on the Hardness of Lattice Problems in ℓ p Norms
inferred← citeshttps://doi.org/10.1007/s00037-025-00271-wopenalex-snapshot
Quantum Automating TC0-Frege Is LWE-Hard
inferred← citeshttps://doi.org/10.1007/s00145-022-09430-6openalex-snapshot
Non-commutative Ring Learning with Errors from Cyclic Algebras
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.1007/s00453-013-9834-8openalex-snapshot
A Randomized Sieving Algorithm for Approximate Integer Programming
inferred← citeshttps://doi.org/10.1007/s00454-018-9970-7openalex-snapshot
Covering Lattice Points by Subspaces and Counting Point–Hyperplane Incidences
inferred← citeshttps://doi.org/10.1007/s00605-008-0530-8openalex-snapshot
A Blichfeldt-type inequality for the surface area
inferred← citeshttps://doi.org/10.1007/s00605-022-01788-wopenalex-snapshot
Counting rational points of a Grassmannian
inferred← citeshttps://doi.org/10.1007/s10107-019-01379-yopenalex-snapshot
Lattice closures of polyhedra
inferred← citeshttps://doi.org/10.1007/s10623-012-9724-0openalex-snapshot
On the number of lattice points in a small sphere and a recursive lattice decoding algorithm
inferred← citeshttps://doi.org/10.1007/s10623-016-0326-0openalex-snapshot
On the asymptotic complexity of solving LWE
inferred← citeshttps://doi.org/10.1007/s10623-020-00719-wopenalex-snapshot
On the smoothing parameter and last minimum of random orthogonal lattices
inferred← citeshttps://doi.org/10.1007/s10623-021-00973-6openalex-snapshot
LWE from non-commutative group rings
inferred← citeshttps://doi.org/10.1007/s10623-023-01296-4openalex-snapshot
Generic constructions of master-key KDM secure attribute-based encryption
inferred← citeshttps://doi.org/10.1007/s10623-025-01660-6openalex-snapshot
Generic construction of threshold ring signatures and lattice-based instantiations
inferred← citeshttps://doi.org/10.1007/s10623-026-01809-xopenalex-snapshot
Learning with errors over group rings constructed by semi-direct product
inferred← citeshttps://doi.org/10.1007/s10898-018-0729-8openalex-snapshot
On the complexity of quasiconvex integer minimization problem
inferred← citeshttps://doi.org/10.1007/s11227-025-07872-wopenalex-snapshot
Post-quantum anonymous authentication for Web3: a lattice-based decentralized linkable anonymous credential scheme
inferred← citeshttps://doi.org/10.1007/s11390-015-1604-4openalex-snapshot
Solving Closest Vector Instances Using an Approximate Shortest Independent Vectors Oracle
inferred← citeshttps://doi.org/10.1007/s11416-025-00563-3openalex-snapshot
Application of quantum fourier transform in cryptology
inferred← citeshttps://doi.org/10.1007/s11432-019-9861-3openalex-snapshot
Improved lattice-based CCA2-secure PKE in the standard model
inferred← citeshttps://doi.org/10.1007/s11704-021-1073-6openalex-snapshot
On the hardness of NTRU problems
inferred← citeshttps://doi.org/10.1007/s11854-022-0254-zopenalex-snapshot
Maximal theta functions universal optimality of the hexagonal lattice for Madelung-like lattice energies
inferred← citeshttps://doi.org/10.1007/s11856-008-0036-zopenalex-snapshot
Systolic inequalities and Massey products in simply-connected manifolds
inferred← citeshttps://doi.org/10.1007/s11859-011-0777-0openalex-snapshot
An ideal lattice based IBE scheme in the standard model
inferred← citeshttps://doi.org/10.1007/s13324-019-00299-6openalex-snapshot
Optimal and non-optimal lattices for non-completely monotone interaction potentials
inferred← citeshttps://doi.org/10.1007/s13389-021-00279-2openalex-snapshot
Improving recent side-channel attacks against the DES key schedule
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50021-xopenalex-snapshot
10.1016/b978-044488002-4/50021-x
inferred← citeshttps://doi.org/10.1016/j.aim.2009.09.005openalex-snapshot
Hermitian vector bundles and extension groups on arithmetic schemes. I. Geometry of numbers
inferred← citeshttps://doi.org/10.1016/j.aim.2020.107031openalex-snapshot
An upper bound on the number of perfect quadratic forms
inferred← citeshttps://doi.org/10.1016/j.aim.2020.107045openalex-snapshot
Successive minima of line bundles
inferred← citeshttps://doi.org/10.1016/j.aim.2023.108966openalex-snapshot
Corrigendum to “Successive minima of line bundles” [Adv. Math. 365 (2020) 107045]
inferred← citeshttps://doi.org/10.1016/j.ansens.2006.09.001openalex-snapshot
Formes linéaires de logarithmes effectives sur les variétés abéliennes
inferred← citeshttps://doi.org/10.1016/j.csi.2025.104092openalex-snapshot
Traceable signatures from lattices
inferred← citeshttps://doi.org/10.1016/j.disc.2013.10.020openalex-snapshot
New transference theorems on lattices possessing n ϵ -unique shortest vectors
inferred← citeshttps://doi.org/10.1016/j.disopt.2012.11.003openalex-snapshot
A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity 2O(nlogn)
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.09.002openalex-snapshot
The Projection Games Conjecture and the hardness of approximation of super-SAT and related problems
inferred← citeshttps://doi.org/10.1016/j.jfa.2021.109261openalex-snapshot
On a certain class of positive definite functions and measures on locally compact Abelian groups and inner-product spaces
inferred← citeshttps://doi.org/10.1016/j.jisa.2021.102782openalex-snapshot
A comprehensive review on collision-resistant hash functions on lattices
inferred← citeshttps://doi.org/10.1016/j.jnt.2006.03.002openalex-snapshot
Upper bounds for Euclidean minima of algebraic number fields
inferred← citeshttps://doi.org/10.1016/j.jnt.2012.02.012openalex-snapshot
Adelic geometry and polarity
inferred← citeshttps://doi.org/10.1016/j.jnt.2025.06.014openalex-snapshot
A simple proof of a reverse Minkowski theorem for integral lattices
inferred← citeshttps://doi.org/10.1016/j.matpur.2012.09.009openalex-snapshot
Concerning the semistability of tensor products in Arakelov geometry
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.10.005openalex-snapshot
Improvements in closest point search based on dual HKZ-bases
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.01.038openalex-snapshot
Improvements in the analysis of Kannan's CVP algorithm
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.01.003openalex-snapshot
Zero-knowledge arguments for matrix–vector relations and lattice-based group encryption
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.04.008openalex-snapshot
Collusion-resistant identity-based Proxy Re-encryption: Lattice-based constructions in Standard Model
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00123-xopenalex-snapshot
A note on the non-NP-hardness of approximate lattice problems under general Cook reductions
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00019-7openalex-snapshot
Note on shortest and nearest lattice vectors
inferred← citeshttps://doi.org/10.1016/s0040-9383(98)00045-7openalex-snapshot
HERMITIAN VECTOR BUNDLES OF RANK TWO AND ADJOINT SYSTEMS ON ARITHMETIC SURFACES
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00216-0openalex-snapshot
A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00058-9openalex-snapshot
A relation of primal-dual lattices and the complexity of shortest lattice vector problem
inferred← citeshttps://doi.org/10.1016/s0764-4442(97)87884-6openalex-snapshot
Sur l'approximation rationnelle simultanée des vecteurs de Bruno
showing the first 200 of 410 · page through all 410
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.