Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes

DOI10.1007/978-3-662-53015-3_11zbMATH Open1406.94085OpenAlexW2485810903MaRDI QIDQ2829951FDOQ2829951

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

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Ideal Lattices and Learning with Errors over Rings
• On lattices, learning with errors, random linear codes, and cryptography
• Secure Identity-Based Encryption in the Quantum Random Oracle Model
• Identity-Based Cryptosystems and Signature Schemes
• Functional Encryption for Inner Product Predicates from Learning with Errors
• Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
• Trapdoors for hard lattices and new cryptographic constructions
• 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
• An Identity Based Encryption Scheme Based on Quadratic Residues
• Advances in Cryptology - EUROCRYPT 2004
• Breaking RSA may not be equivalent to factoring
• Improved Short Lattice Signatures in the Standard Model
• Lattice Signatures without Trapdoors
• Leveled Fully Homomorphic Signatures from Standard Lattices
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• Digital Signatures
• An Improved Compression Technique for Signatures Based on Learning with Errors
• Lattice Signatures and Bimodal Gaussians
• Practical Multilinear Maps over the Integers
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Simpler Efficient Group Signatures from Lattices
• Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
• Asymptotically Efficient Lattice-Based Digital Signatures
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
• Theory of Cryptography
• Families of finite sets in which no set is covered by the union of \(r\) others
• Advances in Cryptology - EUROCRYPT 2004
• Programmable hash functions and their applications
• Programmable Hash Functions and Their Applications
• Candidate Multilinear Maps from Ideal Lattices
• Cryptanalysis of GGH Map
• Cryptanalysis of the Multilinear Map over the Integers
• Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
• Short Signatures from Weaker Assumptions
• A Toolkit for Ring-LWE Cryptography
• Efficient Identity-Based Encryption over NTRU Lattices
• Programmable Hash Functions in the Multilinear Setting
• Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
• Two-Dimensional Representation of Cover Free Families and Its Applications: Short Signatures and More
• On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups
• Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys
• On the Amortized Complexity of Zero-Knowledge Protocols
• Practical Signatures from Standard Assumptions
• Short Signatures with Short Public Keys from Homomorphic Trapdoor Functions

Cited In (14)

• A new Gaussian sampling for trapdoor lattices with arbitrary modulus
• A New Design of Online/Offline Signatures Based on Lattice
• Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security
• Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more
• Lattice-based programmable hash functions and applications
• Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
• CCA-secure (puncturable) KEMs from encryption with non-negligible decryption errors
• Ring-based identity based encryption -- asymptotically shorter MPK and tighter security
• Identity-based encryption from LWE with more compact master public key
• Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions
• Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance
• Two Efficient Tag-Based Encryption Schemes on Lattices
• Adaptively secure identity-based encryption from middle-product learning with errors
• Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes

Uses Software

• BLISS
• ring-LWE

   Recommendations

• Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys 👍 👎
• Shorter hash-and-sign lattice-based signatures 👍 👎
• Programmable Hash Functions and Their Applications 👍 👎
• Programmable hash functions and their applications 👍 👎
• Programmable Hash Functions in the Multilinear Setting 👍 👎
• Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions 👍 👎
• Approximate trapdoors for lattices and smaller hash-and-sign signatures 👍 👎
• Title not available (Why is that?) 👍 👎
• Lattice-Based Signatures: Optimization and Implementation on Reconfigurable Hardware 👍 👎
• Short identity-based signatures with tight security from lattices 👍 👎

This page was built for publication: Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829951)