Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
From MaRDI portal
Publication:2829951
DOI10.1007/978-3-662-53015-3_11zbMath1406.94085OpenAlexW2485810903MaRDI QIDQ2829951
Jiang Zhang, Yu Chen, Zhenfeng Zhang
Publication date: 9 November 2016
Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53015-3_11
Related Items (12)
Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security ⋮ Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions ⋮ Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps ⋮ A New Design of Online/Offline Signatures Based on Lattice ⋮ Lattice-based programmable hash functions and applications ⋮ CCA-secure (puncturable) KEMs from encryption with non-negligible decryption errors ⋮ Ring-based identity based encryption -- asymptotically shorter MPK and tighter security ⋮ Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more ⋮ Two Efficient Tag-Based Encryption Schemes on Lattices ⋮ Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance ⋮ Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes ⋮ A new Gaussian sampling for trapdoor lattices with arbitrary modulus
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Programmable hash functions and their applications
- Families of finite sets in which no set is covered by the union of \(r\) others
- Cryptanalysis of GGH Map
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
- Lattice Signatures and Bimodal Gaussians
- Practical Multilinear Maps over the Integers
- Programmable Hash Functions in the Multilinear Setting
- Improved Short Lattice Signatures in the Standard Model
- Two-Dimensional Representation of Cover Free Families and Its Applications: Short Signatures and More
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Lattice Signatures without Trapdoors
- Secure Identity-Based Encryption in the Quantum Random Oracle Model
- On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups
- Efficient Identity-Based Encryption over NTRU Lattices
- Short Signatures with Short Public Keys from Homomorphic Trapdoor Functions
- Simpler Efficient Group Signatures from Lattices
- Leveled Fully Homomorphic Signatures from Standard Lattices
- Cryptanalysis of the Multilinear Map over the Integers
- Identity-Based Cryptosystems and Signature Schemes
- Functional Encryption for Inner Product Predicates from Learning with Errors
- Short Signatures from Weaker Assumptions
- On the Amortized Complexity of Zero-Knowledge Protocols
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
- Trapdoors for hard lattices and new cryptographic constructions
- Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
- On Ideal Lattices and Learning with Errors over Rings
- Bonsai Trees, or How to Delegate a Lattice Basis
- Efficient Lattice (H)IBE in the Standard Model
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Practical Identity-Based Encryption Without Random Oracles
- Programmable Hash Functions and Their Applications
- Digital Signatures
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Breaking RSA may not be equivalent to factoring
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Candidate Multilinear Maps from Ideal Lattices
- A Toolkit for Ring-LWE Cryptography
- Practical Signatures from Standard Assumptions
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- An Improved Compression Technique for Signatures Based on Learning with Errors
- Asymptotically Efficient Lattice-Based Digital Signatures
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Theory of Cryptography
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
