Multi-key Homomorphic Authenticators
From MaRDI portal
Publication:2953787
DOI10.1007/978-3-662-53890-6_17zbMath1407.94169OpenAlexW2551922211MaRDI QIDQ2953787
Dario Fiore, Elena Pagnin, Aikaterini Mitrokotsa, Luca Nizzardo
Publication date: 6 January 2017
Published in: Advances in Cryptology – ASIACRYPT 2016 (Search for Journal in Brave)
Full work available at URL: http://oa.upm.es/49539/
Related Items (9)
Linearly Homomorphic Signatures with Designated Entities ⋮ Multi-key Homomorphic Authenticators ⋮ $$\mathsf {HIKE}$$ : Walking the Privacy Trail ⋮ CHQS: Publicly Verifiable Homomorphic Signatures Beyond the Linear Case ⋮ A compiler for multi-key homomorphic signatures for Turing machines ⋮ A more efficient leveled strongly-unforgeable fully homomorphic signature scheme ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Homomorphic Proxy Re-Authenticators and Applications to Verifiable Multi-User Data Aggregation ⋮ Progressive and efficient verification for digital signatures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generating shorter bases for hard random lattices
- On the bit-complexity of sparse polynomial and series multiplication
- Hardness of SIS and LWE with Small Parameters
- Fully Homomorphic Message Authenticators
- Homomorphic Signatures with Efficient Verification for Polynomial Functions
- How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Efficient Network Coding Signatures in the Standard Model
- Improved Security for Linearly Homomorphic Signatures: A Generic Framework
- Leveled Fully Homomorphic Signatures from Standard Lattices
- Multi-key Homomorphic Authenticators
- Homomorphic Signatures for Polynomial Functions
- Adaptive Pseudo-free Groups and Applications
- Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys
- Trapdoors for hard lattices and new cryptographic constructions
- Preventing Pollution Attacks in Multi-source Network Coding
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- Improved Delegation of Computation Using Fully Homomorphic Encryption
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Signing a Linear Subspace: Signature Schemes for Network Coding
- Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor
- Multi-Client Non-interactive Verifiable Computation
- Practical Homomorphic MACs for Arithmetic Circuits
- Fully homomorphic encryption using ideal lattices
- Verifiable Delegation of Computation over Large Datasets
- Multi-Client Verifiable Computation with Stronger Security Guarantees
- Generalizing Homomorphic MACs for Arithmetic Circuits
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
This page was built for publication: Multi-key Homomorphic Authenticators
