Multikey fully homomorphic encryption and applications (Q4599146)

scientific article; zbMATH DE number 6819711

Language	Label	Description	Also known as
default for all languages	No label defined
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 (extended abstract)

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 Beneš 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