搜索结果: 1-15 共查到“FHE”相关记录50条 . 查询时间(0.032 秒)
Homomorphic encryption (HE) is often viewed as impractical, both in communication and computation. Here we provide an additively homomorphic encryption scheme based on (ring) LWE with nearly optimal r...
Faster Bootstrapping of FHE over the integers with large prime message space
Fully homomorphic encryption Bootstrapping Restricted depth-3 circuit
2019/5/27
Homomorphic secret sharing (HSS) is an analog of somewhat- or fully homomorphic encryption (S/FHE) to the setting of secret sharing, with applications including succinct secure computation, private ma...
Short Discrete Log Proofs for FHE and Ring-LWE Ciphertexts
Zero-Knowledge Proofs Bulletproofs FHE
2019/1/26
In applications of fully-homomorphic encryption (FHE) that involve computation on encryptions produced by several users, it is important that each user proves that her input is indeed well-formed. Thi...
Non-Interactive Zero Knowledge and Correlation Intractability from Circular-Secure FHE
NIZK LWE
2019/1/4
We construct non-interactive zero-knowledge (NIZK) arguments for NPNP from any circular-secure fully homomorphic encryption (FHE) scheme. In particular, we obtain such NIZKs under a circular-secure va...
Multikey fully homomorphic encryption (MFHE) allows homomorphic operations between ciphertexts encrypted under different keys. In applications for secure multiparty computation (MPC)protocols, MFHE ca...
The FHE (fully homomorphic encryption) schemes [7, 13] based on the modified AGCD problem (noise-free AGCD problem) are vulnerable to quantum attacks, because its security relies partly on the hardnes...
Faster Homomorphic Discrete Fourier Transforms and Improved FHE Bootstrapping
Discrete Fourier Transform Homomorphic Encryption Bootstrapping
2018/11/12
In this work, we propose a faster homomorphic linear transform algorithm for structured matrices such as the discrete Fourier transform (DFT) and linear transformations in bootstrapping.
Efficient Multi-key FHE with short extended ciphertexts and less public parameters
Multi-key FHE BGV scheme ciphertext extension
2018/11/2
Multi-Key Full Homomorphic Encryption scheme (MKFHE) can perform arbitrary operation on encrypted data under different public keys (users), and the final ciphertext can be jointly decrypted. Therefore...
Blending FHE-NTRU keys – The Excalibur Property
cryptographic protocols multiparty computaion fully homomorphic encryption
2018/9/6
Can Bob give Alice his decryption secret and be convinced that she will not give it to someone else? This is achieved by a proxy re-encryption scheme where Alice does not have Bob’s secret but instead...
Quantum FHE (Almost) As Secure as Classical
fully homomorphic encryption learning with errors quantum computation
2018/4/12
Fully homomorphic encryption schemes (FHE) allow to apply arbitrary efficient computation to encrypted data without decrypting it first. In Quantum FHE (QFHE) we may want to apply an arbitrary quantum...
Doing Real Work with FHE: The Case of Logistic Regression
Homomorphic Encryption Implementation Logistic Regression
2018/3/5
We describe our recent experience, building a system that uses fully-homomorphic encryption (FHE) to approximate the coefficients of a logistic-regression model, built from genomic data. The aim of th...
Homomorphic Lower Digits Removal and Improved FHE Bootstrapping
Fully Homomorphic Encryption Bootstrapping
2018/1/19
Bootstrapping is a crucial operation in Gentry's breakthrough work on fully homomorphic encryption (FHE), where a homomorphic encryption scheme evaluates its own decryption algorithm. There has been a...
Zero-Knowledge Proof of Decryption for FHE Ciphertexts
zero knowledge fully homomorphic encryption verifiable decryption
2018/1/11
Zero-knowledge proofs of knowledge and fully-homomorphic encryption are two areas that have seen considerable advances in recent years, and these two techniques are used in conjunction in the context ...
Large FHE gates from Tensored Homomorphic Accumulator
Fully Homomorphic Encryption Large Gates Threshold Gates
2017/10/12
The main bottleneck of all known Fully Homomorphic Encryption schemes lies in the bootstrapping procedure invented by Gentry (STOC'09). The cost of this procedure can be mitigated either using Homomor...