Efficient Network Coding Signatures in the Standard Model

DOI10.1007/978-3-642-30057-8_40zbMath1291.94182OpenAlexW1566153410MaRDI QIDQ2900252

Bogdan Warinschi, Dario Catalano, Dario Fiore

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)

Related Items (18)

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 ⋮ Multi-key Homomorphic Authenticators ⋮ Function-Dependent Commitments for Verifiable Multi-party Computation ⋮ Structure-preserving signatures on equivalence classes and constant-size anonymous credentials ⋮ CHQS: Publicly Verifiable Homomorphic Signatures Beyond the Linear Case ⋮ 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 ⋮ 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

This page was built for publication: Efficient Network Coding Signatures in the Standard Model