搜索结果: 1-15 共查到“密码学 homomorphic encryption schemes”相关记录16条 . 查询时间(0.221 秒)
Cryptanalysis of Ring Homomorphic Encryption Schemes
homomorphic encryption schemes quantum computing key-recovery attack
2019/6/3
We analyze the structure of finite commutative rings with respect to its idempotent and nilpotent elements. Based on this analysis we provide a quantum-classical IND-CCA^1 attack for ring homomorphic ...
Efficient Evaluation of Low Degree Multivariate Polynomials in Ring-LWE Homomorphic Encryption Schemes
homomorphic encryption efficient polynomial evaluation ring lwe
2018/6/27
Homomorphic encryption schemes allow to perform computations over encrypted data. In schemes based on RLWE assumption the plaintext data is a ring polynomial. In many use cases of homomorphic encrypti...
We analyze the structure of commutative ring homomorphic encryption schemes and show that they are not quantum IND-CCA secure.
A Full RNS Variant of FV like Somewhat Homomorphic Encryption Schemes
Lattice-based Cryptography Homomorphic Encryption FV
2016/5/26
Since Gentry's breakthrough work in 2009, homomorphic cryptography has received a widespread attention. Implementation of a fully homomorphic cryptographic scheme is however still highly expensive. So...
Partially homomorphic encryption schemes over finite fields
Homomorphic encryption q-ary functions perfect secrecy
2016/5/3
Homomorphic encryption scheme enables computation in the encrypted domain,
which is of great importance because of its wide and growing range of applications.
The main issue with the known fully (or...
A Comparison of the Homomorphic Encryption Schemes FV and YASHE
Leveled Homomorphic Encryption Parameter Selection Implementations
2016/1/26
We conduct a theoretical and practical comparison of two Ring-LWE-based, scale-invariant,
leveled homomorphic encryption schemes – Fan and Vercauteren’s adaptation of BGV and the YASHE
scheme propos...
On Key Recovery Attacks against Existing Somewhat Homomorphic Encryption Schemes
Somewhat Homomorphic Encryption Key Recovery Attack,
2016/1/8
In his seminal paper at STOC 2009, Gentry left it as a future work to
investigate (somewhat) homomorphic encryption schemes with IND-CCA1 security.
At SAC 2011, Loftus et al. showed an IND-CCA1 atta...
Key Recovery Attacks against NTRU-based Somewhat Homomorphic Encryption Schemes
Somewhat Homomorphic Encryption Key Recovery Attack IND-CCA1 Security
2016/1/4
A key recovery attack allows an attacker to recover the private key of an
underlying encryption scheme when given a number of decryption oracle accesses. Previous
research has shown that most existi...
Adaptive key recovery attacks on NTRU-based somewhat homomorphic encryption schemes
NTRU-based homomorphic encryption adaptive key recovery attack
2016/1/4
In this paper we present adaptive key recovery attacks on NTRU-based somewhat homomorphic
encryption schemes. Among such schemes, we study the proposal by Bos et al [BLLN13]
in 2013. Given access to...
Notes on Two Fully Homomorphic Encryption Schemes Without Bootstrapping
public-key cryptography fully homomorphic encryption
2015/12/30
Recently, IACR ePrint archive posted two fully homomorphic encryption
schemes without bootstrapping. In this note, we show that these schemes are
trivially insecure. Furthermore, we also show that t...
On Evaluating Circuits with Inputs Encrypted by Different Fully Homomorphic Encryption Schemes
Fully Homomorphic Encryption Multi-Scheme FHE Trivial Encryptions Ciphertext Trees Multiparty Computations
2013/4/18
We consider the problem of evaluating circuits whose inputs are encrypted with possibly different encryption schemes. Let $\mathcal{C}$ be any circuit with input $x_1, \dots, x_t \in \{0,1\}$, and let...
Improving Additive and Multiplicative Homomorphic Encryption Schemes Based on Worst-Case Hardness Assumptions}
homomorphic encryption secure function evaluation lattices
2012/6/14
In CRYPTO 2010, Aguilar et al. proposed a somewhat homomorphic encryption scheme, i.e. an encryption scheme allowing to compute a limited amount of sums and products over encrypted data, with a securi...
Improving Additive and Multiplicative Homomorphic Encryption Schemes Based on Worst-Case Hardness Assumptions}
homomorphic encryption secure function evaluation lattices
2012/3/22
In CRYPTO 2010, Aguilar et al. proposed a somewhat homomorphic encryption scheme, i.e. an encryption scheme allowing to compute a limited amount of sums and products over encrypted data, with a securi...
Improving Additive and Multiplicative Homomorphic Encryption Schemes Based on Worst-Case Hardness Assumptions}
homomorphic encryption secure function evaluation lattices
2012/3/21
In CRYPTO 2010, Aguilar et al. proposed a somewhat homomorphic encryption scheme, i.e. an encryption scheme allowing to compute a limited amount of sums and products over encrypted data, with a securi...
On Constructing Homomorphic Encryption Schemes from Coding Theory
foundations Homomorphic Encryption Coding Theory Efficiency
2011/7/25
Homomorphic encryption schemes are powerful cryptographic primitives that allow for a variety of applications.