A compiler for multi-key homomorphic signatures for Turing machines
From MaRDI portal
Publication:2232614
DOI10.1016/j.tcs.2021.08.002OpenAlexW3187783907WikidataQ122722675 ScholiaQ122722675MaRDI QIDQ2232614
Publication date: 6 October 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.08.002
Cites Work
- Multi-key homomorphic signatures unforgeable under insider corruption
- Matrioska: a compiler for multi-key homomorphic signatures
- The simplest multi-key linearly homomorphic signature scheme
- Context hiding multi-key linearly homomorphic authenticators
- Linearly Homomorphic Structure-Preserving Signatures and Their Applications
- Fully Homomorphic Message Authenticators
- Homomorphic Signatures with Efficient Verification for Polynomial Functions
- Efficient Network Coding Signatures in the Standard Model
- Improved Security for Linearly Homomorphic Signatures: A Generic Framework
- Authenticating Computation on Groups: New Homomorphic Primitives and Applications
- Leveled Fully Homomorphic Signatures from Standard Lattices
- Multi-key Homomorphic Authenticators
- Homomorphic Signatures for Polynomial Functions
- Adaptive Pseudo-free Groups and Applications
- Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
- Homomorphic Network Coding Signatures in the Standard Model
- Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys
- Preventing Pollution Attacks in Multi-source Network Coding
- Signing a Linear Subspace: Signature Schemes for Network Coding
- Algebraic (Trapdoor) One-Way Functions and Their Applications
- Computing on Authenticated Data: New Privacy Definitions and Constructions
- How to delegate computations publicly
- Separating succinct non-interactive arguments from all falsifiable assumptions
