Name
Abstract | ||
|---|---|---|
In this paper, we propose 1-out-of-n oblivious transfer protocol by using the group of matrices over group ring Z(q)[S-m]. The security of the proposal is on the basis of factorization problems of non-commutative algebraic structures. Meanwhile, some new intractable assumptions are defined based on the group factorization problem (GFP). Subsequently, we present a simpler 1-out-of-n oblivious transfer construction for underlying non-commutative group. Furthermore, to achieve the oblivious transfer for more challenged messages, an efficient k-out-of-n oblivious transfer protocol with fewer public parameters is designed based on the newly defined hard assumptions. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-49106-6_90 | ADVANCES ON BROAD-BAND WIRELESS COMPUTING, COMMUNICATION AND APPLICATIONS |
Keywords | Field | DocType |
Oblivious Transfer,Matrices over Group Rings,Group Factorization Problem | Algebraic structure,Computer security,Matrix (mathematics),Computer science,Group ring,Theoretical computer science,Factorization,Factoring,Distributed computing,Oblivious transfer | Conference |
Volume | ISSN | Citations |
2 | 2367-4512 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jing Li | 1 | 106 | 8.87 |
| Xiong Li | 2 | 18 | 5.15 |
| Licheng Wang | 3 | 434 | 55.07 |
| Debiao He | 4 | 2856 | 147.71 |
| Xinxin Niu | 5 | 211 | 33.93 |