搜索结果: 1-6 共查到“军事学 Multi-key FHE”相关记录6条 . 查询时间(0.276 秒)
Efficient Multi-key FHE with short extended ciphertexts and less public parameters
Multi-key FHE BGV scheme ciphertext extension
font style='font-size:12px;'>
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...
Batched Multi-hop Multi-key FHE from ring-LWE with Compact Ciphertext Extension
multikey FHE batching BGV FHE
font style='font-size:12px;'>
2017/9/25
Traditional fully homomorphic encryption (FHE) schemes support computation on data encrypted under a single key. In STOC 2012, López-Alt et al. introduced the notion of multi-key FHE (MKFHE), which al...
Circuit-Private Multi-Key FHE
Multi-key fully homomorphic encryption computing on encrypted data
font style='font-size:12px;'>
2017/2/20
Multi-key fully homomorphic encryption (MFHE) schemes allow polynomially many users without trusted setup assumptions to send their data (encrypted under different FHE keys chosen by users independent...
Lattice-Based Fully Dynamic Multi-Key FHE with Short Ciphertexts
public-key cryptography fully homomorphic encryption
font style='font-size:12px;'>
2016/4/7
We present a multi-key fully homomorphic encryption scheme that supports an unbounded number of homomorphic operations for an unbounded number of parties. Namely, it allows to perform arbitrarily many...
Multi-Key FHE from LWE, Revisited
fully homomorphic encryption multi-key on-the-fly MPC
font style='font-size:12px;'>
2016/2/25
Traditional fully homomorphic encryption (FHE) schemes only allow computation on data encrypted
under a single key. Lopez-Alt, Tromer, and Vaikuntanathan (STOC 2012) proposed the notion of ?multi-key...
Two Round Mutliparty Computation via Multi-Key FHE
public-key cryptography Full Homomorphic Encryption MPC
font style='font-size:12px;'>
2015/12/31
We construct a general multiparty computation (MPC) protocol with only two rounds of
interaction in the common random string model, which is known to be optimal. In the honestbut-curious
setting we ...