Homomorphic Encryption (Q5021133)

From MaRDI portal

Revision as of 16:43, 27 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article; zbMATH DE number 7455967

Language	Label	Description	Also known as
English	Homomorphic Encryption	scientific article; zbMATH DE number 7455967

Statements

scholarly article

0 references

Homomorphic Encryption (English)

0 references

0 references

Tutorials on the Foundations of Cryptography

0 references

publication date

12 January 2022

0 references

zbMATH Keywords

encryption scheme

0 references

encrypt data

0 references

homomorphic encryption

0 references

private information retrieval

0 references

describes a project that uses

0 references

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-57048-8_5

0 references

More on average case vs approximation complexity

0 references

Practical Bootstrapping in Quasilinear Time

0 references

Faster Bootstrapping with Polynomial Error

0 references

Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems

0 references

New Algorithms for Learning in Presence of Errors

0 references

Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)

0 references

0 references

Theory of Cryptography

0 references

Functional Encryption: Definitions and Challenges

0 references

0 references

Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme

0 references

Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP

0 references

When Homomorphism Becomes a Liability

0 references

(Leveled) fully homomorphic encryption without bootstrapping

0 references

(Leveled) Fully Homomorphic Encryption without Bootstrapping

0 references

Classical hardness of learning with errors

0 references

Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$

0 references

Lattice-based FHE as secure as PKE

0 references

Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity

0 references

0 references

New Definitions and Separations for Circular Security

0 references

Private information retrieval

0 references

Multi-identity and Multi-key Leveled FHE from Learning with Errors

0 references

Practical Multilinear Maps over the Integers

0 references

Fully Homomorphic Encryption over the Integers with Shorter Public Keys

0 references

0 references

FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second

0 references

Sanitization of FHE Ciphertexts

0 references

0 references

A public key cryptosystem and a signature scheme based on discrete logarithms

0 references

Candidate Multilinear Maps from Ideal Lattices

0 references

Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits

0 references

Fully homomorphic encryption using ideal lattices

0 references

Graph-Induced Multilinear Maps from Lattices

0 references

Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits

0 references

Implementing Gentry’s Fully-Homomorphic Encryption Scheme

0 references

Better Bootstrapping in Fully Homomorphic Encryption

0 references

Fully Homomorphic Encryption with Polylog Overhead

0 references

Homomorphic Evaluation of the AES Circuit

0 references

i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits

0 references

A Simple BGN-Type Cryptosystem from LWE

0 references

Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based

0 references

How to Run Turing Machines on Encrypted Data

0 references

Probabilistic encryption

0 references

Functional Encryption with Bounded Collusions via Multi-party Computation

0 references

Predicate Encryption for Circuits from LWE

0 references

Leveled Fully Homomorphic Signatures from Standard Lattices

0 references

Algorithms in HElib

0 references

Bootstrapping for HElib

0 references

A Pseudorandom Generator from any One-way Function

0 references

0 references

0 references

Evaluating Branching Programs on Encrypted Data

0 references

0 references

Predicate encryption supporting disjunctions, polynomial equations, and inner products

0 references

A Survey on Polly Cracker Systems

0 references

On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption

0 references

On Ideal Lattices and Learning with Errors over Rings

0 references

Additively Homomorphic Encryption with d-Operand Multiplications

0 references

Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller

0 references

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

0 references

Two Round Multiparty Computation via Multi-key FHE

0 references

A Survey of Single-Database Private Information Retrieval: Techniques and Applications

0 references

Maliciously Circuit-Private FHE

0 references

Public-Key Cryptosystems Based on Composite Degree Residuosity Classes

0 references

Public-key cryptosystems from the worst-case shortest vector problem

0 references

Multi-key FHE from LWE, Revisited

0 references

On lattices, learning with errors, random linear codes, and cryptography

0 references

Homomorphic Encryption: From Private-Key to Public-Key

0 references

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

0 references

Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes

0 references

Fully homomorphic SIMD operations

0 references

Computing Blindfolded: New Developments in Fully Homomorphic Encryption

0 references

Fully Homomorphic Encryption over the Integers

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-57048-8_5

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5021133

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