On the public citation graph

Eliminating decryption errors in the Ajtai-Dwork Cryptosystem

0 signed · 51 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.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

What points at this work

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

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/11617983_17openalex-snapshot
On Achieving Chosen Ciphertext Security with Decryption Errors
inferred← citeshttps://doi.org/10.1007/11818175_8openalex-snapshot
Lattice-Based Cryptography
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-48523-6_1openalex-snapshot
Generating Hard Instances of the Short Basis Problem
inferred← citeshttps://doi.org/10.1007/3-540-48686-0_36openalex-snapshot
On Routing in Circulant Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4615-0895-3_18openalex-snapshot
Lattices and Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-030-64837-4_6openalex-snapshot
CCA-Secure (Puncturable) KEMs from Encryption with Non-Negligible Decryption Errors
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-56614-6_20openalex-snapshot
A Note on Perfect Correctness by Derandomization
inferred← citeshttps://doi.org/10.1007/978-3-540-24676-3_21openalex-snapshot
Immunizing Encryption Schemes from Decryption Errors
inferred← citeshttps://doi.org/10.1007/978-3-540-30576-7_29openalex-snapshot
Proof of Plaintext Knowledge for the Ajtai-Dwork Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-540-47942-0_2openalex-snapshot
Reaction Attacks against Several Public-Key Cryptosystem
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-88702-7_5openalex-snapshot
Lattice-based Cryptography
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_13openalex-snapshot
Cryptographic Functions from Worst-Case Complexity Assumptions
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-14623-7_8openalex-snapshot
Additively Homomorphic Encryption with d-Operand Multiplications
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-21031-0_12openalex-snapshot
Improving BDD Cryptosystems in General Lattices
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-32009-5_50openalex-snapshot
Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
inferred← citeshttps://doi.org/10.1007/978-981-95-6206-0_7openalex-snapshot
A Framework for Fully Compact Transparent Ring Signature on Lattice and Its Instantiation
inferred← citeshttps://doi.org/10.1007/bfb0055731openalex-snapshot
Cryptanalysis of the Ajtai-Dwork cryptosystem
inferred← citeshttps://doi.org/10.1007/s00145-022-09428-0openalex-snapshot
A Note on Perfect Correctness by Derandomization
inferred← citeshttps://doi.org/10.1016/j.ipl.2019.04.004openalex-snapshot
Improved analysis of the reduction from BDD to uSVP
inferred← citeshttps://doi.org/10.1016/j.pmcj.2008.07.001openalex-snapshot
A tamper-proof and lightweight authentication scheme
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.07.060openalex-snapshot
Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment
inferred← citeshttps://doi.org/10.1109/ccc.1999.766274openalex-snapshot
Some recent progress on the complexity of lattice problems
inferred← citeshttps://doi.org/10.1109/ccc.2010.26openalex-snapshot
The Learning with Errors Problem (Invited Survey)
inferred← citeshttps://doi.org/10.1109/focs.2006.51openalex-snapshot
New Results for Learning Noisy Parities and Halfspaces
inferred← citeshttps://doi.org/10.1145/1039488.1039490openalex-snapshot
New lattice-based cryptographic constructions
inferred← citeshttps://doi.org/10.1145/1060590.1060604openalex-snapshot
Representing hard lattices with O(n log n) bits
inferred← citeshttps://doi.org/10.1145/2714451openalex-snapshot
Candidate Multilinear Maps
inferred← citeshttps://doi.org/10.1145/509907.509958openalex-snapshot
2-round zero knowledge and proof auditors
inferred← citeshttps://doi.org/10.1145/780542.780603openalex-snapshot
New lattice based cryptographic constructions
inferred← citeshttps://doi.org/10.1145/780601.780603openalex-snapshot
New lattice based cryptographic constructions
inferred← citeshttps://doi.org/10.1155/2014/341490openalex-snapshot
STP‐LWE: A Variant of Learning with Error for a Flexible Encryption
inferred← citeshttps://doi.org/10.1515/gcc.2009.1openalex-snapshot
A Complete Public-Key Cryptosystem
inferred← citeshttps://doi.org/10.18372/2225-5036.20.7549openalex-snapshot
Review of current methods of quantum and post-quantum cryptography
inferred← citeshttps://doi.org/10.2197/ipsjdc.1.470openalex-snapshot
Dihedral Hidden Subgroup Problem: A Survey
inferred← citeshttps://doi.org/10.3390/iot2010005openalex-snapshot
Post-Quantum Cryptosystems for Internet-of-Things: A Survey on Lattice-Based Algorithms
inferred← citeshttps://doi.org/10.3929/ethz-a-007242748openalex-snapshot
Security proofs in number theoretic cryptography
inferred← citeshttps://doi.org/10.4018/978-1-7998-6677-0.ch006openalex-snapshot
Post-Quantum Lattice-Based Cryptography
inferred← citeshttps://doi.org/10.4086/cjtcs.2008.002openalex-snapshot
inferred← citeshttps://doi.org/10.48550/arxiv.1003.5304openalex-snapshot
Review of Lattice-based Public key Cryptography(Russian)
inferred← citeshttps://doi.org/10.5772/intechopen.1007829openalex-snapshot
Perspective Chapter: Postquantum Security
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.