Doubly adaptive zero-knowledge proofs

DOI10.1016/J.TCS.2023.114014OpenAlexW4380716427MaRDI QIDQ6132969FDOQ6132969

Authors: Vincenzo Botta, Ivan Visconti 

Publication date: 21 July 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.114014

zbMATH Keywords

zero knowledgeadaptive corruptionadaptive input

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function
• Bit commitment using pseudorandomness
• How to construct constant-round zero-knowledge proof systems for NP
• Practical and provably-secure commitment schemes from collision-free hashing
• Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
• A note on constant-round zero-knowledge proofs of knowledge
• Title not available (Why is that?)
• Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
• The knowledge complexity of interactive proof-systems
• One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments
• Title not available (Why is that?)
• Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
• Online/offline OR composition of sigma protocols

Cited In (2)

• Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
• Adaptive zero-knowledge proofs and adaptively secure oblivious transfer

This page was built for publication: Doubly adaptive zero-knowledge proofs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132969)