The essential design principles of verifiable non-interactive OT protocols

被引：1
|
作者：
Chang, Ya-Fen [1 ]
Shiao, Wei-Cheng [2 ]
机构：
[1] Natl Taichung Inst Technol, Dept Comp Sci & Informat Engn, Taichung 404, Taiwan
[2] Natl Taichung Inst Technol, Grad Sch Comp Sci & Informat Technol, Taichung 404, Taiwan
来源：
ISDA 2008: EIGHTH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS DESIGN AND APPLICATIONS, VOL 3, PROCEEDINGS | 2008年
关键词：
D O I：
10.1109/ISDA.2008.94
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
OT (oblivious transfer) is an important e-commerce technique to make information buyers be able to get desired information and preserve privacy at the same time. Recently, Kim et al. proposed two 1-out-of-2 MOT (non-interactive OT) schemes. They claimed the message sender can be verified in their schemes. Unfortunately, their schemes are insecure. In this paper, we will make thorough discussions on the design principles of secure verifiable NIOT schemes.
引用
收藏
页码：241 / +
页数：2
相关论文
共 50 条
  • [1] Non-interactive oblivious transfer protocols
    Qin Jing
    Zhao Hua-wei
    Wang Ming-Qiang
    2009 INTERNATIONAL FORUM ON INFORMATION TECHNOLOGY AND APPLICATIONS, VOL 2, PROCEEDINGS, 2009, : 120 - +
  • [2] A novel non-interactive verifiable secret sharing scheme
    Ao, Jun
    Liao, Guisheng
    Ma, Chunbo
    2006 10TH INTERNATIONAL CONFERENCE ON COMMUNICATION TECHNOLOGY, VOLS 1 AND 2, PROCEEDINGS, 2006, : 1525 - +
  • [3] Multi-Client Non-interactive Verifiable Computation
    Choi, Seung Geol
    Katz, Jonathan
    Kumaresan, Ranjit
    Cid, Carlos
    THEORY OF CRYPTOGRAPHY (TCC 2013), 2013, 7785 : 499 - 518
  • [4] Non-interactive publicly verifiable electronic voting scheme
    Information Engineering Institute, Information Engineering University, Zhengzhou 450002, China
    Kongzhi yu Juece Control Decis, 2006, 1 (107-110):
  • [5] A non-interactive modular verifiable secret sharing scheme
    Li, Q
    Wang, ZF
    Niu, XM
    Sun, SH
    2005 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CIRCUITS AND SYSTEMS, VOLS 1 AND 2, PROCEEDINGS: VOL 1: COMMUNICATION THEORY AND SYSTEMS, 2005, : 84 - 87
  • [6] Non-interactive verifiable privacy-preserving federated learning
    Xu, Yi
    Peng, Changgen
    Tan, Weijie
    Tian, Youliang
    Ma, Minyao
    Niu, Kun
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2022, 128 : 365 - 380
  • [7] Efficient non-interactive deniable authentication protocols
    Qian, HF
    Cao, ZF
    Wang, LC
    Xue, QS
    FIFTH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY - PROCEEDINGS, 2005, : 673 - 679
  • [8] Non-interactive Cryptographic Timestamping Based on Verifiable Delay Functions
    Landerreche, Esteban
    Stevens, Marc
    Schaffner, Christian
    FINANCIAL CRYPTOGRAPHY AND DATA SECURITY, FC 2020, 2020, 12059 : 541 - 558
  • [9] Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
    Gennaro, Rosario
    Gentry, Craig
    Parno, Bryan
    ADVANCES IN CRYPTOLOGY - CRYPTO 2010, 2010, 6223 : 465 - 482
  • [10] A Practical (Non-interactive) Publicly Verifiable Secret Sharing Scheme
    Jhanwar, Mahabir Prasad
    INFORMATION SECURITY PRACTICE AND EXPERIENCE, 2011, 6672 : 273 - 287
12345