Secure network coding over the integers

DOI10.1007/978-3-642-13013-7_9MaRDI QIDQ3562893zbMATH OpenOpenAlexFDO

Authors Rosario Gennaro, Hugo Krawczyk, Tal Rabin, Jonathan Katz

Publication date 28 May 2010

Published in Public Key Cryptography – PKC 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13013-7_9

Mathematics Subject Classification ID

Cryptography (94A60)

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)

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

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)