Homomorphic Network Coding Signatures in the Standard Model

DOI10.1007/978-3-642-19379-8_2zbMath1291.94177MaRDI QIDQ3084338

Benoît Libert, Nuttapong Attrapadung

Publication date: 15 March 2011

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

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

zbMATH Keywords

standard model; provable security; network coding; homomorphic signatures

Mathematics Subject Classification ID

94A60: Cryptography

94A62: Authentication, digital signatures and secret sharing

Related Items

Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures, Linearly Homomorphic Signatures with Designated Entities, 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, Function-Dependent Commitments for Verifiable Multi-party Computation, Lattice-based linearly homomorphic signatures in the standard model, Algebraic (trapdoor) one-way functions: constructions and applications, Linearly homomorphic structure-preserving signatures and their applications, Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions, Practical homomorphic message authenticators for arithmetic circuits, Efficient digital signatures from RSA without random oracles, A compiler for multi-key homomorphic signatures for Turing machines, Computing on authenticated data, Linearly homomorphic signatures with designated combiner, Accumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic Signatures, Verifiable Pattern Matching on Outsourced Texts, Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys