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 条
  • [21] Non-interactive verifiable LWE-based multi secret sharing scheme
    Niloofar Kiamari
    Massoud Hadian
    Samaneh Mashhadi
    Multimedia Tools and Applications, 2023, 82 : 22175 - 22187
  • [22] Non-interactive verifiable LWE-based multi secret sharing scheme
    Kiamari, Niloofar
    Hadian, Massoud
    Mashhadi, Samaneh
    MULTIMEDIA TOOLS AND APPLICATIONS, 2023, 82 (14) : 22175 - 22187
  • [23] Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs
    Bitansky, Nir
    JOURNAL OF CRYPTOLOGY, 2020, 33 (02) : 459 - 493
  • [24] Non-interactive, Secure Verifiable Aggregation for Decentralized, Privacy-Preserving Learning
    Brunetta, Carlo
    Tsaloli, Georgia
    Liang, Bei
    Banegas, Gustavo
    Mitrokotsa, Aikaterini
    INFORMATION SECURITY AND PRIVACY, ACISP 2021, 2021, 13083 : 510 - 528
  • [25] Adaptive and Composable Non-interactive String-Commitment Protocols
    Zhu, Huafei
    Araragi, Tadashi
    Nishide, Takashi
    Sakurai, Kouichi
    E-BUSINESS AND TELECOMMUNICATIONS, 2012, 222 : 233 - +
  • [26] Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs
    Bitansky, Nir
    THEORY OF CRYPTOGRAPHY, TCC 2017, PT II, 2017, 10678 : 567 - 594
  • [27] Unbounded Non-Malleable Non-Interactive Zero Knowledge Protocols for NP
    Huang Guifang
    Lin Dongdai
    CHINESE JOURNAL OF ELECTRONICS, 2009, 18 (03): : 400 - 404
  • [28] NEW APPROACH FOR DESIGN OF NON-INTERACTIVE SYSTEMS
    VISWANADHAM, N
    ATHERTON, DP
    INTERNATIONAL JOURNAL OF CONTROL, 1976, 23 (04) : 535 - 540
  • [29] ON DESIGN OF NON-INTERACTIVE, LEFT INVERTIBLE SYSTEMS
    WOLOVICH, WA
    INTERNATIONAL JOURNAL OF CONTROL, 1978, 28 (02) : 165 - 186
  • [30] Sparse Matrix Masking-Based Non-Interactive Verifiable (Outsourced) Computation, Revisited
    Zhao, Liang
    Chen, Liqun
    IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2020, 17 (06) : 1188 - 1206
12345