Doubly adaptive zero-knowledge proofs

DOI10.1016/J.TCS.2023.114014MaRDI QIDQ6132969zbMATH OpenOpenAlexFDO

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

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

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)