Pages that link to "Item:Q2128575"
From MaRDI portal
The following pages link to A compressed \(\varSigma \)-protocol theory for lattices (Q2128575):
Displaying 25 items.
- ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines (Q5087274) (← links)
- Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures (Q6041296) (← links)
- Zero-knowledge arguments for subverted RSA groups (Q6088994) (← links)
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) (Q6104330) (← links)
- Practical sublinear proofs for R1CS from lattices (Q6104331) (← 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)
- Quantum rewinding for many-round protocols (Q6169349) (← links)
- Fiat-Shamir transformation of multi-round interactive proofs (Q6169350) (← links)
- Vector commitments over rings and compressed \(\varSigma \)-protocols (Q6169352) (← links)
- Sigma protocols from verifiable secret sharing and their applications (Q6562568) (← links)
- Rogue-instance security for batch knowledge proofs (Q6581786) (← links)
- Multilinear Schwartz-Zippel \(\operatorname{mod} \mathrm{N}\) and lattice-based succinct arguments (Q6582225) (← links)
- Generalized special-sound interactive proofs and their knowledge soundness (Q6582226) (← links)
- PERK: compact signature scheme based on a new variant of the permuted kernel problem (Q6587197) (← links)
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency (Q6595849) (← links)
- Succinct verification of compressed sigma protocols in the updatable SRS setting (Q6635775) (← links)
- Constant-size zk-SNARKs in ROM from falsifiable assumptions (Q6637561) (← links)
- SLAP: succinct lattice-based polynomial commitments from standard assumptions (Q6637716) (← links)
- Aggregating Falcon signatures with LaBRADOR (Q6648189) (← links)
- CDS composition of multi-round protocols (Q6653053) (← links)
- On soundness notions for interactive oracle proofs (Q6655868) (← links)
- Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup (Q6660298) (← links)
- Shuffle arguments based on subset-checking (Q6660397) (← links)
