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_11zbMATH Open1406.94085OpenAlexW2485810903MaRDI QIDQ2829951FDOQ2829951
Authors: 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
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
- scientific article; zbMATH DE number 7407285
- Lattice-Based Signatures: Optimization and Implementation on Reconfigurable Hardware
- Short identity-based signatures with tight security from lattices
Cites Work
- 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
- Title not available (Why is that?)
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- 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 (17)
- 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
- Two efficient tag-based encryption schemes on lattices
- 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
- Short signatures with short public keys from homomorphic trapdoor functions
- 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
- Programmable hash functions go private: constructions and applications to (homomorphic) signatures with shorter public keys
- Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance
- Programmable hash functions in the multilinear setting
- 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
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)
