搜索结果: 1-10 共查到“Somewhat Homomorphic Encryption”相关记录10条 . 查询时间(0.14 秒)
Overdrive2k: Efficient Secure MPC over $Z_{2^k}$ from Somewhat Homomorphic Encryption
cryptographic protocols Somewhat Homomorphic Encryption
2019/2/25
Recently, Cramer et al. (CRYPTO 2018) presented a protocol, SPDZ2k, for actively secure multiparty computation for dishonest majority in the pre-processing model over the ring Z2kZ2k, instead of over ...
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...
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...
A key recovery attack to the scale-invariant NTRU-based somewhat homomorphic encryption scheme
key recovery attack private key
2016/1/6
In this paper we present a key recovery attack to the scale-invariant NTRU-based somewhat homomorphic encryption scheme proposed by Bos et al~\cite{NTRUbasedFHE} in 2013. The attack allows us to compu...
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...
The purpose of this paper is to compare side-by-side the NTRU and
BGV schemes in their non-scale invariant (messages in the lower bits), and their
scale invariant (message in the upper bits) forms. ...
Private Database Queries Using Somewhat Homomorphic Encryption
Somewhat Homomorphic Encryption Database
2015/8/5
In a private database query system, a client issues queries to a database and obtains the results without learning anything else about the database and without the server learning the query. While pre...
Private Database Queries Using Somewhat Homomorphic Encryption
private database queries somewhat homomorphic encryption
2014/3/12
In a private database query system, a client issues queries to a database and obtains the results without learning anything else about the database and without the server learning the query. While pre...
We propose a general multiparty computation protocol secure against an active adversary corrupting up to $n-1$ of the $n$ players. The protocol may be used to compute securely arithmetic circuits over...