Secure Network Coding over the Integers

From MaRDI portal
Publication:3562893

DOI10.1007/978-3-642-13013-7_9zbMath1279.94075OpenAlexW1635348707MaRDI QIDQ3562893

Rosario Gennaro, Hugo Krawczyk, Tal Rabin, Jonathan N. Katz

Publication date: 28 May 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-13013-7_9




Related Items (21)

Lattice-based linearly homomorphic signatures in the standard modelLinearly Homomorphic Signatures with Designated EntitiesProgrammable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public KeysHomomorphic signatures with sublinear public keys via asymmetric programmable hash functionsA new definition of homomorphic signature for identity management in mobile cloud computingLinearly homomorphic structure-preserving signatures and their applicationsStructure-preserving linearly homomorphic signature with designated combiner for subspaceCHQS: Publicly Verifiable Homomorphic Signatures Beyond the Linear CaseCCA updatable encryption against malicious re-encryption attacksLinearly homomorphic signatures with designated combinerA survey of emerging threats in cybersecurityAn efficient homomorphic aggregate signature scheme based on latticeAlgebraic (trapdoor) one-way functions: constructions and applicationsPractical homomorphic message authenticators for arithmetic circuitsEfficient Completely Context-Hiding Quotable and Linearly Homomorphic SignaturesLinearly Homomorphic Authenticated Encryption with Provable Correctness and Public VerifiabilityAccumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic SignaturesMulti-theorem preprocessing NIZKs from latticesVerifiable Pattern Matching on Outsourced TextsComputing on authenticated dataLattice-based linearly homomorphic signature scheme over binary field




This page was built for publication: Secure Network Coding over the Integers