Oblivious Transfer Protocols Based on Group Factoring Problem
J Li, X Li, L Wang, D He, X Niu - … and Applications: Proceedings of the 11th …, 2017 - Springer
J Li, X Li, L Wang, D He, X Niu
Advances on Broad-Band Wireless Computing, Communication and Applications …, 2017•SpringerIn this paper, we propose 1-out-of-n oblivious transfer proto-col by using the group of
matrices over group ring Zq [Sm]. The security of the proposal is on the basis of factorization
problems of non-commutative algebraic structures. Meanwhile, some new intractable
assumptions are de_ned based on the group factorization problem (GFP). Subsequently, we
present a simpler 1-out-of-n oblivious transfer construction for un-derlying non-commutative
group. Furthermore, to achieve the oblivious transfer for more challenged messages, an …
matrices over group ring Zq [Sm]. The security of the proposal is on the basis of factorization
problems of non-commutative algebraic structures. Meanwhile, some new intractable
assumptions are de_ned based on the group factorization problem (GFP). Subsequently, we
present a simpler 1-out-of-n oblivious transfer construction for un-derlying non-commutative
group. Furthermore, to achieve the oblivious transfer for more challenged messages, an …
Abstract
In this paper, we propose 1-out-of-n oblivious transfer proto-col by using the group of matrices over group ring Zq[Sm]. The security of the proposal is on the basis of factorization problems of non-commutative algebraic structures. Meanwhile, some new intractable assumptions are de_ned based on the group factorization problem (GFP). Subsequently, we present a simpler 1-out-of-n oblivious transfer construction for un- derlying non-commutative group. Furthermore, to achieve the oblivious transfer for more challenged messages, an e_cient k-out-of-n oblivious transfer protocol with fewer public parameters is designed based on the newly de_ned hard assumptions.
Springer
Showing the best result for this search. See all results