Lattice-based programmable hash functions and applications

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

Authors:

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

• 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
• 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
• 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
• 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
• 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
• Title not available (Why is that?)
• 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)