On the public citation graph
Public-key cryptosystems from lattice reduction problems
0 signed · 493 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.1006/jcss.1997.1472openalex-snapshot
The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations
inferredcites →https://doi.org/10.1007/0-387-34799-2_2openalex-snapshot
Limits on the Provable Consequences of One-way Permutations
inferredcites →https://doi.org/10.1007/3-540-39568-7_23openalex-snapshot
An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
inferredcites →https://doi.org/10.1007/3-540-39568-7_7openalex-snapshot
Some Public-Key Crypto-Functions as Intractable as Factorization
inferredcites →https://doi.org/10.1007/3-540-47721-7_8openalex-snapshot
Two Remarks Concerning the Goldwasser-Micali-Rivest Signature Scheme
inferredcites →https://doi.org/10.1007/3-540-49264-x_1openalex-snapshot
Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction
inferredcites →https://doi.org/10.1007/3-540-68697-5_22openalex-snapshot
Algorithms for Black-Box Fields and their Application to Cryptography
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1007/bf02579403openalex-snapshot
On Lovász’ lattice reduction and the nearest lattice point problem
inferredcites →https://doi.org/10.1016/0022-0000(84)90070-9openalex-snapshot
Probabilistic encryption
inferredcites →https://doi.org/10.1016/0304-3975(87)90064-8openalex-snapshot
A hierarchy of polynomial time lattice basis reduction algorithms
inferredcites →https://doi.org/10.1109/sfcs.1982.95openalex-snapshot
Theory and application of trapdoor functions
inferredcites →https://doi.org/10.1109/sfcs.1993.366815openalex-snapshot
The hardness of approximate optima in lattices, codes, and systems of linear equations
inferredcites →https://doi.org/10.1109/tit.1976.1055638openalex-snapshot
New directions in cryptography
inferredcites →https://doi.org/10.1109/tit.1985.1057074openalex-snapshot
A public key cryptosystem and a signature scheme based on discrete logarithms
inferredcites →https://doi.org/10.1137/0217017openalex-snapshot
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
inferredcites →https://doi.org/10.1137/0222069openalex-snapshot
On the Existence of Pseudorandom Generators
inferredcites →https://doi.org/10.1145/100216.100269openalex-snapshot
One-way functions are necessary and sufficient for secure signatures
inferredcites →https://doi.org/10.1145/237814.237838openalex-snapshot
Generating hard instances of lattice problems (extended abstract)
inferredcites →https://doi.org/10.1145/258533.258604openalex-snapshot
A public-key cryptosystem with worst-case/average-case equivalence
inferredcites →https://doi.org/10.1145/357980.358017openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/359340.359342openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/73007.73010openalex-snapshot
A hard-core predicate for all one-way functions
inferredcites →https://doi.org/10.1145/73007.73011openalex-snapshot
Universal one-way hash functions and their cryptographic applications
inferredcites →https://doi.org/10.1146/annurev.cs.02.060187.001311openalex-snapshot
Algorithmic Geometry of Numbers
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781119527978.ch5openalex-snapshot
Lattice‐Based Cryptography and Internet of Things
inferred← citeshttps://doi.org/10.1002/ett.3810openalex-snapshot
LCPPA: Lattice‐based conditional privacy preserving authentication in vehicular communication
inferred← citeshttps://doi.org/10.1002/ett.4199openalex-snapshot
LWEDM: Learning with error based secure mobile digital rights management system
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.1006/inco.1998.2762openalex-snapshot
A Lattice-Based Public-Key Cryptosystem
inferred← citeshttps://doi.org/10.1006/jcss.1999.1649openalex-snapshot
Approximating the SVP to within a Factor (1+1/dimε) Is NP-Hard under Randomized Reductions
inferred← citeshttps://doi.org/10.1006/jsco.2000.0370openalex-snapshot
Challenges of Symbolic Computation: My Favorite Open Problems
inferred← citeshttps://doi.org/10.1007/10718964_4openalex-snapshot
A Proposal of a New Public Key Cryptosystem Using Matrices over a Ring
inferred← citeshttps://doi.org/10.1007/10722028_1openalex-snapshot
The Complexity of Some Lattice Problems
inferred← citeshttps://doi.org/10.1007/10722028_4openalex-snapshot
Lattice Reduction in Cryptology: An Update
inferred← citeshttps://doi.org/10.1007/10722028_7openalex-snapshot
New Results on Lattice Basis Reduction in Practice
inferred← citeshttps://doi.org/10.1007/11681878_8openalex-snapshot
Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices
inferred← citeshttps://doi.org/10.1007/11689522_3openalex-snapshot
Diophantine Approximation Attack on a Fast Public Key Cryptosystem
inferred← citeshttps://doi.org/10.1007/11761679_17openalex-snapshot
Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
inferred← citeshttps://doi.org/10.1007/11792086_17openalex-snapshot
Practical Lattice Basis Sampling Reduction
inferred← citeshttps://doi.org/10.1007/3-540-36288-6_22openalex-snapshot
A Lattice Based Public Key Cryptosystem Using Polynomial Representations
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_14openalex-snapshot
Lattice Reduction by Random Sampling and Birthday Methods
inferred← citeshttps://doi.org/10.1007/3-540-36563-x_10openalex-snapshot
About the XL Algorithm over GF(2)
inferred← citeshttps://doi.org/10.1007/3-540-36563-x_9openalex-snapshot
NTRUSign: Digital Signatures Using the NTRU Lattice
inferred← citeshttps://doi.org/10.1007/3-540-39200-9_27openalex-snapshot
Hypercubic Lattice Reduction and Analysis of GGH and NTRU Signatures
inferred← citeshttps://doi.org/10.1007/3-540-44499-8_26openalex-snapshot
MiniPASS: Authentication and Digital Signatures in a Constrained Environment
inferred← citeshttps://doi.org/10.1007/3-540-44598-6_10openalex-snapshot
New Public-Key Cryptosystem Using Braid Groups
inferred← citeshttps://doi.org/10.1007/3-540-44670-2_10openalex-snapshot
Dimension Reduction Methods for Convolution Modular Lattices
inferred← citeshttps://doi.org/10.1007/3-540-44670-2_11openalex-snapshot
Improving Lattice Based Cryptosystems Using the Hermite Normal Form
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-44670-2_8openalex-snapshot
Segment LLL-Reduction with Floating Point Orthogonalization
inferred← citeshttps://doi.org/10.1007/3-540-44691-5_6openalex-snapshot
Lattice Basis Reduction with Dynamic Approximation
inferred← citeshttps://doi.org/10.1007/3-540-46035-7_20openalex-snapshot
Cryptanalysis of the Revised NTRU Signature Scheme
inferred← citeshttps://doi.org/10.1007/3-540-46665-7_29openalex-snapshot
Tensor-Based Trapdoors for CVP and Their Application to Public Key Cryptography
inferred← citeshttps://doi.org/10.1007/3-540-47719-5_3openalex-snapshot
Cryptanalysis of a Public Key Cryptosystem Proposed at ACISP 2000
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_18openalex-snapshot
Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto ’97
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_1openalex-snapshot
Generating Hard Instances of the Short Basis Problem
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/3-540-48686-0_36openalex-snapshot
On Routing in Circulant Graphs
inferred← citeshttps://doi.org/10.1007/3-540-48892-8_18openalex-snapshot
A Lattice- Based Public-Key Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-1-4615-0895-3_18openalex-snapshot
Lattices and Cryptography
inferred← citeshttps://doi.org/10.1007/978-1-4842-8105-5_13openalex-snapshot
Lattice-Based Cryptography and NTRU
inferred← citeshttps://doi.org/10.1007/978-1-4842-9450-5_10openalex-snapshot
Lattice-based Cryptography
inferred← citeshttps://doi.org/10.1007/978-1-4939-1711-2_7openalex-snapshot
Lattices and Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-030-01950-1_18openalex-snapshot
Towards Practical Lattice-Based One-Time Linkable Ring Signatures
inferred← citeshttps://doi.org/10.1007/978-3-030-03326-2_14openalex-snapshot
Quantum Lattice Enumeration and Tweaking Discrete Pruning
inferred← citeshttps://doi.org/10.1007/978-3-030-03326-2_16openalex-snapshot
On the Statistical Leak of the GGH13 Multilinear Map and Some Variants
inferred← citeshttps://doi.org/10.1007/978-3-030-03329-3_18openalex-snapshot
Learning Strikes Again: The Case of the DRS Signature Scheme
inferred← citeshttps://doi.org/10.1007/978-3-030-10970-7_14openalex-snapshot
Public Key Compression for Constrained Linear Signature Schemes
inferred← citeshttps://doi.org/10.1007/978-3-030-21548-4_7openalex-snapshot
Improving the Security of the DRS Scheme with Uniformly Chosen Random Noise
inferred← citeshttps://doi.org/10.1007/978-3-030-34618-8_1openalex-snapshot
Approximate Trapdoors for Lattices and Smaller Hash-and-Sign Signatures
inferred← citeshttps://doi.org/10.1007/978-3-030-38471-5_23openalex-snapshot
Block-Anti-Circulant Unbalanced Oil and Vinegar
inferred← citeshttps://doi.org/10.1007/978-3-030-45727-3_2openalex-snapshot
Key Recovery from Gram–Schmidt Norm Leakage in Hash-and-Sign Signatures over NTRU Lattices
inferred← citeshttps://doi.org/10.1007/978-3-030-52722-8_2openalex-snapshot
Blockchain Based Organizations and the Governance of On-Chain and Off-Chain Rules: Towards Autonomous (Legal) Orders?
inferred← citeshttps://doi.org/10.1007/978-3-030-66626-2_9openalex-snapshot
Fiat-Shamir with Aborts: From Identification Schemes to Linkable Ring Signatures
inferred← citeshttps://doi.org/10.1007/978-3-030-75539-3_19openalex-snapshot
SoK: How (not) to Design and Implement Post-quantum Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-030-81293-5_20openalex-snapshot
On Removing Rejection Conditions in Practical Lattice-Based Signatures
inferred← citeshttps://doi.org/10.1007/978-3-031-06764-8_4openalex-snapshot
Linkable Ring Signature Scheme from NTRU Lattice
inferred← citeshttps://doi.org/10.1007/978-3-031-07082-2_9openalex-snapshot
Mitaka: A Simpler, Parallelizable, Maskable Variant of Falcon
inferred← citeshttps://doi.org/10.1007/978-3-031-30589-4_12openalex-snapshot
On the Hardness of the Finite Field Isomorphism Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-38554-4_13openalex-snapshot
Compact Lattice Gadget and Its Applications to Hash-and-Sign Signatures
inferred← citeshttps://doi.org/10.1007/978-3-031-40003-2_11openalex-snapshot
Do Not Bound to a Single Position: Near-Optimal Multi-positional Mismatch Attacks Against Kyber and Saber
inferred← citeshttps://doi.org/10.1007/978-3-031-46077-7_22openalex-snapshot
A Survey of Software Implementations for the Number Theoretic Transform
inferred← citeshttps://doi.org/10.1007/978-3-031-53290-0_7openalex-snapshot
Thriving in the Quantum Era
inferred← citeshttps://doi.org/10.1007/978-3-031-57718-5_13openalex-snapshot
Cryptanalysis of the Peregrine Lattice-Based Signature Scheme
inferred← citeshttps://doi.org/10.1007/978-3-031-58411-4_1openalex-snapshot
Profiling Side-Channel Attacks on Dilithium
inferred← citeshttps://doi.org/10.1007/978-3-031-58868-6_14openalex-snapshot
Towards Compact Identity-Based Encryption on Ideal Lattices
inferred← citeshttps://doi.org/10.1007/978-3-031-68391-6_8openalex-snapshot
FuLeakage: Breaking FuLeeca by Learning Attacks
inferred← citeshttps://doi.org/10.1007/978-3-031-83490-5_8openalex-snapshot
Asymptotic Complexity and Performance Comparison of Falcon and SOLMAE using their C Implementation
inferred← citeshttps://doi.org/10.1007/978-3-031-88661-4_12openalex-snapshot
Post-quantum Online/Offline Signatures
inferred← citeshttps://doi.org/10.1007/978-3-031-91820-9_10openalex-snapshot
One Bit to Rule Them All – Imperfect Randomness Harms Lattice Signatures
inferred← citeshttps://doi.org/10.1007/978-3-032-01405-4_3openalex-snapshot
Improvement of Side-Channel Attacks on Mitaka
inferred← citeshttps://doi.org/10.1007/978-3-032-01901-1_4openalex-snapshot
Crowhammer: Full Key Recovery Attack on Falcon with a Single Rowhammer Bit Flip
inferred← citeshttps://doi.org/10.1007/978-3-032-22695-2_8openalex-snapshot
Generating Falcon Trapdoors via Gibbs Sampler
inferred← citeshttps://doi.org/10.1007/978-3-319-01854-6_58openalex-snapshot
The Isomorphism of Polynomials Problem Applied to Multivariate Quadratic Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-319-06320-1_37openalex-snapshot
New Variants of Lattice Problems and Their NP-Hardness
inferred← citeshttps://doi.org/10.1007/978-3-319-10683-0_16openalex-snapshot
A Panorama of Post-quantum Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-319-11659-4_1openalex-snapshot
Sealing the Leak on Classical NTRU Signatures
inferred← citeshttps://doi.org/10.1007/978-3-319-11659-4_6openalex-snapshot
RankSign: An Efficient Signature Algorithm Based on the Rank Metric
inferred← citeshttps://doi.org/10.1007/978-3-319-12325-7_17openalex-snapshot
A Lattice Rational Approximation Algorithm for AFSRs Over Quadratic Integer Rings
inferred← citeshttps://doi.org/10.1007/978-3-319-14971-4_4openalex-snapshot
Residue Number Systems in Cryptography: Design, Challenges, Robustness
inferred← citeshttps://doi.org/10.1007/978-3-319-15943-0_7openalex-snapshot
A Fast Phase-based Enumeration Algorithm for SVP Challenge Through $$y$$-Sparse Representations of Short Lattice Vectors
inferred← citeshttps://doi.org/10.1007/978-3-319-16715-2_13openalex-snapshot
Finding Shortest Lattice Vectors in the Presence of Gaps
inferred← citeshttps://doi.org/10.1007/978-3-319-21356-9_14openalex-snapshot
Nearest Planes in Practice
inferred← citeshttps://doi.org/10.1007/978-3-319-27998-5_4openalex-snapshot
A Simulated Annealing Algorithm for SVP Challenge Through y-Sparse Representations of Short Lattice Vectors
inferred← citeshttps://doi.org/10.1007/978-3-319-31875-2_13openalex-snapshot
An Improved Analysis of Broadcast Attacks on the GGH Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-319-49742-6_12openalex-snapshot
RNS-Based Public-Key Cryptography (RSA and ECC)
inferred← citeshttps://doi.org/10.1007/978-3-319-49742-6_13openalex-snapshot
RNS Approach in Lattice-Based Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-319-53177-9_4openalex-snapshot
Analysis of Error Terms of Signatures Based on Learning with Errors
inferred← citeshttps://doi.org/10.1007/978-3-319-57048-8_2openalex-snapshot
The Complexity of Public-Key Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-319-61204-1_1openalex-snapshot
Sampling from Arbitrary Centered Discrete Gaussians for Lattice-Based Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-319-69453-5_7openalex-snapshot
Lattice Attacks Against Elliptic-Curve Signatures with Blinded Scalar Multiplication
inferred← citeshttps://doi.org/10.1007/978-3-319-69453-5_8openalex-snapshot
Loop-Abort Faults on Lattice-Based Fiat-Shamir and Hash-and-Sign Signatures
inferred← citeshttps://doi.org/10.1007/978-3-319-69659-1_7openalex-snapshot
Generic Forward-Secure Key Agreement Without Signatures
inferred← citeshttps://doi.org/10.1007/978-3-319-70694-8_13openalex-snapshot
Sharper Bounds in Lattice-Based Cryptography Using the Rényi Divergence
inferred← citeshttps://doi.org/10.1007/978-3-319-72565-9_11openalex-snapshot
A Public-Key Encryption Scheme Based on Non-linear Indeterminate Equations
inferred← citeshttps://doi.org/10.1007/978-3-319-73830-7_1openalex-snapshot
Sphere Decoding Algorithm Based on a New Radius Definition
inferred← citeshttps://doi.org/10.1007/978-3-319-76578-5_15openalex-snapshot
Fast Lattice Basis Reduction Suitable for Massive Parallelization and Its Application to the Shortest Vector Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-93638-3_26openalex-snapshot
Cryptanalysis of the Randomized Version of a Lattice-Based Signature Scheme from PKC’08
inferred← citeshttps://doi.org/10.1007/978-3-319-93638-3_32openalex-snapshot
Post-Quantum One-Time Linkable Ring Signature and Application to Ring Confidential Transactions in Blockchain (Lattice RingCT v1.0)
inferred← citeshttps://doi.org/10.1007/978-3-319-93638-3_50openalex-snapshot
Practical Signatures from the Partial Fourier Recovery Problem Revisited: A Provably-Secure and Gaussian-Distributed Construction
inferred← citeshttps://doi.org/10.1007/978-3-322-84957-1_7openalex-snapshot
Elliptische Kurven in HBCI Ein Backup zu RSA
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_22openalex-snapshot
A Faster Lattice Reduction Method Using Quantum Search
inferred← citeshttps://doi.org/10.1007/978-3-540-40974-8_18openalex-snapshot
Computing the M = UU t Integer Matrix Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-540-45146-4_17openalex-snapshot
Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More
inferred← citeshttps://doi.org/10.1007/978-3-540-71641-9_6openalex-snapshot
Addressing Insecurities and Violations of Privacy
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-71677-8_8openalex-snapshot
Cryptanalysis of the Paeng-Jung-Ha Cryptosystem from PKC 2003
inferred← citeshttps://doi.org/10.1007/978-3-540-74143-5_10openalex-snapshot
Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_31openalex-snapshot
Public Key Identification Based on the Equivalence of Quadratic Forms
inferred← citeshttps://doi.org/10.1007/978-3-540-78440-1_17openalex-snapshot
A Digital Signature Scheme Based on CVP ∞
inferred← citeshttps://doi.org/10.1007/978-3-540-78967-3_3openalex-snapshot
Predicting Lattice Reduction
inferred← citeshttps://doi.org/10.1007/978-3-540-88353-1_5openalex-snapshot
Cryptography Based on Quadratic Forms: Complexity Considerations
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-540-88403-3_9openalex-snapshot
Cryptanalysis of Rational Multivariate Public Key Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-540-88702-7_5openalex-snapshot
Lattice-based Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-540-89255-7_23openalex-snapshot
Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-89255-7_24openalex-snapshot
Rigorous and Efficient Short Lattice Vectors Enumeration
inferred← citeshttps://doi.org/10.1007/978-3-642-01957-9_28openalex-snapshot
Broadcast Attacks against Lattice-Based Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-642-02295-1_11openalex-snapshot
Practical Lattice-Based Cryptography: NTRUEncrypt and NTRUSign
inferred← citeshttps://doi.org/10.1007/978-3-642-02295-1_5openalex-snapshot
Floating-Point LLL: Theoretical and Practical Aspects
inferred← citeshttps://doi.org/10.1007/978-3-642-03356-8_26openalex-snapshot
How Risky Is the Random-Oracle Model?
inferred← citeshttps://doi.org/10.1007/978-3-642-03356-8_34openalex-snapshot
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-10366-7_36openalex-snapshot
Efficient Public Key Encryption Based on Ideal Lattices
inferred← citeshttps://doi.org/10.1007/978-3-642-11731-2_34openalex-snapshot
Improvement of Lattice-Based Cryptography Using CRT
inferred← citeshttps://doi.org/10.1007/978-3-642-12678-9_4openalex-snapshot
Parallel Shortest Lattice Vector Enumeration on Graphics Cards
inferred← citeshttps://doi.org/10.1007/978-3-642-13013-7_25openalex-snapshot
Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
inferred← citeshttps://doi.org/10.1007/978-3-642-13190-5_27openalex-snapshot
Bonsai Trees, or How to Delegate a Lattice Basis
inferred← citeshttps://doi.org/10.1007/978-3-642-14712-8_8openalex-snapshot
Accelerating Lattice Reduction with FPGAs
inferred← citeshttps://doi.org/10.1007/978-3-642-15317-4_21openalex-snapshot
Recursive Lattice Reduction
inferred← citeshttps://doi.org/10.1007/978-3-642-15546-8_7openalex-snapshot
Computationally Efficient Searchable Symmetric Encryption
inferred← citeshttps://doi.org/10.1007/978-3-642-16825-3_6openalex-snapshot
An Improvement of Key Generation Algorithm for Gentry’s Homomorphic Encryption Scheme
inferred← citeshttps://doi.org/10.1007/978-3-642-20465-4_9openalex-snapshot
Implementing Gentry’s Fully-Homomorphic Encryption Scheme
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-21031-0_13openalex-snapshot
Kipnis-Shamir Attack on Unbalanced Oil-Vinegar Scheme
inferred← citeshttps://doi.org/10.1007/978-3-642-22792-9_28openalex-snapshot
Fully Homomorphic Encryption over the Integers with Shorter Public Keys
inferred← citeshttps://doi.org/10.1007/978-3-642-25437-6_45openalex-snapshot
Signature from the Exponential Hard Lattices
inferred← citeshttps://doi.org/10.1007/978-3-642-25513-7_10openalex-snapshot
A New Lattice-Based Public-Key Cryptosystem Mixed with a Knapsack
inferred← citeshttps://doi.org/10.1007/978-3-642-27890-7_9openalex-snapshot
A General NTRU-Like Framework for Constructing Lattice-Based Public-Key Cryptosystems
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-29101-2_24openalex-snapshot
On the CCA-1 Security of Somewhat Homomorphic Encryption over the Integers
inferred← citeshttps://doi.org/10.1007/978-3-642-30904-5_7openalex-snapshot
TCHo: A Code-Based Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-642-33027-8_31openalex-snapshot
Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-34129-8_5openalex-snapshot
Implicit Polynomial Recovery and Cryptanalysis of a Combinatorial Key Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-642-34961-4_26openalex-snapshot
Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-642-34961-4_27openalex-snapshot
Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures
inferred← citeshttps://doi.org/10.1007/978-3-642-35362-8_21openalex-snapshot
A Leakage-Resilient Zero Knowledge Proof for Lattice Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-36046-6_16openalex-snapshot
Ciphertext-Only Attack on Gentry-Halevi Implementation of Somewhat Homomorphic Scheme
inferred← citeshttps://doi.org/10.1007/978-3-642-36095-4_19openalex-snapshot
Solving BDD by Enumeration: An Update
inferred← citeshttps://doi.org/10.1007/978-3-642-38348-9_1openalex-snapshot
Candidate Multilinear Maps from Ideal Lattices
inferred← citeshttps://doi.org/10.1007/978-3-642-40041-4_3openalex-snapshot
Lattice Signatures and Bimodal Gaussians
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-48000-7_9openalex-snapshot
Parallel Hashing via List Recoverability
inferred← citeshttps://doi.org/10.1007/978-3-662-49387-8_16openalex-snapshot
On Public Key Encryption from Noisy Codewords
inferred← citeshttps://doi.org/10.1007/978-981-15-1675-7_10openalex-snapshot
Post-quantum Cryptography: An Introduction
inferred← citeshttps://doi.org/10.1007/978-981-15-4409-5_4openalex-snapshot
Future Identity Card Using Lattice-Based Cryptography and Steganography
inferred← citeshttps://doi.org/10.1007/978-981-15-6048-4_36openalex-snapshot
An Improvement of the Cryptographical Implementation of Coppersmith’s Method
inferred← citeshttps://doi.org/10.1007/978-981-15-6318-8_49openalex-snapshot
Construction of Identity Based Signcryption Using Learning with Rounding
inferred← citeshttps://doi.org/10.1007/978-981-16-7502-7_25openalex-snapshot
A Lattice-Based Anonymous Authentication for Privacy Protection of Medical Data
inferred← citeshttps://doi.org/10.1007/978-981-19-0920-7openalex-snapshot
Modern Cryptography Volume 1
inferred← citeshttps://doi.org/10.1007/978-981-19-0920-7_7openalex-snapshot
Lattice-Based Cryptography
inferred← citeshttps://doi.org/10.1007/978-981-97-1238-0_13openalex-snapshot
Theoretical and Empirical Analysis of FALCON and SOLMAE Using Their Python Implementation
inferred← citeshttps://doi.org/10.1007/978-981-97-9743-1_3openalex-snapshot
Guarding Against Quantum Threats: A Survey of Post-Quantum Cryptography Standardization, Techniques, and Current Implementations
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_2openalex-snapshot
A Probability Inequality with Application to Lattice Theory
inferred← citeshttps://doi.org/10.1007/978-981-99-2366-3_9openalex-snapshot
On the High Dimensional RSA Algorithm—A Public Key Cryptosystem Based on Lattice and Algebraic Number Theory
inferred← citeshttps://doi.org/10.1007/978-981-99-8661-3_2openalex-snapshot
Future of Cryptography in the Era of Quantum Computing
inferred← citeshttps://doi.org/10.1007/978-981-99-8730-6_6openalex-snapshot
Exploiting the Symmetry of $$\mathbb {Z}^n$$: Randomization and the Automorphism Problem
inferred← citeshttps://doi.org/10.1007/978-981-99-8739-9_1openalex-snapshot
Antrag: Annular NTRU Trapdoor Generation
inferred← citeshttps://doi.org/10.1007/979-8-8688-0441-0_15openalex-snapshot
Lattice-Based Cryptography and NTRU
inferred← citeshttps://doi.org/10.1007/bfb0054868openalex-snapshot
NTRU: A ring-based public key cryptosystem
inferred← citeshttps://doi.org/10.1007/s00145-007-9002-xopenalex-snapshot
Cryptographic Hash Functions from Expander Graphs
inferred← citeshttps://doi.org/10.1007/s00145-008-9031-0openalex-snapshot
Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
inferred← citeshttps://doi.org/10.1007/s00145-011-9105-2openalex-snapshot
Bonsai Trees, or How to Delegate a Lattice Basis
inferred← citeshttps://doi.org/10.1007/s00145-020-09366-9openalex-snapshot
Learning Strikes Again: The Case of the DRS Signature Scheme
inferred← citeshttps://doi.org/10.1007/s00145-025-09546-5openalex-snapshot
Exploiting the Symmetry of $$\mathbb {Z}^n$$: Randomization and the Automorphism Problem
inferred← citeshttps://doi.org/10.1007/s00145-026-09584-7openalex-snapshot
One (Noisy) Bit to Rule Them All: Key Recovery from Randomness Leakage in ML-DSA
inferred← citeshttps://doi.org/10.1007/s00224-010-9278-3openalex-snapshot
Generating Shorter Bases for Hard Random Lattices
inferred← citeshttps://doi.org/10.1007/s00607-009-0042-yopenalex-snapshot
Post-quantum cryptography: lattice signatures
inferred← citeshttps://doi.org/10.1007/s10207-022-00587-6openalex-snapshot
Challenges of post-quantum digital signing in real-world applications: a survey
inferred← citeshttps://doi.org/10.1007/s10623-015-0089-zopenalex-snapshot
PASS-Encrypt: a public key cryptosystem based on partial evaluation of polynomials
inferred← citeshttps://doi.org/10.1007/s10623-019-00694-xopenalex-snapshot
Modular lattice signatures, revisited
inferred← citeshttps://doi.org/10.1007/s10623-025-01618-8openalex-snapshot
An attack on p-adic lattice public-key encryption cryptosystems and signature schemes
inferred← citeshttps://doi.org/10.1007/s10916-020-1527-7openalex-snapshot
Efficient NTRU Lattice-Based Certificateless Signature Scheme for Medical Cyber-Physical Systems
inferred← citeshttps://doi.org/10.1007/s10958-005-0068-4openalex-snapshot
Public-key cryptography and invariant theory
inferred← citeshttps://doi.org/10.1007/s11042-022-13347-4openalex-snapshot
Non-interactive verifiable LWE-based multi secret sharing scheme
inferred← citeshttps://doi.org/10.1007/s11277-016-3596-yopenalex-snapshot
Public Key Cryptosystem Based on Low Density Lattice Codes
inferred← citeshttps://doi.org/10.1007/s11277-017-4385-yopenalex-snapshot
A New Self-Certified Signature Scheme Based on NTRUSing for Smart Mobile Communications
inferred← citeshttps://doi.org/10.1007/s11390-005-0735-4openalex-snapshot
Progress in Computational Complexity Theory
inferred← citeshttps://doi.org/10.1007/s11401-023-0053-6openalex-snapshot
Lattice-Based Cryptography: A Survey
inferred← citeshttps://doi.org/10.1007/s11432-013-4843-4openalex-snapshot
Gaussian sampling of lattices for cryptographic applications
inferred← citeshttps://doi.org/10.1007/s11432-018-9789-yopenalex-snapshot
Polynomial AND homomorphic cryptosystem and applications
inferred← citeshttps://doi.org/10.1007/s11432-019-2699-6openalex-snapshot
Generalizing Lyubashevsky-Wichs trapdoor sampler for NTRU lattices
inferred← citeshttps://doi.org/10.1007/s11786-009-0018-5openalex-snapshot
Cryptanalysis of the GGH Cryptosystem
inferred← citeshttps://doi.org/10.1007/s11859-010-0313-7openalex-snapshot
Efficient broadcast encryption scheme based on number theory research unit
showing the first 200 of 468 · page through all 468
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.