Fully homomorphic message authenticators
From MaRDI portal
Publication:2867159
DOI10.1007/978-3-642-42045-0_16zbMATH Open1326.94126OpenAlexW950690059MaRDI QIDQ2867159FDOQ2867159
Authors: Rosario Gennaro, Daniel Wichs 
Publication date: 10 December 2013
Published in: Advances in Cryptology - ASIACRYPT 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-42045-0_16
Recommendations
Cited In (25)
- Trusted computing with addition machines. II
- Practical homomorphic message authenticators for arithmetic circuits
- A compiler for multi-key homomorphic signatures for Turing machines
- Practical homomorphic MACs for arithmetic circuits
- Generalizing homomorphic MACs for arithmetic circuits
- $$\mathsf {HIKE}$$ : Walking the Privacy Trail
- Verifiable pattern matching on outsourced texts
- Verifiable pattern matching on outsourced texts
- Homomorphic proxy re-authenticators and applications to verifiable multi-user data aggregation
- Multi-key Homomorphic Authenticators
- On the (in)security of SNARKs in the presence of oracles
- Additive-homomorphic functional commitments and applications to homomorphic signatures
- Batch verifiable computation of outsourced functions
- Homomorphic signatures and message authentication codes
- On instantiating unleveled fully-homomorphic signatures from falsifiable assumptions
- Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials
- Multi-theorem preprocessing NIZKs from lattices
- Labeled homomorphic encryption. Scalable and privacy-preserving processing of outsourced data
- Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions
- Message franking via committing authenticated encryption
- Programmable hash functions go private: constructions and applications to (homomorphic) signatures with shorter public keys
- Fully-succinct multi-key homomorphic signatures from standard assumptions
- Function-dependent commitments from homomorphic authenticators
- zk-Bench: a toolset for comparative evaluation and performance benchmarking of SNARKs
- Lighter is better: a lighter multi-client verifiable outsourced computation with hybrid homomorphic encryption
This page was built for publication: Fully homomorphic message authenticators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867159)
