Pages that link to "Item:Q5395682"
From MaRDI portal
The following pages link to New Techniques for Noninteractive Zero-Knowledge (Q5395682):
Displaying 39 items.
- Cryptography in the multi-string model (Q744350) (← links)
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs (Q901372) (← links)
- One-message zero knowledge and non-malleable commitments (Q1629409) (← links)
- Certifying trapdoor permutations, revisited (Q1629429) (← links)
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs (Q1648790) (← links)
- Predicate signatures from pair encodings via dual system proof technique (Q2009416) (← links)
- Compact designated verifier NIZKs from the CDH assumption without pairings (Q2051369) (← links)
- Compact NIZKs from standard assumptions on bilinear maps (Q2055661) (← links)
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more (Q2055662) (← links)
- Statistical ZAPR arguments from bilinear maps (Q2055670) (← links)
- Sublinear-round Byzantine agreement under corrupt majority (Q2055693) (← links)
- Black-box non-interactive non-malleable commitments (Q2056786) (← links)
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments (Q2056787) (← links)
- Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge (Q2061955) (← 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)
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages (Q2104242) (← links)
- On the round complexity of randomized Byzantine agreement (Q2121502) (← links)
- Adaptively secure threshold symmetric-key encryption (Q2152046) (← links)
- Dual-mode NIZKs: possibility and impossibility results for property transfer (Q2152070) (← links)
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols (Q2170001) (← links)
- COA-secure obfuscation and applications (Q2170027) (← links)
- Non-interactive zero-knowledge proofs with fine-grained security (Q2170050) (← links)
- Toward non-interactive zero-knowledge proofs for NP from LWE (Q2661693) (← links)
- Communication complexity of Byzantine agreement, revisited (Q2689834) (← links)
- Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? (Q2691585) (← links)
- Simulation-sound arguments for LWE and applications to KDM-CCA2 security (Q2692340) (← links)
- Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness (Q2695641) (← links)
- Order-Revealing Encryption and the Hardness of Private Learning (Q2796125) (← links)
- A Shuffle Argument Secure in the Generic Model (Q2953798) (← links)
- Separating Computational and Statistical Differential Privacy in the Client-Server Model (Q3179372) (← links)
- Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
- Weak Zero-Knowledge beyond the Black-Box Barrier (Q5026393) (← links)
- Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model (Q5087275) (← links)
- Optimally Sound Sigma Protocols Under DCRA (Q5854433) (← links)
- Verifiable random functions from non-interactive witness-indistinguishable proofs (Q5918799) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)
- NIZK from SNARGs (Q6110372) (← links)
- Generic constructions of master-key KDM secure attribute-based encryption (Q6146591) (← links)
