Pages that link to "Item:Q3579210"
From MaRDI portal
The following pages link to Strict polynomial-time in simulation and extraction (Q3579210):
Displaying 12 items.
- Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP (Q893613) (← links)
- A black-box approach to post-quantum zero-knowledge in constant rounds (Q2120081) (← links)
- On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits (Q2267359) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
- On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs (Q2827722) (← links)
- On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits (Q2947522) (← links)
- On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation (Q3449562) (← links)
- Three-Round Public-Coin Bounded-Auxiliary-Input Zero-Knowledge Arguments of Knowledge (Q3454578) (← links)
- Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries (Q3600327) (← links)
- A Discrete-Logarithm Based Non-interactive Non-malleable Commitment Scheme with an Online Knowledge Extractor (Q3600328) (← links)
- The Knowledge Complexity of Interactive Proof Systems (Q3833627) (← links)
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version) (Q6134420) (← links)
