Scalable revocable identity-based signature over lattices in the standard model
From MaRDI portal
Publication:2662710
DOI10.1016/j.ins.2020.01.008zbMath1457.94229OpenAlexW2999104131WikidataQ126399361 ScholiaQ126399361MaRDI QIDQ2662710
Jiasi Weng, Congge Xie, Jian Weng, Lin Hou
Publication date: 14 April 2021
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2020.01.008
binary treestandard modellattice-based cryptographyrevocable identity-based signatureshort integer solutions assumption
Related Items (3)
A novel identity-based multi-signature scheme over NTRU lattices ⋮ An efficient identity-based signature scheme with provable security ⋮ Revocable identity-based fully homomorphic signature scheme with signing key exposure resistance
Cites Work
- Unnamed Item
- Unnamed Item
- Algorithms to construct Minkowski reduced and Hermite reduced lattice bases
- Factoring polynomials with rational coefficients
- A Deterministic Single Exponential Time Algorithm for Most Lattice Problems Based on Voronoi Cell Computations
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Lattice Signatures without Trapdoors
- Efficient Identity-Based Encryption over NTRU Lattices
- Identity-Based Cryptosystems and Signature Schemes
- Trellis complexity versus the coding gain of lattices. I
- Trapdoors for hard lattices and new cryptographic constructions
- Efficient Lattice (H)IBE in the Standard Model
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
- Minkowski's Convex Body Theorem and Integer Programming
- Upper bounds on trellis complexity of lattices
- On the trellis complexity of root lattices and their duals
- Trellis complexity and minimal trellis diagrams of lattices
- A sieve algorithm for the shortest lattice vector problem
- Fast Lattice Point Enumeration with Minimal Overhead
- Generating Shorter Bases for Hard Random Lattices
- 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: Scalable revocable identity-based signature over lattices in the standard model
