Towards tightly secure short linearly homomorphic signatures
From MaRDI portal
Publication:6613999
DOI10.1016/J.TCS.2024.114758MaRDI QIDQ6613999
Publication date: 7 October 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Could not fetch data.
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?)
- Lattice-based linearly homomorphic signatures in the standard model
- An improved lower bound for approximating the minimum integral solution problem with preprocessing over \(\ell_\infty\) norm
- Simple and more efficient PRFs with tight security from LWE and matrix-DDH
- Inapproximability results for the minimum integral solution problem with preprocessing over \(\ell_{\infty}\) norm
- A forward-secure public-key encryption scheme
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- New and Improved Key-Homomorphic Pseudorandom Functions
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Pseudorandom Functions and Lattices
- Efficient Network Coding Signatures in the Standard Model
- Leveled Fully Homomorphic Signatures from Standard Lattices
- Towards Tightly Secure Lattice Short Signature and Id-Based Encryption
- Identity-Based Encryption with Outsourced Revocation in Cloud Computing
- Homomorphic Signatures for Polynomial Functions
- Adaptive Pseudo-free Groups and Applications
- Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
- Homomorphic Network Coding Signatures in the Standard Model
- Number-theoretic constructions of efficient pseudo-random functions
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- Efficient Pseudorandom Functions via On-the-Fly Adaptation
- Trapdoors for hard lattices and new cryptographic constructions
- Secure Network Coding over the Integers
- Bonsai Trees, or How to Delegate a Lattice Basis
- Efficient Lattice (H)IBE in the Standard Model
- Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles
- An Efficient and Parallel Gaussian Sampler for Lattices
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Signing a Linear Subspace: Signature Schemes for Network Coding
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More
- Generating Shorter Bases for Hard Random Lattices
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
This page was built for publication: Towards tightly secure short linearly homomorphic signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6613999)
