The Geometry of Lattice Cryptography (Q3092183): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficient Lattice (H)IBE in the Standard Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additively Homomorphic Encryption with d-Operand Multiplications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of approximate optima in lattices, codes, and systems of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds in some transference theorems in the geometry of numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Key-Dependent Message Security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-homomorphic Encryption and Multiparty Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of computing short linearly independent vectors and short bases in a lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphic Signatures for Polynomial Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the SVP to within a factor \((1+1/\dim^\varepsilon)\) is NP-hard under randomized reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bonsai Trees, or How to Delegate a Lattice Basis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Zero-Knowledge Identification with Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lattice-Based Threshold Ring Signature Scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Homomorphic Encryption over the Integers with Shorter Public Keys / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating CVP to within almost-polynomial factors is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully homomorphic encryption using ideal lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing Gentry’s Fully-Homomorphic Encryption Scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple BGN-Type Cryptosystem from LWE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapdoors for hard lattices and new cryptographic constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Group Signature Scheme from Lattice Assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the covering radius problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the distribution of the distance from a lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-bit Cryptosystems Based on Lattice Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of approximating the shortest vector problem in lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Key Sizes (and Attacks) for LWE-Based Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Bounded Distance Decoding for General Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice-Based Identification Schemes Secure Under Active Attacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Compact Knapsacks Are Collision Resistant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically Efficient Lattice-Based Digital Signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: SWIFFT: A Modest Proposal for FFT Hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public-Key Cryptographic Primitives Provably as Secure as Subset Sum / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Ideal Lattices and Learning with Errors over Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic Functions from Worst-Case Complexity Assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst‐Case to Average‐Case Reductions Based on Gaussian Measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice-based Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi-Deniable Public-Key Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public-key cryptosystems from the worst-case shortest vector problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Framework for Efficient and Composable Oblivious Transfer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lossy trapdoor functions and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lattices, learning with errors, random linear codes, and cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning with Errors over Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptively Secure Identity-Based Identification from Lattices without Random Oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice-Based Blind Signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Fully Homomorphic Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Public Key Encryption Based on Ideal Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Homomorphic Encryption over the Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-Knowledge Protocols for NTRU: Application to Identification and Proof of Plaintext Knowledge / rank
 
Normal rank

Latest revision as of 10:32, 4 July 2024

scientific article
Language Label Description Also known as
English
The Geometry of Lattice Cryptography
scientific article

    Statements

    The Geometry of Lattice Cryptography (English)
    0 references
    0 references
    16 September 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers