Homomorphic signatures with efficient verification for polynomial functions
From MaRDI portal
Recommendations
- Homomorphic signatures for polynomial functions
- Leveled fully homomorphic signatures from standard lattices
- On the security notions for homomorphic signatures
- CHQS: Publicly Verifiable Homomorphic Signatures Beyond the Linear Case
- A more efficient leveled strongly-unforgeable fully homomorphic signature scheme
Cited in
(31)- Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions
- Practical homomorphic message authenticators for arithmetic circuits
- Generic hardness of inversion on ring and its relation to self-bilinear map
- A more efficient leveled strongly-unforgeable fully homomorphic signature scheme
- Progressive and efficient verification for digital signatures
- Labeled homomorphic encryption. Scalable and privacy-preserving processing of outsourced data
- A compiler for multi-key homomorphic signatures for Turing machines
- The simplest multi-key linearly homomorphic signature scheme
- Generalized hardness assumption for self-bilinear map with auxiliary information
- Verifiable pattern matching on outsourced texts
- Leveled fully homomorphic signatures from standard lattices
- Multi-key Homomorphic Authenticators
- Homomorphic signatures for polynomial functions
- On the (in)security of SNARKs in the presence of oracles
- Homomorphic signature schemes. A survey
- scientific article; zbMATH DE number 4070803 (Why is no real title available?)
- Signatures of correct computation
- Faster Batch Verification of Standard ECDSA Signatures Using Summation Polynomials
- Homomorphic proxy re-authenticators and applications to verifiable multi-user data aggregation
- Multi-theorem preprocessing NIZKs from lattices
- Private polynomial commitments and applications to MPC
- Structure-preserving linearly homomorphic signature with designated combiner for subspace
- Function-Dependent Commitments for Verifiable Multi-party Computation
- CHQS: Publicly Verifiable Homomorphic Signatures Beyond the Linear Case
- Additive-homomorphic functional commitments and applications to homomorphic signatures
- Chainable functional commitments for unbounded-depth circuits
- On instantiating unleveled fully-homomorphic signatures from falsifiable assumptions
- Fully-succinct multi-key homomorphic signatures from standard assumptions
- SoK: signatures with randomizable keys
- Lattice-based multi-key homomorphic signatures forward-unforgeable against signing key leakage
- Batch verifiable computation of outsourced functions
This page was built for publication: Homomorphic signatures with efficient verification for polynomial functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2874515)
