Practical homomorphic message authenticators for arithmetic circuits
From MaRDI portal
Publication:1747657
DOI10.1007/s00145-016-9249-1zbMath1421.94042OpenAlexW2568916102WikidataQ123347471 ScholiaQ123347471MaRDI QIDQ1747657
Publication date: 26 April 2018
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-016-9249-1
Related Items
Verifiable inner product computation on outsourced database for authenticated multi-user data sharing ⋮ Compact designated verifier NIZKs from the CDH assumption without pairings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algebraic (trapdoor) one-way functions: constructions and applications
- A probabilistic remark on algebraic program testing
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Linearly Homomorphic Structure-Preserving Signatures and Their Applications
- Fully Homomorphic Message Authenticators
- Homomorphic Signatures with Efficient Verification for Polynomial Functions
- Computing on Authenticated Data
- How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
- Efficient Network Coding Signatures in the Standard Model
- Improved Security for Linearly Homomorphic Signatures: A Generic Framework
- Leveled Fully Homomorphic Signatures from Standard Lattices
- Homomorphic Signatures for Polynomial Functions
- Adaptive Pseudo-free Groups and Applications
- Arithmetic Circuits: A survey of recent results and open questions
- Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
- Homomorphic Network Coding Signatures in the Standard Model
- Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys
- Secure Network Coding over the Integers
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- Improved Delegation of Computation Using Fully Homomorphic Encryption
- From Secrecy to Soundness: Efficient Verification via Secure Computation
- Compact Proofs of Retrievability
- The Uber-Assumption Family
- Signing a Linear Subspace: Signature Schemes for Network Coding
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Algebraic (Trapdoor) One-Way Functions and Their Applications
- Computing on Authenticated Data: New Privacy Definitions and Constructions
- Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures
- Practical Homomorphic MACs for Arithmetic Circuits
- Fully homomorphic encryption using ideal lattices
- Verifiable Delegation of Computation over Large Datasets
- Memory Delegation
- Generalizing Homomorphic MACs for Arithmetic Circuits
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
