Resettable Zero Knowledge in the Bare Public-Key Model under Standard Assumption
Yi Deng, Dongdai Lin
Abstract
In this paper we resolve an open problem regarding resettable zero knowledge in the bare public-key (BPK for short) model: Does there exist constant round resettable zero knowledge argument with concurrent soundness for NP in BPK model without assuming sub-exponential hardness? We give a positive answer to this question by presenting such a protocol for any language in NP in the bare public-key model assuming only collision-resistant hash functions against polynomial-time adversaries.
Create a lesson
Related papers
Attesting Outputs and Delegation Ancestry in Multi-Agent AI Systems
Lifei Liu, Haoran Yu
Using Hyper-V Sockets for Real-time Data Extraction from a Malware Analysis Sandbox
István-Attila Császár, Radu-Marian Portase, Adrian Coleşa et al.
KORD: Breaking the Key-Generation Bottleneck in Dealerless FSS via Protocol--Hardware Co-Design
Yijing Peng, Lin Liu, Yujie Xue et al.
A Roadmap to Available ICS Datasets and Testbeds for Cybersecurity Research
Ebtesam J. Alqahtani, Mohammad Hammoudeh
Extracting Knowledge from Tools in LLM Agents
Chuanchao Zang, Jianing Wang, Wenyu Chen et al.
SIR: Self-improving Red-teaming for Compute Use Agents
Chen Xiong, Zhiyuan He, Pin-Yu Chen et al.