Multi-key Homomorphic Authenticators
From MaRDI portal
Recommendations
- On the security of multikey homomorphic encryption
- Multikey fully homomorphic encryption and applications
- Multi-key Homomorphic Proxy Re-Encryption
- Context hiding multi-key linearly homomorphic authenticators
- scientific article; zbMATH DE number 1024081
- Multi-key homomorphic encryption from TFHE
- Multivariate Public Key Cryptography
- scientific article; zbMATH DE number 2043337
- Multi-key fully-homomorphic encryption in the plain model
Cites work
- scientific article; zbMATH DE number 5485522 (Why is no real title available?)
- scientific article; zbMATH DE number 108109 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 2079932 (Why is no real title available?)
- scientific article; zbMATH DE number 1405637 (Why is no real title available?)
- Adaptive pseudo-free groups and applications
- Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor
- Efficient network coding signatures in the standard model
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic message authenticators
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Generalizing homomorphic MACs for arithmetic circuits
- Generating shorter bases for hard random lattices
- Hardness of SIS and LWE with small parameters
- Homomorphic signatures for polynomial functions
- Homomorphic signatures with efficient verification for polynomial functions
- How to delegate and verify in public: verifiable computation from attribute-based encryption
- Improved delegation of computation using fully homomorphic encryption
- Improved security for linearly homomorphic signatures: a generic framework
- Leveled fully homomorphic signatures from standard lattices
- Multi-client non-interactive verifiable computation
- Multi-client verifiable computation with stronger security guarantees
- Multi-key Homomorphic Authenticators
- Non-interactive verifiable computing: outsourcing computation to untrusted workers
- On the bit-complexity of sparse polynomial and series multiplication
- Practical homomorphic MACs for arithmetic circuits
- Preventing pollution attacks in multi-source network coding
- Programmable hash functions go private: constructions and applications to (homomorphic) signatures with shorter public keys
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- Signing a Linear Subspace: Signature Schemes for Network Coding
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Verifiable delegation of computation over large datasets
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Cited in
(21)- Vanishing short integer solution, revisited. Reductions, trapdoors, homomorphic signatures for low-degree polynomials
- Multi-key fully-homomorphic aggregate MAC for arithmetic circuits
- A more efficient leveled strongly-unforgeable fully homomorphic signature scheme
- Practical homomorphic message authenticators for arithmetic circuits
- A compiler for multi-key homomorphic signatures for Turing machines
- Context hiding multi-key linearly homomorphic authenticators
- Practical homomorphic MACs for arithmetic circuits
- Generalizing homomorphic MACs for arithmetic circuits
- $$\mathsf {HIKE}$$ : Walking the Privacy Trail
- CHQS: Publicly Verifiable Homomorphic Signatures Beyond the Linear Case
- Linearly Homomorphic Signatures with Designated Entities
- Multi-key Homomorphic Authenticators
- Homomorphic proxy re-authenticators and applications to verifiable multi-user data aggregation
- Homomorphic signatures and message authentication codes
- Multi-theorem preprocessing NIZKs from lattices
- Matrioska: a compiler for multi-key homomorphic signatures
- Fully homomorphic message authenticators
- Progressive and efficient verification for digital signatures
- Fully-succinct multi-key homomorphic signatures from standard assumptions
- Function-dependent commitments from homomorphic authenticators
- The simplest multi-key linearly homomorphic signature scheme
This page was built for publication: Multi-key Homomorphic Authenticators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2953787)
