Practical homomorphic message authenticators for arithmetic circuits
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5485522 (Why is no real title available?)
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 2079932 (Why is no real title available?)
- A probabilistic remark on algebraic program testing
- Adaptive pseudo-free groups and applications
- Algebraic (Trapdoor) one-way functions and their applications
- Algebraic (trapdoor) one-way functions: constructions and applications
- Arithmetic circuits: a survey of recent results and open questions
- Compact Proofs of Retrievability
- Computing on Authenticated Data
- Computing on authenticated data: new privacy definitions and constructions
- Efficient completely context-hiding quotable and linearly homomorphic signatures
- Efficient network coding signatures in the standard model
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- From secrecy to soundness: efficient verification via secure computation (extended abstract)
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic message authenticators
- Generalizing homomorphic MACs for arithmetic circuits
- Homomorphic network coding signatures in the standard model
- 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
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- 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
- Memory delegation
- Non-interactive verifiable computing: outsourcing computation to untrusted workers
- Practical homomorphic MACs for arithmetic circuits
- 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
- Secure network coding over the integers
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Signing a Linear Subspace: Signature Schemes for Network Coding
- The Uber-Assumption Family
- Verifiable delegation of computation over large datasets
Cited in
(9)- Homomorphic public-key cryptosystems and encrypting Boolean circuits
- Practical homomorphic MACs for arithmetic circuits
- Generalizing homomorphic MACs for arithmetic circuits
- Homomorphic signatures and message authentication codes
- Practical Parameters for Somewhat Homomorphic Encryption (SHE) Schemes on Binary Circuits
- Verifiable inner product computation on outsourced database for authenticated multi-user data sharing
- Compact designated verifier NIZKs from the CDH assumption without pairings
- Fully homomorphic message authenticators
- Proof producing synthesis of arithmetic and cryptographic hardware
This page was built for publication: Practical homomorphic message authenticators for arithmetic circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1747657)
