Pages that link to "Item:Q5756624"
From MaRDI portal
The following pages link to Non-interactive Zaps and New Techniques for NIZK (Q5756624):
Displayed 45 items.
- Unconditionally anonymous ring and mesh signatures (Q321307) (← links)
- Efficient traceable signatures in the standard model (Q631785) (← links)
- Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model (Q729893) (← links)
- Group homomorphic encryption: characterizations, impossibility results, and applications (Q1943979) (← links)
- On constant-round concurrent non-malleable proof systems (Q1944155) (← links)
- On subversion-resistant SNARKs (Q2039405) (← links)
- How to extract useful randomness from unreliable sources (Q2055615) (← links)
- Statistical ZAPR arguments from bilinear maps (Q2055670) (← links)
- Statistical ZAP arguments (Q2055672) (← links)
- Statistical Zaps and new oblivious transfer protocols (Q2055674) (← links)
- Non-interactive zero knowledge from sub-exponential DDH (Q2056667) (← links)
- Towards accountability in CRS generation (Q2056795) (← links)
- (Commit-and-prove) predictable arguments with privacy (Q2096627) (← links)
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust (Q2104237) (← links)
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages (Q2104242) (← links)
- Non-malleable codes for bounded parallel-time tampering (Q2129009) (← links)
- Dual-mode NIZKs: possibility and impossibility results for property transfer (Q2152070) (← links)
- Distributed (correlation) samplers: how to remove a trusted dealer in one round (Q2170033) (← links)
- Fully homomorphic NIZK and NIWI proofs (Q2175946) (← links)
- Tightly secure ring signatures in the standard model (Q2235773) (← links)
- Individual simulations (Q2691606) (← links)
- Statistical ZAPs from group-based assumptions (Q2695645) (← links)
- Two-round maliciously secure computation with super-polynomial simulation (Q2695653) (← links)
- Verifiable Functional Encryption (Q2953789) (← links)
- NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion (Q2953796) (← links)
- Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures (Q3392908) (← links)
- Efficient Traceable Signatures in the Standard Model (Q3392912) (← links)
- Compact Group Signatures Without Random Oracles (Q3593110) (← links)
- Co-sound Zero-Knowledge with Public Keys (Q3637146) (← links)
- Verifiable Inner Product Encryption Scheme (Q5041153) (← links)
- QA-NIZK Arguments of Same Opening for Bilateral Commitments (Q5048959) (← links)
- Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles (Q5117380) (← links)
- Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge (Q6045075) (← links)
- Explainable arguments (Q6045191) (← links)
- A survey of elliptic curves for proof systems (Q6063127) (← links)
- (Q6081719) (← links)
- Chopsticks: fork-free two-round multi-signatures from non-interactive assumptions (Q6083682) (← links)
- Obtaining simulation extractable NIZKs in the updatable CRS model generically (Q6118305) (← links)
- Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG (Q6157544) (← links)
- Efficient NIZKs for algebraic sets (Q6157547) (← links)
- Updatable NIZKs from non-interactive zaps (Q6164392) (← links)
- More efficient verifiable functional encryption (Q6173113) (← links)
- Security-preserving distributed samplers: how to generate any CRS in one round without random oracles (Q6186601) (← links)
- On the impossibility of algebraic NIZK in pairing-free groups (Q6190127) (← links)
- A note on non-interactive zero-knowledge from CDH (Q6190128) (← links)