Lattice-based linearly homomorphic signatures in the standard model
From MaRDI portal
Publication:284579
DOI10.1016/J.TCS.2016.04.009zbMATH Open1403.94048OpenAlexW2328751355WikidataQ122603069 ScholiaQ122603069MaRDI QIDQ284579FDOQ284579
Authors: Wenbin Chen, Hao Lei, Ke Qi 
Publication date: 18 May 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.04.009
Recommendations
- Identity-based blind signature from lattices in standard model
- scientific article; zbMATH DE number 7108581
- Modular lattice signatures, revisited
- Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures
- Short lattice signatures in the standard model with efficient tag generation
- Leveled fully homomorphic signatures from standard lattices
- Strongly unforgeable ring signature scheme from lattices in the standard model
- Improved short lattice signatures in the standard model
Cites Work
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- Trapdoors for hard lattices and new cryptographic constructions
- Bonsai trees, or how to delegate a lattice basis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient Network Coding Signatures in the Standard Model
- Improved Security for Linearly Homomorphic Signatures: A Generic Framework
- 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
- Secure network coding over the integers
- Strongly unforgeable signatures and hierarchical identity-based signatures from lattices without random oracles
- Signing a Linear Subspace: Signature Schemes for Network Coding
- Public key cryptography -- PKC 2012. 15th international conference on practice and theory in public key cryptography, Darmstadt, Germany, May 21--23, 2012. Proceedings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generating Shorter Bases for Hard Random Lattices
Cited In (18)
- A more efficient leveled strongly-unforgeable fully homomorphic signature scheme
- Practical public key encryption with selective opening security for receivers
- A strong designated verifier proxy re-signature scheme for IoT environments
- Practical Time Capsule Signatures in the Standard Model from Bilinear Maps
- Linearly Homomorphic Signatures with Designated Entities
- Towards tightly secure short linearly homomorphic signatures
- Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures
- A unified framework of identity-based sequential aggregate signatures from 2-level HIBE schemes
- On instantiating unleveled fully-homomorphic signatures from falsifiable assumptions
- Sound and complete computational interpretation of symbolic hashes in the standard model
- One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model
- Group signatures without NIZK: from lattices in the standard model
- Lattice-Based Completely Non-malleable PKE in the Standard Model (Poster)
- Positive influence maximization in signed social networks under independent cascade model
- Linearly homomorphic signatures with designated combiner
- A new threshold changeable secret sharing scheme based on the Chinese remainder theorem
- Secure multi-label data classification in cloud by additionally homomorphic encryption
- Identity-based key-exposure resilient cloud storage public auditing scheme from lattices
This page was built for publication: Lattice-based linearly homomorphic signatures in the standard model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q284579)
