Efficient network coding signatures in the standard model

DOI10.1007/978-3-642-30057-8_40MaRDI QIDQ2900252zbMATH OpenOpenAlexFDO

Authors Dario Catalano, Dario Fiore, Bogdan Warinschi

Publication date 20 July 2012

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

Full work available at URL https://doi.org/10.1007/978-3-642-30057-8_40

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

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

Cited in

(33)

• Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions
• Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing
• Practical homomorphic message authenticators for arithmetic circuits
• A compiler for multi-key homomorphic signatures for Turing machines
• An efficient dynamic-identity based signature scheme for secure network coding
• Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
• Linearly homomorphic signatures with designated combiner
• Accumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic Signatures
• 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
• Multi-key Homomorphic Authenticators
• 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
• scientific article; zbMATH DE number 5940840 (Why is no real title available?)
• Programmable hash functions go private: constructions and applications to (homomorphic) signatures with shorter public keys
• Secure network coding over the integers
• Preventing pollution attacks in multi-source network coding
• Signing a Linear Subspace: Signature Schemes for Network Coding
• Efficient completely context-hiding quotable and linearly homomorphic signatures
• Algebraic (trapdoor) one-way functions: constructions and applications
• Linearly Homomorphic Signatures with Designated Entities
• On Homomorphic Signatures for Network Coding
• Fast Signature Scheme for Network Coding
• Linearly homomorphic authenticated encryption with provable correctness and public verifiability
• Multi-theorem preprocessing NIZKs from lattices
• Function-Dependent Commitments for Verifiable Multi-party Computation
• CHQS: Publicly Verifiable Homomorphic Signatures Beyond the Linear Case
• Signatures for network coding
• 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: Efficient network coding signatures in the standard model

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