Thus f is a homomorphism of the two underlying semilattices.
A(f)是同态当且仅当f是连续开映射。
A(f) is a homomorphism if and only if f is a continuous open map.
如果f是双射,那么它的逆映射f-1也是环同态。
If f is bijective, then its inverse f-1 is also a ring homomorphism.
如果f:R→S是一个满环同态,则f(J(R))⊆J(S)。
If f: R→ S is a surjective ring homomorphism, then f(J(R))⊆ J(S).
如果f是双射,那么它的逆映射f-1也是环同态。
If in addition f is a bijection,then its inverse f-1 is also a ring homomorphism.
NuCypher最近发布了一些加速同态处理的软件。
NuCypher recently released some software that speeds up the homomorphic process dramatically.
同态加密是安全性和隐私的圣杯,因为它消除了巨大的挑战。
Homomorphic encryption is the Holy Grail of security and privacy since it removes huge challenges.
更加精确地,如果R和S是环,则环同态是一个函数f:R→S,使得:.
More precisely, if R and S are rings,then a ring homomorphism is a function f: R→ S such that[1].
同态加密将很快被部署于金融领域,以保护敏感的银行数据。
Homomorphic encryption will be deployed soon in the financial sector to protect sensitive banking data.
核子诱发frame同态;locale的子集叫做sublocale如果它给出自一个核子。
Nuclei induce frame homomorphisms; a subset of a locale is called a sublocale if it is given by a nucleus.
同态加密是一种解决该问题的新思想,允许用户在不解密的情况下处理数据。
Homomorphic encryption is a new idea to solve this problem, allowing users to process data without decryption.
诸如零知识证明(ZKPs)和zk-SNARK之类的密码学技术已经使用了同态加密。
Cryptographic techniques such as Zero Knowledge Proofs(ZKPs)and zk-SNARKs already use homomorphic encryption.
同态加密是一种解决该问题的新思想,允许用户在不解密的情况下处理数据。
Homomorphic encryption is a new idea that solves that problem, allowing users to process data without decrypting it.
我们可能预计当D是单连通时最简单,因为两个上面同态的定义域都是平凡群。
We might expect this to be simplest when D is simply connected,since then both homomorphisms above have trivial domain.
每个同态对应一个狄拉克单极(Diracmonopole);整系数上同调群对应于电荷的量子化。
Each homomorphism corresponds to a Dirac monopole; the integer cohomology groups correspond to the quantization of the electric charge.
在密码学的其他领域也有一些有趣的发展,比如完全同态加密和量子密码学。
There are interesting developments in other areas of cryptography too,such as fully homomorphic encryption and quantum cryptography.
至于同态加密-一种允许对加密数据进行计算的加密形式--它有点慢,计算量也很高。
As for homomorphic encryption- a form of encryption that allows computation on encrypted data- it's somewhat slow and computationally demanding.
Maximova和V.Rybakov已经证明了ρ、τ和σ实际上是完全格同态。
Maksimova and V. Rybakov have shown that ρ, τ, and σ are actually complete,join-complete and meet-complete lattice homomorphisms respectively.
通过乘以另一个秘密值k来混淆同态加密值,证明者也能够隐藏其原始信息。
By multiplying by another secret value k to obfuscate the homomorphic encrypted values, the prover is able to hide their original information as well.
关于函数方程的稳定性问题,早在1940年S.M.Ulam[1]提出了群同态的稳定性。
The stability problem of functional equations originated from a question of Ulam[1] in 1940,concerning the stability of group homomorphisms.
同态加密允许对加密数据进行处理,使我们能够使用这些服务而不暴露我们的私人信息。
Homomorphic encryption, which allows processing of encrypted data, gives us the ability to use these services without exposing our private information.
它们具有很强的安全性,可以进行密钥交换,数字签名以及完全同态加密等更复杂的构造。
Lattices posses strong security reductions, are capable of key exchanges, digital signatures,as well as more complex features like full homomorphic encryption.
他的研究着眼于令用户重掌数据控制权、云计算安全与隐私所面临的挑战、数据溯源和同态加密。
His research focusses on returning data control to users, and challenges in cloud computing security and privacy,data provenance, and homomorphic encryption.
On the production side, Bergamaschi and team worked with a U.S.-based banking client toencrypt a machine learning process using homomorphic techniques.
它们具有很强的安全性,能够进行密钥交换、数字签名,以及构造出像全同态加密这样复杂的算法。
They have strong security reductions and are capable of key exchanges, digital signatures,and far more sophisticated constructions like fully homomorphic encryption.
通过零知识证明、同态加密、差分隐私等密码学技术实现最高级数据安全保障;
Guarantee user data privacy: achieve the highest level of data security throughcryptographic techniques such as zero-knowledge proof, homomorphic encryption, and differential privacy;
保障用户数据隐私性:通过零知识证明、同态加密、差分隐私等密码学技术实现最高级数据安全保障;
Guarantee user data privacy: achieve the highest level of data security throughcryptographic techniques such as zero-knowledge proof, homomorphic encryption, and differential privacy;
There are many technologies to explore, such as zero-knowledge proofs and zk-snarks/starks, trusted execution environments,secure multi-party computation and fully homomorphic encryption.
English
Bahasa indonesia
日本語
عربى
Български
বাংলা
Český
Dansk
Deutsch
Ελληνικά
Español
Suomi
Français
עִברִית
हिंदी
Hrvatski
Magyar
Italiano
Қазақ
한국어
മലയാളം
मराठी
Bahasa malay
Nederlands
Norsk
Polski
Português
Română
Русский
Slovenský
Slovenski
Српски
Svenska
தமிழ்
తెలుగు
ไทย
Tagalog
Turkce
Українська
اردو
Tiếng việt