A compiler for multi-key homomorphic signatures for Turing machines

DOI10.1016/J.TCS.2021.08.002MaRDI QIDQ2232614zbMATH OpenOpenAlexWikidataFDO

Authors Yanyan Li

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

zbMATH Keywords

Turing machineshomomorphic authenticatorssecure delegation of computations

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Matrioska: a compiler for multi-key homomorphic signatures
• Multi-key homomorphic signatures unforgeable under insider corruption
• The simplest multi-key linearly homomorphic signature scheme
• On the security notions for homomorphic signatures
• A more efficient leveled strongly-unforgeable fully homomorphic signature scheme

Cites work

• Adaptive pseudo-free groups and applications
• Algebraic (Trapdoor) one-way functions and their applications
• Authenticating computation on groups: new homomorphic primitives and applications
• Computing on authenticated data: new privacy definitions and constructions
• Context hiding multi-key linearly homomorphic authenticators
• Efficient network coding signatures in the standard model
• Fully homomorphic message authenticators
• Homomorphic network coding signatures in the standard model
• Homomorphic signatures for polynomial functions
• Homomorphic signatures with efficient verification for polynomial functions
• How to delegate computations publicly
• Improved security for linearly homomorphic signatures: a generic framework
• Leveled fully homomorphic signatures from standard lattices
• Linearly Homomorphic Structure-Preserving Signatures and Their Applications
• Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures
• Matrioska: a compiler for multi-key homomorphic signatures
• Multi-key Homomorphic Authenticators
• Multi-key homomorphic signatures unforgeable under insider corruption
• Preventing pollution attacks in multi-source network coding
• Programmable hash functions go private: constructions and applications to (homomorphic) signatures with shorter public keys
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Signing a Linear Subspace: Signature Schemes for Network Coding
• The simplest multi-key linearly homomorphic signature scheme

Cited in

(4)

• Ternary forking lemma and its application to the analysis of one code-based signature
• Matrioska: a compiler for multi-key homomorphic signatures
• Fully-succinct multi-key homomorphic signatures from standard assumptions
• Multi-key homomorphic signatures unforgeable under insider corruption

This page was built for publication: A compiler for multi-key homomorphic signatures for Turing machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2232614)