Generating shorter bases for hard random lattices
From MaRDI portal
Publication:537918
DOI10.1007/s00224-010-9278-3zbMath1217.94092OpenAlexW2130410178MaRDI QIDQ537918
Publication date: 23 May 2011
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2009/1832/
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Lattices and convex bodies (number-theoretic aspects) (11H06)
Related Items (44)
A Lattice-Based Certificateless Public Key Encryption with Equality Test in Standard Model ⋮ Attribute-Based Keyword Search from Lattices ⋮ Trapdoors for Ideal Lattices with Applications ⋮ On the higher-bit version of approximate inhomogeneous short integer solution problem ⋮ Faster Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ Naor-Yung paradigm with shared randomness and applications ⋮ Matrix PRFs: constructions, attacks, and applications to obfuscation ⋮ Lattice-based secret handshakes with reusable credentials ⋮ Cryptanalysis of Boyen's attribute-based encryption scheme in TCC 2013 ⋮ Hardness of \(k\)-LWE and applications in traitor tracing ⋮ Multi-key Homomorphic Authenticators ⋮ Fiat-Shamir signatures based on module-NTRU ⋮ Forward-secure revocable secret handshakes from lattices ⋮ Simplified server-aided revocable identity-based encryption from lattices ⋮ Public key authenticated encryption with keyword search from LWE ⋮ A lattice-based forward secure IBE scheme for Internet of things ⋮ Identity-based key-exposure resilient cloud storage public auditing scheme from lattices ⋮ Lattice-Based Identity-Based Homomorphic Conditional Proxy Re-Encryption for Secure Big Data Computing in Cloud Environment ⋮ Simulatable verifiable random function from the LWE assumption ⋮ Group signature from lattices preserving forward security in dynamic setting ⋮ Lattice-based proxy-oriented identity-based encryption with keyword search for cloud storage ⋮ Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more ⋮ Two Efficient Tag-Based Encryption Schemes on Lattices ⋮ Compact (Targeted Homomorphic) Inner Product Encryption from LWE ⋮ Compact Inner Product Encryption from LWE ⋮ Simplified Revocable Hierarchical Identity-Based Encryption from Lattices ⋮ Lattice-Based Group Signatures with Verifier-Local Revocation: Achieving Shorter Key-Sizes and Explicit Traceability with Ease ⋮ Storage efficient algorithm for Hermite normal form using LLL ⋮ Identity-based blind signature from lattices ⋮ A lattice-based group signature scheme with verifier-local revocation ⋮ Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications ⋮ Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE ⋮ Identity-based proxy re-signatures from lattices ⋮ Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity ⋮ A Novel Lattice-Based Ciphertext-Policy Attribute-Based Proxy Re-encryption for Cloud Sharing ⋮ Verifiable single-server private information retrieval from LWE with binary errors ⋮ New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts ⋮ Efficient chosen ciphertext secure key encapsulation mechanism in standard model over ideal lattices ⋮ Naor-Yung Paradigm with Shared Randomness and Applications ⋮ Sharing privacy protected and statistically sound clinical research data using outsourced data storage ⋮ An optimized GHV-type HE scheme: simpler, faster, and more versatile ⋮ Multi-use Deterministic Public Key Proxy Re-Encryption from Lattices in the Auxiliary-Input Setting ⋮ Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance ⋮ Generating cryptographically-strong random lattice bases and recognizing rotations of \(\mathbb{Z}^n\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
- Lattice points in high-dimensional spheres
- A linear space algorithm for computing the hermite normal form
- Collision-Free Hashing from Lattice Problems
- Trapdoors for hard lattices and new cryptographic constructions
- A Simple BGN-Type Cryptosystem from LWE
- Bonsai Trees, or How to Delegate a Lattice Basis
- Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
- A Framework for Efficient and Composable Oblivious Transfer
- Lattice-based Cryptography
- A Pseudorandom Generator from any One-way Function
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Public-key cryptosystems from the worst-case shortest vector problem
- Advances in Cryptology - CRYPTO 2003
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Generating shorter bases for hard random lattices
