Lattice-based programmable hash functions and applications

DOI10.1007/S00145-023-09488-WOpenAlexW4389121399MaRDI QIDQ6182001FDOQ6182001

Author name not available (Why is that?)

Publication date: 23 January 2024

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-023-09488-w

zbMATH Keywords

latticesidentity-based encryptionstandard modeldigital signatureprogrammable hash functions

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

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
• 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
• Efficient Identity-Based Encryption Without Random Oracles
• Breaking RSA may not be equivalent to factoring
• Short lattice signatures in the standard model with efficient tag generation
• 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
• Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
• 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
• Ring-based identity based encryption -- asymptotically shorter MPK and tighter security
• 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
• Efficient Identity-Based Encryption over NTRU Lattices
• Towards Tightly Secure Lattice Short Signature and Id-Based Encryption
• Programmable Hash Functions in the Multilinear Setting
• Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
• Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters
• Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
• 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
• Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance
• Short Signatures with Short Public Keys from Homomorphic Trapdoor Functions

This page was built for publication: Lattice-based programmable hash functions and applications

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