Pages that link to "Item:Q1648790"
From MaRDI portal
The following pages link to Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs (Q1648790):
Displaying 32 items.
- Lattice-based proof of shuffle and applications to electronic voting (Q826259) (← links)
- On the hardness of module-LWE with binary secret (Q826282) (← links)
- Chosen-ciphertext lattice-based public key encryption with equality test in standard model (Q2072076) (← links)
- Practical product proofs for lattice commitments (Q2096537) (← links)
- Lattice-based blind signatures, revisited (Q2096538) (← links)
- Covert authentication from lattices (Q2096622) (← links)
- Improved lattice-based mix-nets for electronic voting (Q2104424) (← links)
- Implementation of lattice trapdoors on modules and applications (Q2118540) (← links)
- A compressed \(\varSigma \)-protocol theory for lattices (Q2128575) (← links)
- SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions (Q2128577) (← links)
- Practical post-quantum few-time verifiable random function with applications to Algorand (Q2147263) (← links)
- Lattice-based public-key encryption with equality test supporting flexible authorization in standard model (Q2166741) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- On the hardness of module learning with errors with short distributions (Q2677644) (← links)
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings (Q2692384) (← links)
- Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment (Q5041225) (← links)
- On the Scaled Inverse of $(x^i-x^j)$ modulo Cyclotomic Polynomial of the form $\Phi_{p^s}(x)$ or $\Phi_{p^s q^t}(x)$ (Q5074074) (← links)
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices (Q5918662) (← links)
- Efficient lattice-based traceable ring signature scheme with its application in blockchain (Q6052654) (← links)
- A thorough treatment of highly-efficient NTRU instantiations (Q6091128) (← links)
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general (Q6104329) (← links)
- MuSig-L: lattice-based multi-signature with single-round online phase (Q6104337) (← links)
- Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs (Q6155262) (← links)
- Lattice-based inner product argument (Q6160829) (← links)
- Hardness of (M)LWE with semi-uniform seeds (Q6204543) (← links)
- Identity-based encryption from lattices using approximate trapdoors (Q6535489) (← links)
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency (Q6595849) (← links)
- Ring/module learning with errors under linear leakage -- hardness and applications (Q6635772) (← links)
- Aggregating Falcon signatures with LaBRADOR (Q6648189) (← links)
- An algebraic algorithm for breaking NTRU with multiple keys (Q6651896) (← links)
- Lattice-based zero-knowledge proofs in action: applications to electronic voting (Q6655871) (← links)
- Greyhound: fast polynomial commitments from lattices (Q6660299) (← links)
