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 条
  • [41] Non-interactive Confirmer Signatures
    Chow, Sherman S. M.
    Haralambiev, Kristiyan
    TOPICS IN CRYPTOLOGY - CT-RSA 2011, 2011, 6558 : 49 - +
  • [42] Secure verifiable non-interactive oblivious transfer protocol using RSA and Bit commitment on distributed environment
    Kim, Soongohn
    Kim, Seoksoo
    Lee, Geuk
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF GRID COMPUTING AND ESCIENCE, 2009, 25 (03): : 352 - 357
  • [43] Non-interactive proofs of proximity
    Gur, Tom
    Rothblum, Ron D.
    COMPUTATIONAL COMPLEXITY, 2018, 27 (01) : 99 - 207
  • [44] Hide the Modulus: A Secure Non-Interactive Fully Verifiable Delegation Scheme for Modular Exponentiations via CRT
    Uzunkol, Osmanbey
    Rangasamy, Jothi
    Kuppusamy, Lakshmi
    INFORMATION SECURITY (ISC 2018), 2018, 11060 : 250 - 267
  • [45] Unconditionally non-interactive verifiable secret sharing secure against faulty majorities in the commodity based model
    Nascimento, ACA
    Mueller-Quade, J
    Otsuka, A
    Hanaoka, G
    Imai, H
    APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, PROCEEDINGS, 2004, 3089 : 355 - 368
  • [46] Non-interactive Universal Arguments
    Bitansky, Nir
    Paneth, Omer
    Shamir, Dana
    Solomon, Tomer
    ADVANCES IN CRYPTOLOGY - CRYPTO 2023, PT II, 2023, 14082 : 132 - 158
  • [47] Non-Interactive Anonymous Router
    Shi, Elaine
    Wu, Ke
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2021, PT III, 2021, 12698 : 489 - 520
  • [48] Non-interactive private auctions
    Baudron, O
    Stern, J
    FINANCIAL CRYPTOGRAPHY, PROCEEDINGS, 2002, 2339 : 364 - 377
  • [49] Non-interactive proofs of proximity
    Tom Gur
    Ron D. Rothblum
    computational complexity, 2018, 27 : 99 - 207
  • [50] Non-Interactive Key Exchange
    Freire, Eduarda S. V.
    Hofheinz, Dennis
    Kiltz, Eike
    Paterson, Kenneth G.
    PUBLIC-KEY CRYPTOGRAPHY - PKC 2013, 2013, 7778 : 254 - 271
12345