Pages that link to "Item:Q4268869"
From MaRDI portal
The following pages link to Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions (Q4268869):
Displaying 50 items.
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments (Q332270) (← links)
- Round-optimal password-based authenticated key exchange (Q380962) (← links)
- Long-term security and universal composability (Q604632) (← links)
- On server trust in private proxy auctions (Q608995) (← links)
- Cryptography in the multi-string model (Q744350) (← links)
- Non-interactive zero-knowledge proofs for composite statements (Q776004) (← links)
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs (Q901372) (← links)
- Hybrid commitments and their applications to zero-knowledge proof systems (Q1022606) (← links)
- Ring signatures: Stronger definitions, and constructions without random oracles (Q1027973) (← links)
- One-message zero knowledge and non-malleable commitments (Q1629409) (← links)
- Round optimal black-box ``commit-and-prove'' (Q1629413) (← links)
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782) (← links)
- An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity (Q1983326) (← links)
- Compact designated verifier NIZKs from the CDH assumption without pairings (Q2051369) (← links)
- How to extract useful randomness from unreliable sources (Q2055615) (← links)
- Compact NIZKs from standard assumptions on bilinear maps (Q2055661) (← links)
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more (Q2055662) (← links)
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions (Q2055663) (← links)
- Statistical ZAPR arguments from bilinear maps (Q2055670) (← links)
- Round-optimal blind signatures in the plain model from classical and quantum standard assumptions (Q2056693) (← links)
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments (Q2056787) (← links)
- Towards accountability in CRS generation (Q2056795) (← links)
- Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge (Q2061955) (← links)
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust (Q2104237) (← links)
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations (Q2104241) (← links)
- Multi-theorem designated-verifier NIZK for QMA (Q2120083) (← links)
- Does Fiat-Shamir require a cryptographic hash function? (Q2139639) (← links)
- On black-box extension of a non-interactive zero-knowledge proof system for secret equality (Q2152072) (← links)
- One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model (Q2170058) (← links)
- Non-malleable commitments against quantum attacks (Q2170101) (← links)
- On the power of secure two-party computation (Q2303458) (← links)
- Simultaneous amplification: the case of non-interactive zero-knowledge (Q2304997) (← links)
- Mercurial commitments with applications to zero-knowledge sets (Q2377062) (← links)
- Enhancements of trapdoor permutations (Q2392094) (← links)
- Toward non-interactive zero-knowledge proofs for NP from LWE (Q2661693) (← links)
- Secure MPC: laziness leads to GOD (Q2691583) (← links)
- Individual simulations (Q2691606) (← links)
- Simulation-sound arguments for LWE and applications to KDM-CCA2 security (Q2692340) (← links)
- Post-quantum resettably-sound zero knowledge (Q2695624) (← links)
- Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness (Q2695641) (← links)
- Statistical ZAPs from group-based assumptions (Q2695645) (← links)
- (Q2754163) (← links)
- Indistinguishability Obfuscation: From Approximate to Exact (Q2796119) (← links)
- A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles (Q2799091) (← links)
- Candidate indistinguishability obfuscation and functional encryption for all circuits (Q2816296) (← links)
- On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs (Q2827722) (← links)
- On the Power of Secure Two-Party Computation (Q2829222) (← links)
- On the existence of extractable one-way functions (Q2829449) (← links)
- 3-Message Zero Knowledge Against Human Ignorance (Q3179352) (← links)
