Lighter is better: a lighter multi-client verifiable outsourced computation with hybrid homomorphic encryption (Q6109434): Difference between revisions

Latest revision as of 10:39, 2 August 2024

scientific article; zbMATH DE number 7719749

Language	Label	Description	Also known as
English	Lighter is better: a lighter multi-client verifiable outsourced computation with hybrid homomorphic encryption	scientific article; zbMATH DE number 7719749

Statements

instance of

scholarly article

0 references

title

Lighter is better: a lighter multi-client verifiable outsourced computation with hybrid homomorphic encryption (English)

0 references

0 references

0 references

0 references

0 references

Computer Security – ESORICS 2022

0 references

publication date

28 July 2023

0 references

full work available at URL

https://zenodo.org/record/7844646

0 references

zbMATH Keywords

verifiable computation

0 references

outsourced computation

0 references

hybrid homomorphic encryption

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Flexible and efficient verifiable computation on encrypted data

0 references

Chosen-Ciphertext Secure Fully Homomorphic Encryption

0 references

Practical Homomorphic MACs for Arithmetic Circuits

0 references

TFHE: fast fully homomorphic encryption over the torus

0 references

Multi-Client Non-interactive Verifiable Computation

0 references

Rasta: a cipher with low ANDdepth and few ANDs per bit

0 references

Boosting verifiable computation on encrypted data

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

Multi-input Functional Encryption

0 references

Reusable garbled circuits and succinct functional encryption

0 references

Multi-Client Verifiable Computation with Stronger Security Guarantees

0 references

Identifiers

zbMATH Open document ID

1524.68049

0 references

DOI

10.1007/978-3-031-17146-8_6

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6109434

@@ Property / OpenAlex ID @@
+W4296962567
@@ Property / OpenAlex ID: W4296962567 / rank @@
+Normal rank
@@ Property / cites work @@
+Flexible and efficient verifiable computation on encrypted data
+Normal rank
@@ Property / cites work @@
+Chosen-Ciphertext Secure Fully Homomorphic Encryption
+Normal rank
@@ Property / cites work @@
+Practical Homomorphic MACs for Arithmetic Circuits
+Normal rank
@@ Property / cites work @@
+TFHE: fast fully homomorphic encryption over the torus
+Normal rank
@@ Property / cites work @@
+Multi-Client Non-interactive Verifiable Computation
+Normal rank
@@ Property / cites work @@
+Rasta: a cipher with low ANDdepth and few ANDs per bit
+Normal rank
@@ Property / cites work @@
+Boosting verifiable computation on encrypted data
@@ Property / cites work: Boosting verifiable computation on encrypted data / rank @@
+Normal rank
@@ Property / cites work @@
+Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
+Normal rank
@@ Property / cites work @@
+Fully Homomorphic Message Authenticators
@@ Property / cites work: Fully Homomorphic Message Authenticators / rank @@
+Normal rank
@@ Property / cites work @@
+Fully homomorphic encryption using ideal lattices
@@ Property / cites work: Fully homomorphic encryption using ideal lattices / rank @@
+Normal rank
@@ Property / cites work @@
+Multi-input Functional Encryption
@@ Property / cites work: Multi-input Functional Encryption / rank @@
+Normal rank
@@ Property / cites work @@
+Reusable garbled circuits and succinct functional encryption
+Normal rank
@@ Property / cites work @@
+Multi-Client Verifiable Computation with Stronger Security Guarantees
+Normal rank