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 条

[31] Non-Interactive Fair Deniable Authentication Protocols with Indistinguishable Confidentiality and Anonymity
Hwang, Shin-Jia
Chi, Jen-Fu
JOURNAL OF APPLIED SCIENCE AND ENGINEERING, 2013, 16 (03): : 305 - 318
[32] A non-interactive (t, n)-publicly verifiable multi-secret sharing scheme
Mashahdi, Samaneh
Bagherpour, Bagher
Zaghian, Ali
DESIGNS CODES AND CRYPTOGRAPHY, 2022, 90 (08) : 1761 - 1782
[33] A non-interactive (t, n)-publicly verifiable multi-secret sharing scheme
Samaneh Mashahdi
Bagher Bagherpour
Ali Zaghian
Designs, Codes and Cryptography, 2022, 90 : 1761 - 1782
[34] Non-Interactive Plaintext (In-)Equality Proofs and Group Signatures with Verifiable Controllable Linkability
Blazy, Olivier
Derler, David
Slamanig, Daniel
Spreitzer, Raphael
TOPICS IN CRYPTOLOGY - CT-RSA 2016, 2016, 9610 : 127 - 143
[35] Making Sigma-Protocols Non-interactive Without Random Oracles
Chaidos, Pyrros
Groth, Jens
PUBLIC-KEY CRYPTOGRAPHY - PKC 2015, 2015, 9020 : 650 - 670
[36] Two non-interactive key agreement protocols under certificateless scenarios
Sang, Yongxuan
Zhang, Lili
You, Lin
Li, Zhongwen
International Journal of Advancements in Computing Technology, 2012, 4 (06) : 331 - 337
[37] Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation
Boyle, Elette
Couteau, Geoffroy
Gilboa, Niv
Ishai, Yuval
Kohl, Lisa
Rindal, Peter
Scholl, Peter
PROCEEDINGS OF THE 2019 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (CCS'19), 2019, : 291 - 308
[38] Non-interactive Zero-Knowledge from Non-interactive Batch Arguments
Champion, Jeffrey
Wu, David J.
ADVANCES IN CRYPTOLOGY - CRYPTO 2023, PT II, 2023, 14082 : 38 - 71
[39] InfinityRand: Blockchain Non-Interactive Randomness Beacon Protocol Based on Trapdoor Verifiable Delay Function
Zhang, Jingyu
Ou, Jiejun
Lan, Di
Ma, Bojian
Luo, Lailong
PROCEEDINGS OF THE 2024 27 TH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN, CSCWD 2024, 2024, : 1621 - 1626
[40] MAXIMUM AND MINIMUM BETWEEN FUZZY SYMBOLS IN NON-INTERACTIVE AND WEAKLY NON-INTERACTIVE SITUATIONS
AMBROSIO, R
MARTINI, GB
FUZZY SETS AND SYSTEMS, 1984, 12 (01) : 27 - 35

← 1 2 3 4 5 →