Lattice-based programmable hash functions and applications (Q6182001)

scientific article; zbMATH DE number 7793132

Language	Label	Description	Also known as
English	Lattice-based programmable hash functions and applications	scientific article; zbMATH DE number 7793132

Statements

instance of

scholarly article

0 references

title

Lattice-based programmable hash functions and applications (English)

0 references

published in

Journal of Cryptology

0 references

publication date

23 January 2024

0 references

zbMATH Keywords

lattices

0 references

programmable hash functions

0 references

standard model

0 references

digital signature

0 references

identity-based encryption

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s00145-023-09488-w

0 references

cites work

Ring-based identity based encryption -- asymptotically shorter MPK and tighter security

0 references

Efficient Lattice (H)IBE in the Standard Model

0 references

Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE

0 references

Q4228459

0 references

Q4938616

0 references

Short Signatures with Short Public Keys from Homomorphic Trapdoor Functions

0 references

An Improved Compression Technique for Signatures Based on Learning with Errors

0 references

Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme

0 references

Practical Signatures from Standard Assumptions

0 references

Advances in Cryptology - EUROCRYPT 2004

0 references

Q4783728

0 references

Breaking RSA may not be equivalent to factoring

0 references

Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More

0 references

Towards Tightly Secure Lattice Short Signature and Id-Based Encryption

0 references

Advances in Cryptology - EUROCRYPT 2004

0 references

Bonsai Trees, or How to Delegate a Lattice Basis

0 references

Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys

0 references

Cryptanalysis of the Multilinear Map over the Integers

0 references

An Identity Based Encryption Scheme Based on Quadratic Residues

0 references

Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations

0 references

Practical Multilinear Maps over the Integers

0 references

On the Amortized Complexity of Zero-Knowledge Protocols

0 references

Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data

0 references

Lattice Signatures and Bimodal Gaussians

0 references

Efficient Identity-Based Encryption over NTRU Lattices

0 references

Improved Short Lattice Signatures in the Standard Model

0 references

Families of finite sets in which no set is covered by the union of \(r\) others

0 references

Programmable Hash Functions in the Multilinear Setting

0 references

Candidate Multilinear Maps from Ideal Lattices

0 references

Practical Identity-Based Encryption Without Random Oracles

0 references

Trapdoors for hard lattices and new cryptographic constructions

0 references

Leveled Fully Homomorphic Signatures from Standard Lattices

0 references

On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups

0 references

Short Signatures from Weaker Assumptions

0 references

Programmable Hash Functions and Their Applications

0 references

Programmable hash functions and their applications

0 references

Cryptanalysis of GGH Map

0 references

Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance

0 references

Short lattice signatures in the standard model with efficient tag generation

0 references

Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps

0 references

Digital Signatures

0 references

Q4941882

0 references

Lattice Signatures without Trapdoors

0 references

Asymptotically Efficient Lattice-Based Digital Signatures

0 references

On Ideal Lattices and Learning with Errors over Rings

0 references

Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller

0 references

Worst‐Case to Average‐Case Reductions Based on Gaussian Measures

0 references

Simpler Efficient Group Signatures from Lattices

0 references

Theory of Cryptography

0 references

On lattices, learning with errors, random linear codes, and cryptography

0 references

Identity-Based Cryptosystems and Signature Schemes

0 references

Efficient Identity-Based Encryption Without Random Oracles

0 references

Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions

0 references

Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters

0 references

Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques

0 references

Two-Dimensional Representation of Cover Free Families and Its Applications: Short Signatures and More

0 references

Secure Identity-Based Encryption in the Quantum Random Oracle Model

0 references

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

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

10.1007/S00145-023-09488-W

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6182001