搜索结果: 1-7 共查到“军事学 Homomorphism”相关记录7条 . 查询时间(0.037 秒)
Homomorphism learning problems and its applications to public-key cryptography
Learning With Errors isogenies non-commutative cryptography
2019/6/19
We present a framework for the study of a learning problem over abstract groups, and introduce a new technique which allows for public-key encryption using generic groups. We proved, however, that in ...
On Noncommutative Cryptography and homomorphism of stable cubical multivariate transformation groups of infinite dimensional affine spaces
Multivariate Cryptography stable transformation groups and semigroups decomposition problem of nonlinear multivariate map into given generators
2019/6/3
Noncommutative cryptography is based on applications of algebraic structures like noncommutative groups, semigroups and non-commutative rings. Its inter-section with Multivariate cryptography contains...
Efficient UC Commitment Extension with Homomorphism for Free (and Applications)
cryptographic protocols UC
2018/11/5
Homomorphic universally composable (UC) commitments allow for the sender to reveal the result of additions and multiplications of values contained in commitments without revealing the values themselve...
A Zoo of Homomorphic Signatures: Multi-Key and Key-Homomorphism
foundations digital signatures
2016/12/10
Homomorphic signatures (HS) allow evaluation of signed messages by producing a signature on a function of messages signed by the same key. Motivated by the vast potential of applications, we initiate ...
On the Impossibility of Merkle Merge Homomorphism
hash functions digital signature homomorphism
2016/6/17
This work considers a theoretic problem of merging the digests of two ordered lists “homomorphically.” This theoretic problem has potential applications to efficient and verifiable data outsourcing, w...
A Cryptanalysis of the Original Domingo-Ferrer's Algebraic Privacy Homomorphism
Privacy homomorphism Encrypted Data Database Security
2009/4/10
We propose a cryptanalysis of the original Domingo-Ferrer's alge-
braic privacy homomorphism. We show that the scheme over Zn can be broken by
d + 1 known plaintexts in O(d3 log2 n) time when it has...
Zero-Knowledge Proofs for Mix-nets of Secret Shares and a Version of ElGamal with Modular Homomorphism
Zero-Knowledge Proofs Mix-nets Secret Shares ElGamal Modular Homomorphism
2009/1/20
Mix-nets can be used to shuffle vectors of shared secrets. This operation can be an important building block for solving combinatorial problems where constraints depend on secrets of di erent particip...