Signing a Linear Subspace: Signature Schemes for Network Coding

DOI10.1007/978-3-642-00468-1_5zbMath1227.68024OpenAlexW1743877615MaRDI QIDQ3617513

David M. Freeman, Brent Waters, Dan Boneh, Jonathan N. Katz

Publication date: 24 March 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-00468-1_5

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items

Short Transitive Signatures for Directed Trees, Lattice-based linearly homomorphic signatures in the standard model, Linearly Homomorphic Signatures with Designated Entities, Efficient Secure Multiparty Computation with Identifiable Abort, Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys, Structure-Preserving Signatures from Standard Assumptions, Revisited, Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions, A new definition of homomorphic signature for identity management in mobile cloud computing, Linearly homomorphic structure-preserving signatures and their applications, Tracing a linear subspace: application to linearly-homomorphic group signatures, Multi-key Homomorphic Authenticators, Structure-preserving linearly homomorphic signature with designated combiner for subspace, Structure-preserving signatures on equivalence classes and constant-size anonymous credentials, Attribute-based signatures for range of inner product and its applications, The state of the union: union-only signatures for data aggregation, CHQS: Publicly Verifiable Homomorphic Signatures Beyond the Linear Case, Linearly homomorphic signatures with designated combiner, A computational perspective on network coding, An efficient homomorphic aggregate signature scheme based on lattice, Network Coding Signature Schemes Against Related-Key Attacks in the Random Oracle Model, Secure multi-source network coding scheme with lattice signature, 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, Verifiable pattern matching on outsourced texts, A more efficient leveled strongly-unforgeable fully homomorphic signature scheme, An efficient MAC scheme for secure network coding with probabilistic detection, Linearly Homomorphic Authenticated Encryption with Provable Correctness and Public Verifiability, Quantum homomorphic signature, Accumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic Signatures, Multi-theorem preprocessing NIZKs from lattices, Linearly-homomorphic signatures and scalable mix-nets, Verifiable Pattern Matching on Outsourced Texts, Homomorphic Proxy Re-Authenticators and Applications to Verifiable Multi-User Data Aggregation, Network information flow, Computing on authenticated data, Lattice-based linearly homomorphic signature scheme over binary field