Skip to main navigation Skip to search Skip to main content

Oblivious transfer protocols based on group factoring problem

  • Jing Li
  • , Xiong Li
  • , Licheng Wang*
  • , Debiao He
  • , Xinxin Niu
  • *Corresponding author for this work
  • Beijing University of Posts and Telecommunications
  • Hunan University of Science and Technology
  • Wuhan University

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

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.

Original languageEnglish
Title of host publicationLecture Notes on Data Engineering and Communications Technologies
PublisherSpringer Science and Business Media Deutschland GmbH
Pages885-892
Number of pages8
DOIs
Publication statusPublished - 2017
Externally publishedYes

Publication series

NameLecture Notes on Data Engineering and Communications Technologies
Volume2
ISSN (Print)2367-4512
ISSN (Electronic)2367-4520

Keywords

  • Group Fac-
  • Matrices over Group Rings
  • Oblivious Transfer
  • torization Problem

Fingerprint

Dive into the research topics of 'Oblivious transfer protocols based on group factoring problem'. Together they form a unique fingerprint.

Cite this