Round-optimal fully black-box zero-knowledge arguments from one-way permutations
From MaRDI portal
Recommendations
- On the round complexity of zero-knowledge proofs based on one-way permutations
- Perfect zero-knowledge arguments for NP using any one-way permutation
- Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
- Round-optimal zero-knowledge proofs of knowledge for NP
- 4-round resettably-sound zero knowledge
Cites work
- Bit commitment using pseudorandomness
- Black-Box Constructions of Two-Party Protocols from One-Way Functions
- Definitions and properties of zero-knowledge proof systems
- Foundations of Cryptography
- How to construct constant-round zero-knowledge proof systems for NP
- scientific article; zbMATH DE number 4191106 (Why is no real title available?)
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 4101089 (Why is no real title available?)
- Improved OR-composition of sigma-protocols
- Multi-collision resistance: a paradigm for keyless hash functions
- On Efficient Zero-Knowledge PCPs
- On the Composition of Zero-Knowledge Proof Systems
- On the existence of three round zero-knowledge proofs
- On the Power of Secure Two-Party Computation
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
- Round-optimal black-box two-party computation
- The Knowledge Complexity of Interactive Proof Systems
- Universally composable two-party and multi-party secure computation
- Which languages have 4-round zero-knowledge proofs?
- Zero-knowledge proofs from secure multiparty computation
Cited in
(14)- Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions?
- Round-optimal black-box commit-and-prove with succinct communication
- A black-box approach to post-quantum zero-knowledge in constant rounds
- Towards a unified approach to black-box constructions of zero-knowledge proofs
- Round-optimal multi-party computation with identifiable abort
- On round optimal statistical zero knowledge arguments
- On the exact round complexity of best-of-both-worlds multi-party computation
- On the round complexity of zero-knowledge proofs based on one-way permutations
- 4-round resettably-sound zero knowledge
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
- Full round zero-sum distinguishers on \textsf{TinyJAMBU}-128 and \textsf{TinyJAMBU}-192 keyed-permutation in the known-key setting
- Round-optimal black-box MPC in the plain model
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
- Black-box (and fast) non-malleable zero knowledge
This page was built for publication: Round-optimal fully black-box zero-knowledge arguments from one-way permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1629411)
