Doubly adaptive zero-knowledge proofs

被引：0

作者：

Botta, Vincenzo ^{[1
]}

Visconti, Ivan ^{[2
]}

机构：

[1] Univ Warsaw, Krakowskie Przedmiescie 26-28, PL-00927 Warsaw, Poland

[2] Univ Salerno, Via Giovanni Paolo II 132, I-84084 Fisciano, Italy

来源：

THEORETICAL COMPUTER SCIENCE | 2023年 / 968卷

基金：

欧洲研究理事会;

关键词：

Zero knowledge; Adaptive corruption; Adaptive input;

D O I：

10.1016/j.tcs.2023.114014

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In [TCC 2009 and JoC 2011] Lindell and Zarosim defined adaptive-corruption zero knowledge giving to the environment the power to perform post-execution corruption only. Moreover, their zero-knowledge proof system does not enjoy adaptive-input selection since it crucially relies on fixing the inputs already at the onset of the protocol. In this paper, we propose a new definition of adaptive-corruption zero-knowledge proofs that more naturally fits the setting that benefits from adaptive-input selection. We allow the non-rewindable environment to corrupt the prover adaptively based on its visibility of the messages exchanged so far. Then we show a zero-knowledge proof system for NP that is doubly adaptive (i.e., it enjoys adaptive-corruption under our stronger notion and adaptive-input selection) matching the same assumptions and round complexity of classical zero-knowledge proofs.& COPY; 2023 Elsevier B.V. All rights reserved.

引用

页数：16

共 50 条

[21] Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability [J].

Bootle, Jonathan ;

Cerulli, Andrea ;

Ghadafi, Essam ;

Groth, Jens ;

Hajiabadi, Mohammad ;

Jakobsen, Sune K. .

ADVANCES IN CRYPTOLOGY - ASIACRYPT 2017, PT III, 2017, 10626 :336-365

[22] Efficient implementation of zero-knowledge proofs for watermark detection in multimedia data [J].

Adelsbach, Andre ;

Rohe, Markus ;

Sadeghi, Ahmad-Reza .

TRANSACTIONS ON DATA HIDING AND MULTIMEDIA SECURITY 1, 2006, 4300 :73-103

[23] Shorter Lattice-Based Zero-Knowledge Proofs for the Correctness of a Shuffle [J].

Herranz, Javier ;

Martinez, Ramiro ;

Sanchez, Manuel .

FINANCIAL CRYPTOGRAPHY AND DATA SECURITY, FC 2021, 2021, 12676 :315-329

[24] Lattice-Based Group Signatures and Zero-Knowledge Proofs of Automorphism Stability [J].

del Pino, Rafael ;

Lyubashevsky, Vadim ;

Seiler, Gregor .

PROCEEDINGS OF THE 2018 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (CCS'18), 2018, :574-591

[25] Towards a Unified Approach to Black-Box Constructions of Zero-Knowledge Proofs [J].

Liang, Xiao ;

Pandey, Omkant .

ADVANCES IN CRYPTOLOGY - CRYPTO 2021, PT IV, 2021, 12828 :34-64

[26] ON PARALLEL COMPOSITION OF ZERO-KNOWLEDGE PROOFS WITH BLACK-BOX QUANTUM SIMULATORS [J].

Jain, Rahul ;

Kolla, Alexandra ;

Midrijanis, Gatis ;

Reichardt, Ben W. .

QUANTUM INFORMATION & COMPUTATION, 2009, 9 (5-6) :513-532

[27] Shielding Probabilistically Checkable Proofs: Zero-Knowledge PCPs from Leakage Resilience [J].

Weiss, Mor .

ENTROPY, 2022, 24 (07)

[28] Two Mutual Authentication Protocols Based on Zero-Knowledge Proofs for RFID Systems [J].

Assidi, Hafsa ;

Ayebie, Edoukou Berenger ;

Souidi, El Mamoun .

INFORMATION SECURITY AND CRYPTOLOGY - ICISC 2017, 2018, 10779 :267-283

[29] Improved Zero-Knowledge Identification with Improved Zero-Knowledge Identification with Lattices [J].

Cayrel, Pierre-Louis ;

Lindner, Richard ;

Rueckert, Markus ;

Silva, Rosemberg .

PROVABLE SECURITY, 2010, 6402 :1-+

[30] Reduction zero-knowledge [J].

Zhao, YL ;

Deng, XT ;

Lee, CH ;

Zhu, H .

PROGRESS IN NATURAL SCIENCE-MATERIALS INTERNATIONAL, 2004, 14 (04) :350-358

← 1 2 3 4 5 →