Pages that link to "Item:Q4268869"
From MaRDI portal
The following pages link to Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions (Q4268869):
Displaying 33 items.
- Secure Multiparty RAM Computation in Constant Rounds (Q3179368) (← links)
- Separating Computational and Statistical Differential Privacy in the Client-Server Model (Q3179372) (← links)
- Universally Composable Adaptive Priced Oblivious Transfer (Q3392915) (← links)
- On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation (Q3449562) (← links)
- Cryptography with One-Way Communication (Q3457066) (← links)
- A Brief History of Provably-Secure Public-Key Encryption (Q3506393) (← links)
- Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model (Q3519532) (← links)
- Perfect Non-interactive Zero Knowledge for NP (Q3593105) (← links)
- Publicly Verifiable Non-Interactive Zero-Knowledge Proofs (Q4279587) (← links)
- Cryptographic Applications of the Non-Interactive Metaproof and Many-prover Systems (Q4279588) (← links)
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems (Q4302852) (← links)
- Randomness-efficient non-interactive zero knowledge (Q4572000) (← links)
- Zero-Knowledge Proofs of Proximity (Q4993282) (← links)
- An Exponential Separation Between MA and AM Proofs of Proximity (Q5002752) (← links)
- Weak Zero-Knowledge beyond the Black-Box Barrier (Q5026393) (← links)
- Cryptography and cryptographic protocols (Q5138490) (← links)
- Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model (Q5323057) (← links)
- Isolated Proofs of Knowledge and Isolated Zero Knowledge (Q5458611) (← links)
- Simple and generic constructions of succinct functional encryption (Q5918349) (← links)
- Verifiable random functions from non-interactive witness-indistinguishable proofs (Q5918799) (← links)
- Explainable arguments (Q6045191) (← links)
- NIZK from SNARGs (Q6110372) (← links)
- Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) (Q6111540) (← links)
- Triply adaptive UC NIZK (Q6132421) (← links)
- Classically verifiable NIZK for QMA with preprocessing (Q6134001) (← links)
- Non-interactive zero-knowledge proofs to multiple verifiers (Q6135446) (← links)
- Reverse firewalls for adaptively secure MPC without setup (Q6157521) (← links)
- Universally composable \(\varSigma \)-protocols in the global random-oracle model (Q6169354) (← links)
- A simple and efficient framework of proof systems for NP (Q6562565) (← links)
- Compact NIZKs from standard assumptions on bilinear maps (Q6570525) (← links)
- Non-interactive zero-knowledge functional proofs (Q6604930) (← links)
- Leakage-tolerant circuits (Q6637525) (← links)
- Amplification of non-interactive zero knowledge, revisited (Q6653051) (← links)
