Homomorphic Network Coding Signatures in the Standard Model

DOI10.1007/978-3-642-19379-8_2zbMath1291.94177OpenAlexW1621100081MaRDI 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 modelprovable securitynetwork codinghomomorphic signatures

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items

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