Pages that link to "Item:Q4302852"
From MaRDI portal
The following pages link to Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems (Q4302852):
Displayed 39 items.
- Locally random reductions: Improvements and applications (Q676825) (← links)
- A language-dependent cryptographic primitive (Q676829) (← links)
- Privacy-preserving algorithms for distributed mining of frequent itemsets (Q867633) (← links)
- Complexity results in graph reconstruction (Q867853) (← links)
- SZK proofs for black-box group problems (Q929290) (← links)
- Non-interactive and non-malleable commitment scheme based on \(q\)-one way group homomorphisms (Q999185) (← links)
- A note on universal composable zero-knowledge in the common reference string model (Q1007253) (← links)
- Practic zero-knowledge proofs: Giving hints and using deficiencies (Q1180509) (← links)
- An almost-constant round interactive zero-knowledge proof (Q1198029) (← links)
- A uniform-complexity treatment of encryption and zero-knowledge (Q1207696) (← links)
- On the communication complexity of zero-knowledge proofs (Q1261016) (← links)
- A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm (Q1261018) (← links)
- Zero knowledge and the chromatic number (Q1276168) (← links)
- Randomness in interactive proofs (Q1321030) (← links)
- The random oracle hypothesis is false (Q1333397) (← links)
- The knowledge complexity of quadratic residuosity languages (Q1334668) (← links)
- On the power of multi-prover interactive protocols (Q1341733) (← links)
- Practical proofs of knowledge without relying on theoretical proofs of membership on languages (Q1391315) (← links)
- Inverting onto functions. (Q1426007) (← links)
- On the limits of nonapproximability of lattice problems (Q1577010) (← links)
- Interactive and probabilistic proof-checking (Q1577488) (← links)
- New lowness results for ZPP\(^{\text{NP}}\) and other complexity classes. (Q1872705) (← links)
- Fast approximate probabilistically checkable proofs (Q1881217) (← links)
- Existence of 3-round zero-knowledge proof systems for NP (Q2425854) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
- Proving possession of arbitrary secrets while not giving them away: New protocols and a proof in GNY logic (Q2500832) (← links)
- Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks (Q3519535) (← links)
- ON THE POWER OF QUANTUM TAMPER-PROOF DEVICES (Q3534215) (← links)
- Unclonable Group Identification (Q3593118) (← links)
- One-Time Programs (Q3600212) (← links)
- Compression from Collisions, or Why CRHF Combiners Have a Long Output (Q3600232) (← links)
- Collusion-Free Protocols in the Mediated Model (Q3600237) (← links)
- A note on the feasibility of generalised universal composability (Q3616225) (← links)
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems (Q4302852) (← links)
- How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge (Q5445500) (← links)
- General Properties of Quantum Zero-Knowledge Proofs (Q5445501) (← links)
- An Equivalence Between Zero Knowledge and Commitments (Q5445522) (← links)
- The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization (Q5445524) (← links)
- The Complexity of Zero Knowledge (Q5458822) (← links)