Pages that link to "Item:Q2139631"
From MaRDI portal
The following pages link to Time- and space-efficient arguments from groups of unknown order (Q2139631):
Displaying 26 items.
- Sumcheck arguments and their applications (Q2120101) (← links)
- Gemini: elastic SNARKs for diverse environments (Q2170056) (← links)
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments (Q2697847) (← links)
- Simple and efficient batch verification techniques for verifiable delay functions (Q2697899) (← links)
- Public Key Cryptography - PKC 2005 (Q5711565) (← links)
- Ligero: lightweight sublinear arguments without a trusted setup (Q6063128) (← links)
- Practical statistically-sound proofs of exponentiation in any group (Q6104340) (← links)
- Parallelizable delegation from LWE (Q6114288) (← links)
- Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\) (Q6132407) (← links)
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version) (Q6134420) (← links)
- On time-lock cryptographic assumptions in abelian hidden-order groups (Q6157523) (← links)
- Fiat-Shamir transformation of multi-round interactive proofs (Q6169350) (← links)
- Vector commitments over rings and compressed \(\varSigma \)-protocols (Q6169352) (← links)
- On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives (Q6169365) (← links)
- PPAD is as hard as LWE and iterated squaring (Q6169422) (← links)
- Efficient transparent polynomial commitments for zk-SNARKs (Q6558604) (← links)
- Multilinear Schwartz-Zippel \(\operatorname{mod} \mathrm{N}\) and lattice-based succinct arguments (Q6582225) (← links)
- (Verifiable) delay functions from Lucas sequences (Q6587959) (← links)
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance (Q6637522) (← links)
- SLAP: succinct lattice-based polynomial commitments from standard assumptions (Q6637716) (← links)
- An efficient ZK compiler from SIMD circuits to general circuits (Q6655875) (← 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)
- Mangrove: a scalable framework for folding-based SNARKs (Q6660304) (← links)
- NIZKs with maliciously chosen CRS: subversion advice-ZK and accountable soundness (Q6660376) (← links)
