Pages that link to "Item:Q2096535"
From MaRDI portal
The following pages link to A non-PCP approach to succinct quantum-safe zero-knowledge (Q2096535):
Displaying 27 items.
- Quantum cryptography. II: How to re-use a one-time pad safely even if \(\mathrm P=\mathrm{NP}\) (Q268457) (← links)
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics (Q2102078) (← links)
- DualRing: generic construction of ring signatures with efficient instantiations (Q2120078) (← links)
- Sumcheck arguments and their applications (Q2120101) (← links)
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices (Q2128574) (← links)
- A compressed \(\varSigma \)-protocol theory for lattices (Q2128575) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle (Q2670855) (← links)
- Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions (Q5041222) (← links)
- Algorithms and Computation (Q5191646) (← links)
- Practical sublinear proofs for R1CS from lattices (Q6104331) (← links)
- Efficient NIZKs and signatures from commit-and-open protocols in the QROM (Q6104357) (← links)
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version) (Q6134420) (← links)
- Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs (Q6155262) (← links)
- Lattice-based inner product argument (Q6160829) (← links)
- Lower bound on SNARGs in the random oracle model (Q6163944) (← links)
- Orion: zero knowledge proof with linear prover time (Q6166953) (← links)
- Quantum rewinding for many-round protocols (Q6169349) (← links)
- Fiat-Shamir transformation of multi-round interactive proofs (Q6169350) (← links)
- Enhancing Code Based Zero-Knowledge Proofs Using Rank Metric (Q6488038) (← links)
- Multilinear Schwartz-Zippel \(\operatorname{mod} \mathrm{N}\) and lattice-based succinct arguments (Q6582225) (← links)
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency (Q6595849) (← links)
- SLAP: succinct lattice-based polynomial commitments from standard assumptions (Q6637716) (← links)
- Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup (Q6660298) (← links)
- Greyhound: fast polynomial commitments from lattices (Q6660299) (← links)
- Field-agnostic SNARKs from expand-accumulate codes (Q6660301) (← links)
- Concretely efficient lattice-based polynomial commitment from standard assumptions (Q6660308) (← links)
