搜索结果: 1-15 共查到“Homomorphisms”相关记录17条 . 查询时间(0.143 秒)
Tropical cryptography II: extensions by homomorphisms
tropical cryptography public-key cryptography
2018/11/20
We use extensions of tropical algebras as platforms for very efficient public key exchange protocols.
The Cocks Identity Based Encryption (IBE) scheme, proposed in 2001 by Clifford Cocks, has been the standard for Quadratic Residue-based IBE. It had been long believed that this IBE did not have enough...
Homomorphisms between diffeomorphism groups
Homomorphisms diffeomorphism groups Geometric Topology
2012/6/25
For r at least 3, p at least 2, we classify all actions of the groups Diff^r_c(R) and Diff^r_+(S1) by C^p -diffeomorphisms on the line and on the circle. This is the same as describing all nontrivial ...
Key agreement based on homomorphisms of algebraic structures
cryptographic protocols / public-key cryptography key exchange session key agreement algebraic system universal algebra
2012/3/28
We give a generalization of the Diffie-Hellman key agreement scheme that is based on the hardness of computing homomorphic images from an algebra to another. We formulate computational and decision ve...
Secure evaluation of polynomial using privacy ring homomorphisms
elliptic curve cryptosystem factoring public-key cryptography
2011/1/18
Method of secure evaluation of polynomial y=F(x_1, …, x_k) over some rings on untrusted computer is proposed. Two models of untrusted computer are considered: passive and active. In passive model untr...
Secure evaluation of polynomial using privacy ring homomorphisms
cryptographic protocols / elliptic curve cryptosystem factoring public-key cryptography
2012/3/30
Method of secure evaluation of polynomial y=F(x_1, …, x_k) over some rings on untrusted computer is proposed. Two models of untrusted computer are considered: passive and active. In passive model untr...
Homomorphisms of abelian varieties over geometric fields of finite characteristic
Homomorphisms of abelian varieties geometric fields of finite characteristic
2011/2/25
We study analogues of Tate’s conjecture on homomorphisms for abelian varieties when the ground field is finitely generated over an algebraic closure of a finite field. Our results cover the case of ab...
We introduce some equivalent notions of homomorphisms between quantum groups that behave well with respect to duality of quantum groups. Our equivalent definitions are based on bicharacters, coactions...
Suppose that $X$ and $Y$ are surfaces of finite topological type, where $X$ has genus $g\geq 6$ and $Y$ has genus at most $2g-1$; in addition, suppose that $Y$ is not closed if it has genus $2g-1$. O...
Approximate Representations and Approximate Homomorphisms
Approximate Representations Approximate Homomorphisms
2010/10/27
Approximate algebraic structures play a defining role in arithmetic combinatorics and have
found remarkable applications to basic questions in number theory and pseudorandomness.
Here we study appro...
Approximate Representations and Approximate Homomorphisms
Approximate Representations Approximate Homomorphisms
2010/12/15
Approximate algebraic structures play a defining role in arithmetic combinatorics and have
found remarkable applications to basic questions in number theory and pseudorandomness.
Constructive homomorphisms for classical groups
Constructive homomorphisms classical groups
2010/12/1
Let GL(V ) be a quasisimple classical group in its natural representation over a finite vector space V , and let = NGL(V )().
A Topological Version of the Borel-Tits Theorem on Abstract Homomorphisms of Simple Algebraic Groups
Topological Version Borel-Tits Theorem Simple Algebraic Groups
2010/12/9
In this paper, we produce topologized versions of two theorems. One is due to Borel and Tits [2] and is concerned with abstract homomorphisms of absolutely almost simple algebraic groups.
Efficiency Limitations for $\Sigma$-Protocols for Group Homomorphisms
Generic Group Model Protocols Proofs of Knowledge Error Bounds
2009/12/29
Efficient zero-knowledge proofs of knowledge for group homomorphisms
are essential for numerous systems in applied cryptography.
Especially, protocols for proving knowledge of discrete logarithms
i...
Exponentiation in pairing-friendly groups using homomorphisms
pairings homomorphisms pairing-friendly groups
2009/6/3
We present e±ciently computable homomorphisms of the groups G2 and GT for
pairings G1 £ G2 ! GT . This allows exponentiation in G2 and GT to be accelerated using
the Gallant-Lambert-Vanstone m...