The following pages link to (Q3826476):
Displaying 50 items.
- Concurrent knowledge extraction in public-key models (Q271592) (← links)
- A note on constant-round zero-knowledge proofs of knowledge (Q380963) (← links)
- A framework for non-interactive instance-dependent commitment schemes (NIC) (Q500985) (← links)
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer (Q656920) (← links)
- A language-dependent cryptographic primitive (Q676829) (← links)
- A note on universal composable zero-knowledge in the common reference string model (Q1007253) (← links)
- Hybrid commitments and their applications to zero-knowledge proof systems (Q1022606) (← links)
- Round-optimal fully black-box zero-knowledge arguments from one-way permutations (Q1629411) (← links)
- Public-coin parallel zero-knowledge for NP (Q1946592) (← links)
- What security can we achieve within 4 rounds? (Q2010586) (← links)
- Formalising \(\varSigma\)-protocols and commitment schemes using crypthol (Q2031427) (← links)
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more (Q2055662) (← links)
- Statistical ZAP arguments (Q2055672) (← links)
- Oblivious transfer is in MiniQCrypt (Q2056751) (← links)
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations (Q2104241) (← links)
- Compact ring signatures from learning with errors (Q2120080) (← links)
- A black-box approach to post-quantum zero-knowledge in constant rounds (Q2120081) (← links)
- On the concurrent composition of quantum zero-knowledge (Q2120082) (← links)
- Multi-theorem designated-verifier NIZK for QMA (Q2120083) (← links)
- Does Fiat-Shamir require a cryptographic hash function? (Q2139639) (← links)
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions (Q2170057) (← links)
- Non-black-box simulation in the fully concurrent setting, revisited (Q2423842) (← links)
- Concurrent zero knowledge, revisited (Q2442650) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
- Secure MPC: laziness leads to GOD (Q2691583) (← links)
- Post-quantum resettably-sound zero knowledge (Q2695624) (← links)
- Somewhere statistical soundness, post-quantum security, and SNARGs (Q2695640) (← links)
- On the Correlation Intractability of Obfuscated Pseudorandom Functions (Q2796135) (← links)
- Improved OR-Composition of Sigma-Protocols (Q2799092) (← links)
- Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security (Q2802147) (← links)
- Four-Round Zero-Knowledge Arguments of Knowledge with Strict Polynomial-Time Simulation from Differing-Input Obfuscation for Circuits (Q2817870) (← links)
- What Security Can We Achieve Within 4 Rounds? (Q2827735) (← links)
- On the Existence of Extractable One-Way Functions (Q2829449) (← links)
- On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits (Q2947522) (← links)
- Signatures and Efficient Proofs on Committed Graphs and NP-Statements (Q2948189) (← links)
- Indistinguishable Proofs of Work or Knowledge (Q2953800) (← links)
- A second note on the feasibility of generalized universal composability (Q3130297) (← links)
- Composition of Zero-Knowledge Proofs with Efficient Provers (Q3408217) (← links)
- On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation (Q3449562) (← links)
- One-Time Programs (Q3600212) (← links)
- The Knowledge Complexity of Interactive Proof Systems (Q3833627) (← links)
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems (Q4302852) (← links)
- Cryptography Using Captcha Puzzles (Q4916003) (← links)
- How to Simulate It – A Tutorial on the Simulation Proof Technique (Q5021134) (← links)
- Geometry and Combinatorics via Right-Angled Artin Groups (Q5055451) (← links)
- Relativistic (or 2-Prover 1-Round) Zero-Knowledge Protocol for $$\mathsf {NP}$$ Secure Against Quantum Adversaries (Q5270368) (← links)
- Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model (Q5323057) (← links)
- How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge (Q5445500) (← links)
- An Equivalence Between Zero Knowledge and Commitments (Q5445522) (← links)
