Multi-key Homomorphic Authenticators (Q2953787)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Multi-key Homomorphic Authenticators	scientific article

Statements

scholarly article

0 references

Multi-key Homomorphic Authenticators (English)

0 references

0 references

Aikaterini Mitrokotsa

0 references

0 references

0 references

Advances in Cryptology – ASIACRYPT 2016

0 references

publication date

6 January 2017

0 references

full work available at URL

http://oa.upm.es/49539/

0 references

MaRDI profile type

MaRDI publication profile

0 references

Preventing Pollution Attacks in Multi-source Network Coding

0 references

0 references

0 references

Generating shorter bases for hard random lattices

0 references

Verifiable Delegation of Computation over Large Datasets

0 references

Recursive composition and bootstrapping for SNARKS and proof-carrying data

0 references

Signing a Linear Subspace: Signature Schemes for Network Coding

0 references

Homomorphic Signatures for Polynomial Functions

0 references

Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits

0 references

Practical Homomorphic MACs for Arithmetic Circuits

0 references

Generalizing Homomorphic MACs for Arithmetic Circuits

0 references

Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys

0 references

Adaptive Pseudo-free Groups and Applications

0 references

Efficient Network Coding Signatures in the Standard Model

0 references

Homomorphic Signatures with Efficient Verification for Polynomial Functions

0 references

Multi-Client Non-interactive Verifiable Computation

0 references

Improved Delegation of Computation Using Fully Homomorphic Encryption

0 references

Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data

0 references

Multi-key Homomorphic Authenticators

0 references

Improved Security for Linearly Homomorphic Signatures: A Generic Framework

0 references

0 references

Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers

0 references

Fully Homomorphic Message Authenticators

0 references

Fully homomorphic encryption using ideal lattices

0 references

Trapdoors for hard lattices and new cryptographic constructions

0 references

0 references

Leveled Fully Homomorphic Signatures from Standard Lattices

0 references

Multi-Client Verifiable Computation with Stronger Security Guarantees

0 references

0 references

Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor

0 references

Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller

0 references

Hardness of SIS and LWE with Small Parameters

0 references

Worst‐Case to Average‐Case Reductions Based on Gaussian Measures

0 references

How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption

0 references

On the bit-complexity of sparse polynomial and series multiplication

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-662-53890-6_17

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2953787

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2953787&oldid=36299321"