Signatures for network coding
The paper presents a new digital signature scheme with practical application to network coding. The authors present their idea based on elliptic curves and proof its security to hash collisions. They also prove that forging a signature in proposed signing is as hard as computing discrete logs. Finally it is described the setup of the scheme in detailed steps. It is shown how could be found a suitable elliptic curve and the p-torsion points. A detailed example from algebra package \texttt{MAGMA} is attached. I recommend the paper both to theoretical researchers and to practitioners in the mentioned scientific areas.
- 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
- Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing
- An efficient MAC scheme for secure network coding with probabilistic detection
- A computational perspective on network coding
- Computing on authenticated data
- Linearly homomorphic signatures with designated combiner
- scientific article; zbMATH DE number 5940840 (Why is no real title available?)
- Efficient secure multiparty computation with identifiable abort
- New Multiparty Signature Schemes for Network Routing Applications
- Signing a Linear Subspace: Signature Schemes for Network Coding
- Network information flow
- Signature codes for noisy multiple access adder channel
- On Homomorphic Signatures for Network Coding
- Fast Signature Scheme for Network Coding
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)
