Signatures for network coding

DOI10.1504/IJICOT.2009.024044MaRDI QIDQ622765zbMATH OpenOpenAlexFDO

Authors Sumit K. Garg

Publication date 4 February 2011

Published in International Journal of Information and Coding Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/ijicot.2009.024044

zbMATH Keywords

elliptic curvesdigital signaturesnetwork codingerasure coding

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Software, source code, etc. for problems pertaining to information and communication theory (94-04)

Recommendations

• Signing a Linear Subspace: Signature Schemes for Network Coding
• Efficient network coding signatures in the standard model
• Fast Signature Scheme for Network Coding
• Homomorphic network coding signatures in the standard model
• An efficient dynamic-identity based signature scheme for secure network coding

Cited in

(13)

• Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing
• Computing on authenticated data
• An efficient MAC scheme for secure network coding with probabilistic detection
• scientific article; zbMATH DE number 5940840 (Why is no real title available?)
• Efficient secure multiparty computation with identifiable abort
• Fast Signature Scheme for Network Coding
• On Homomorphic Signatures for Network Coding
• A computational perspective on network coding
• Signature codes for noisy multiple access adder channel
• Linearly homomorphic signatures with designated combiner
• Signing a Linear Subspace: Signature Schemes for Network Coding
• Network information flow
• New Multiparty Signature Schemes for Network Routing Applications

This page was built for publication: Signatures for network coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q622765)