Multikey Fully Homomorphic Encryption and Applications (Q4599146)

scientific article; zbMATH DE number 6819711

Language	Label	Description	Also known as
English	Multikey Fully Homomorphic Encryption and Applications	scientific article; zbMATH DE number 6819711

Statements

instance of

scholarly article

0 references

title

Multikey Fully Homomorphic Encryption and Applications (English)

0 references

0 references

0 references

0 references

SIAM Journal on Computing

0 references

publication date

18 December 2017

0 references

zbMATH Keywords

fully homomorphic encryption

0 references

multiparty computation

0 references

cloud computing

0 references

NTRU encryption

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

Q2754165

0 references

Q4526993

0 references

A Subfield Lattice Attack on Overstretched NTRU Assumptions

0 references

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

0 references

From Secrecy to Soundness: Efficient Verification via Secure Computation

0 references

Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE

0 references

Q4783716

0 references

On the (im)possibility of obfuscating programs

0 references

Lower bounds for non-black-box zero knowledge

0 references

Computational Integrity with a Public Random String from Quasi-Linear PCPs

0 references

Scalable Zero Knowledge via Cycles of Elliptic Curves

0 references

Scalable zero knowledge via cycles of elliptic curves

0 references

Semi-homomorphic Encryption and Multiparty Computation

0 references

From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again

0 references

Recursive composition and bootstrapping for SNARKS and proof-carrying data

0 references

Succinct Non-interactive Arguments via Linear Interactive Proofs

0 references

Why “Fiat-Shamir for Proofs” Lacks a Proof

0 references

Q4341754

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

(Leveled) fully homomorphic encryption without bootstrapping

0 references

Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts

0 references

Efficient Fully Homomorphic Encryption from (Standard) LWE

0 references

Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages

0 references

Lattice-based FHE as secure as PKE

0 references

Q4228521

0 references

The random oracle methodology, revisited

0 references

Obfuscation of Probabilistic Circuits and Applications

0 references

Batch Fully Homomorphic Encryption over the Integers

0 references

An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero

0 references

Fully Homomophic Encryption over the Integers Revisited

0 references

Between a Rock and a Hard Place: Interpolating between MPC and FHE

0 references

Improved Delegation of Computation Using Fully Homomorphic Encryption

0 references

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

0 references

Scale-Invariant Fully Homomorphic Encryption over the Integers

0 references

Fully Homomorphic Encryption over the Integers with Shorter Public Keys

0 references

Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers

0 references

Theory of cryptography. 9th theory of cryptography conference, TCC 2012, Taormina, Sicily, Italy, March 19--21, 2012. Proceedings

0 references

Q3149671

0 references

Q4940695

0 references

Succinct NP Proofs from an Extractability Assumption

0 references

Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography

0 references

Scalable Multiparty Computation with Nearly Optimal Work and Resilience

0 references

Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits

0 references

Multiparty Computation from Somewhat Homomorphic Encryption

0 references

Square Span Programs with Applications to Succinct NIZK Arguments

0 references

Spooky Encryption and Its Applications

0 references

Randomness Condensers for Efficiently Samplable, Seed-Dependent Sources

0 references

Ring-LWE in Polynomial Rings

0 references

Magic Functions

0 references

How To Prove Yourself: Practical Solutions to Identification and Signature Problems

0 references

Advances in cryptology -- EUROCRYPT 2016. 35th annual international conference on the theory and applications of cryptographic techniques, Vienna, Austria, May 8--12, 2016. Proceedings. Part II

0 references

A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms

0 references

Candidate Multilinear Maps from Ideal Lattices

0 references

Two-Round Secure MPC from Indistinguishability Obfuscation

0 references

Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits

0 references

Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation

0 references

Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers

0 references

Quadratic Span Programs and Succinct NIZKs without PCPs

0 references

Fully homomorphic encryption using ideal lattices

0 references

Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits

0 references

Implementing Gentry’s Fully-Homomorphic Encryption Scheme

0 references

Ring Switching in BGV-Style Homomorphic Encryption

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

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

0 references

Separating succinct non-interactive arguments from all falsifiable assumptions

0 references

Advances in cryptology -- EUROCRYPT 2010. 29th annual international conference on the theory and applications of cryptographic techniques, French Riviera, May 30 -- June 3, 2010. Proceedings

0 references

Foundations of Cryptography

0 references

Q4364546

0 references

Definitions and properties of zero-knowledge proof systems

0 references

Q3549691

0 references

Short Pairing-Based Non-interactive Zero-Knowledge Arguments

0 references

On the Size of Pairing-Based Non-interactive Arguments

0 references

Perfect Non-interactive Zero Knowledge for NP

0 references

New Techniques for Noninteractive Zero-Knowledge

0 references

Q4249347

0 references

Secure Computation on the Web: Computing without Simultaneous Interaction

0 references

Q3840170

0 references

Advances in cryptology -- EUROCRYPT 2013. 32nd annual international conference on the theory and applications of cryptographic techniques, Athens, Greece, May 26--30, 2013. Proceedings

0 references

Q4343444

0 references

Advances in cryptology - CRYPTO 2001. 21st annual international cryptology conference, Santa Barbara, CA, USA, August 19--23, 2001. Proceedings

0 references

Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments

0 references

Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes

0 references

Efficient NIZK Arguments via Parallel Verification of Benes Networks

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

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

0 references

Two Round Multiparty Computation via Multi-key FHE

0 references

Black-Box Proof of Knowledge of Plaintext and Multiparty Computation with Low Communication Overhead

0 references

Advances in Cryptology - CRYPTO 2003

0 references

Q5494412

0 references

Public-Key Cryptosystems Based on Composite Degree Residuosity Classes

0 references

Advances in cryptology -- EUROCRYPT 2011. 30th annual international conference on the theory and applications of cryptographic techniques, Tallinn, Estonia, May 15--19, 2011. Proceedings

0 references

Multi-key FHE from LWE, Revisited

0 references

Advances in cryptology - CRYPTO 2010. 30th annual cryptology conference, Santa Barbara, CA, USA, August 15--19, 2010. Proceedings

0 references

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

0 references

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

0 references

Advances in cryptology -- CRYPTO 2011. 31st annual cryptology conference, Santa Barbara, CA, USA, August 14--18, 2011. Proceedings

0 references

Advances in cryptology -- CRYPTO 2012. 32nd annual cryptology conference, Santa Barbara, CA, USA, August 19--23, 2012. Proceedings

0 references

Q4783745

0 references

Improved Key Generation for Gentry’s Fully Homomorphic Encryption Scheme

0 references

Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes

0 references

Fully homomorphic SIMD operations

0 references

Making NTRU as Secure as Worst-Case Problems over Ideal Lattices

0 references

Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency

0 references

Fully Homomorphic Encryption over the Integers

0 references

full work available at URL

https://doi.org/10.1137/14100124x

0 references

Identifiers

zbMATH Open document ID

1382.68058

0 references

DOI

10.1137/14100124X

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4599146