Fully homomorphic message authenticators

DOI10.1007/978-3-642-42045-0_16MaRDI QIDQ2867159zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Practical homomorphic MACs for arithmetic circuits
• Practical homomorphic message authenticators for arithmetic circuits
• Homomorphic signatures and message authentication codes
• Computing on Authenticated Data
• Multi-key Homomorphic Authenticators

Cited in

(29)

• Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions
• Message franking via committing authenticated encryption
• Trusted computing with addition machines. II
• Practical homomorphic message authenticators for arithmetic circuits
• Verifiable pattern matching on outsourced texts
• Labeled homomorphic encryption. Scalable and privacy-preserving processing of outsourced data
• Function-dependent commitments from homomorphic authenticators
• A compiler for multi-key homomorphic signatures for Turing machines
• Verifiable pattern matching on outsourced texts
• Homomorphic signatures and message authentication codes
• Multi-key Homomorphic Authenticators
• On the (in)security of SNARKs in the presence of oracles
• Programmable hash functions go private: constructions and applications to (homomorphic) signatures with shorter public keys
• Practical homomorphic MACs for arithmetic circuits
• Generalizing homomorphic MACs for arithmetic circuits
• Homomorphic proxy re-authenticators and applications to verifiable multi-user data aggregation
• Multi-theorem preprocessing NIZKs from lattices
• Lighter is better: a lighter multi-client verifiable outsourced computation with hybrid homomorphic encryption
• $$\mathsf {HIKE}$$ : Walking the Privacy Trail
• Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials
• Additive-homomorphic functional commitments and applications to homomorphic signatures
• On instantiating unleveled fully-homomorphic signatures from falsifiable assumptions
• Fully-succinct multi-key homomorphic signatures from standard assumptions
• zk-Bench: a toolset for comparative evaluation and performance benchmarking of SNARKs
• \textsf{BitGC}: garbled circuits with 1 bit per gate
• Multi-key fully-homomorphic aggregate MAC for arithmetic circuits
• Cryptanalysis on lightweight verifiable homomorphic encryption
• Lattice-based multi-key homomorphic signatures forward-unforgeable against signing key leakage
• Batch verifiable computation of outsourced functions

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)