Secure network coding over the integers
From MaRDI portal
Recommendations
- Homomorphic network coding signatures in the standard model
- Efficient network coding signatures in the standard model
- Signing a Linear Subspace: Signature Schemes for Network Coding
- Fast Signature Scheme for Network Coding
- An efficient dynamic-identity based signature scheme for secure network coding
Cited in
(36)- Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions
- An efficient homomorphic aggregate signature scheme based on lattice
- Practical homomorphic message authenticators for arithmetic circuits
- An efficient MAC scheme for secure network coding with probabilistic detection
- An efficient dynamic-identity based signature scheme for secure network coding
- Computing on authenticated data
- A survey of emerging threats in cybersecurity
- CCA updatable encryption against malicious re-encryption attacks
- Linearly homomorphic signatures with designated combiner
- Accumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic Signatures
- Secure N-dimensional simultaneous dense coding and applications
- Verifiable pattern matching on outsourced texts
- Lattice-based linearly homomorphic signatures in the standard model
- Lightweight integrity for XOR network coding in wireless sensor networks
- Efficient network coding signatures in the standard model
- Network coding signature schemes against related-key attacks in the random oracle model
- Secure multi-source network coding scheme with lattice signature
- Homomorphic network coding signatures in the standard model
- Programmable hash functions go private: constructions and applications to (homomorphic) signatures with shorter public keys
- Preventing pollution attacks in multi-source network coding
- Signing a Linear Subspace: Signature Schemes for Network Coding
- Information security in a random network coding network
- A new definition of homomorphic signature for identity management in mobile cloud computing
- Efficient completely context-hiding quotable and linearly homomorphic signatures
- Algebraic (trapdoor) one-way functions: constructions and applications
- Lattice-based linearly homomorphic signature scheme over binary field
- Linearly Homomorphic Signatures with Designated Entities
- How to make a linear network code (strongly) secure
- scientific article; zbMATH DE number 6263174 (Why is no real title available?)
- Linearly homomorphic authenticated encryption with provable correctness and public verifiability
- Multi-theorem preprocessing NIZKs from lattices
- Structure-preserving linearly homomorphic signature with designated combiner for subspace
- CHQS: Publicly Verifiable Homomorphic Signatures Beyond the Linear Case
- Towards tightly secure short linearly homomorphic signatures
- Fully-succinct multi-key homomorphic signatures from standard assumptions
- Linearly homomorphic structure-preserving signatures and their applications
This page was built for publication: Secure network coding over the integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3562893)
