Multikey fully homomorphic encryption and applications
From MaRDI portal
Recommendations
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Advances in cryptology - CRYPTO 2001. 21st annual international cryptology conference, Santa Barbara, CA, USA, August 19--23, 2001. Proceedings
- Advances in Cryptology - CRYPTO 2003
- Advances in cryptology - CRYPTO 2010. 30th annual cryptology conference, Santa Barbara, CA, USA, August 15--19, 2010. Proceedings
- Advances in cryptology -- CRYPTO 2011. 31st annual cryptology conference, Santa Barbara, CA, USA, August 14--18, 2011. Proceedings
- Advances in cryptology -- CRYPTO 2012. 32nd annual cryptology conference, Santa Barbara, CA, USA, August 19--23, 2012. Proceedings
- 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
- Advances in cryptology -- EUROCRYPT 2011. 30th annual international conference on the theory and applications of cryptographic techniques, Tallinn, Estonia, May 15--19, 2011. Proceedings
- Advances in cryptology -- EUROCRYPT 2013. 32nd annual international conference on the theory and applications of cryptographic techniques, Athens, Greece, May 26--30, 2013. Proceedings
- 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
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
- Batch fully homomorphic encryption over the integers
- Better bootstrapping in fully homomorphic encryption
- Between a rock and a hard place: interpolating between MPC and FHE
- Black-box proof of knowledge of plaintext and multiparty computation with low communication overhead
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Candidate Multilinear Maps from Ideal Lattices
- Computational integrity with a public random string from quasi-linear PCPs
- Definitions and properties of zero-knowledge proof systems
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Efficient NIZK arguments via parallel verification of Beneš networks
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Foundations of Cryptography
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- From secrecy to soundness: efficient verification via secure computation (extended abstract)
- Fully homomophic encryption over the integers revisited
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption over the integers with shorter public keys
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption with polylog overhead
- Fully homomorphic encryption with relatively small key and ciphertext sizes
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
- Fully homomorphic SIMD operations
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Homomorphic evaluation of the AES circuit
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 1670844 (Why is no real title available?)
- scientific article; zbMATH DE number 1808209 (Why is no real title available?)
- scientific article; zbMATH DE number 5485522 (Why is no real title available?)
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 1256784 (Why is no real title available?)
- scientific article; zbMATH DE number 1302862 (Why is no real title available?)
- scientific article; zbMATH DE number 1024063 (Why is no real title available?)
- scientific article; zbMATH DE number 1031001 (Why is no real title available?)
- scientific article; zbMATH DE number 1088230 (Why is no real title available?)
- scientific article; zbMATH DE number 1559544 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- scientific article; zbMATH DE number 1842511 (Why is no real title available?)
- scientific article; zbMATH DE number 1406779 (Why is no real title available?)
- scientific article; zbMATH DE number 6322171 (Why is no real title available?)
- Implementing Gentry's fully-homomorphic encryption scheme
- Improved delegation of computation using fully homomorphic encryption
- Improved Key Generation for Gentry’s Fully Homomorphic Encryption Scheme
- Improved security for a ring-based fully homomorphic encryption scheme
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Lattice-based FHE as secure as PKE
- Lattice-based fully dynamic multi-key FHE with short ciphertexts
- Lower bounds for non-black-box zero knowledge
- Magic functions
- Making NTRU as secure as worst-case problems over ideal lattices
- Multi-identity and multi-key leveled FHE from learning with errors
- Multi-key FHE from LWE, revisited
- Multiparty Computation from Somewhat Homomorphic Encryption
- Multiparty computation with low communication, computation and interaction via threshold FHE
- New techniques for noninteractive zero-knowledge
- Non-interactive verifiable computing: outsourcing computation to untrusted workers
- Obfuscation of probabilistic circuits and applications
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- On the (im)possibility of obfuscating programs
- On the size of pairing-based non-interactive arguments
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Perfect Non-interactive Zero Knowledge for NP
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Quadratic span programs and succinct NIZKs without PCPs
- Randomness condensers for efficiently samplable, seed-dependent sources
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- Ring switching in BGV-style homomorphic encryption
- Ring-LWE in polynomial rings
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- Scalable zero knowledge via cycles of elliptic curves
- Scalable zero knowledge via cycles of elliptic curves
- Scale-invariant fully homomorphic encryption over the integers
- Secure computation on the web: computing without simultaneous interaction
- Semi-homomorphic encryption and multiparty computation
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Short pairing-based non-interactive zero-knowledge arguments
- Spooky Encryption and Its Applications
- Square span programs with applications to succinct NIZK arguments
- Succinct non-interactive arguments via linear interactive proofs
- Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes
- Succinct NP Proofs from an Extractability Assumption
- The random oracle methodology, revisited.
- Theory of cryptography. 9th theory of cryptography conference, TCC 2012, Taormina, Sicily, Italy, March 19--21, 2012. Proceedings
- Two round multiparty computation via multi-key FHE
- Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
- Two-round secure MPC from indistinguishability obfuscation
- Why ``Fiat-Shamir for proofs lacks a proof
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Cited in
(13)- Excalibur key-generation protocols for DAG hierarchic decryption
- Multi-key fully-homomorphic encryption in the plain model
- On the security of multikey homomorphic encryption
- Fully homomorphic encryption in real world applications
- Lattice-based fully dynamic multi-key FHE with short ciphertexts
- Secure key management in the cloud
- Multiparty computation with low communication, computation and interaction via threshold FHE
- Multi-key Homomorphic Authenticators
- Blending FHE-NTRU keys -- the excalibur property
- Multi-key FHE from LWE, revisited
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Circuit-private multi-key FHE
- Decentralized Evaluation of Quadratic Polynomials on Encrypted Data
This page was built for publication: Multikey fully homomorphic encryption and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4599146)
