(Commit-and-prove) predictable arguments with privacy

DOI10.1007/978-3-031-09234-3_27OpenAlexW4285262608MaRDI QIDQ2096627

Hamidreza Khoshakhlagh

Publication date: 9 November 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-09234-3_27

zbMATH Keywords

zero-knowledgewitness encryptionwitness indistinguishabilitypredictable arguments

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Definitions and properties of zero-knowledge proof systems
• Efficient adaptively secure zero-knowledge from garbled circuits
• GGH15 beyond permutation branching programs: proofs, attacks, and candidates
• On perfect correctness in (lockable) obfuscation
• Characterizing deterministic-prover zero knowledge
• Mr NISC: multiparty reusable non-interactive secure computation
• Practical witness-key-agreement for blockchain-based dark pools financial trading
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• New Techniques for SPHFs and Efficient One-Round PAKE Protocols
• The Knowledge Complexity of Interactive Proof Systems
• Witness Maps and Applications
• Witness encryption and its applications
• Predictable Arguments of Knowledge
• Non-interactive Zaps and New Techniques for NIZK

This page was built for publication: (Commit-and-prove) predictable arguments with privacy