Pages that link to "Item:Q2692384"

The following pages link to Practical exact proofs from lattices: new techniques to exploit fully-splitting rings (Q2692384):

Displaying 21 items.

• Shorter lattice-based zero-knowledge proofs via one-time commitments (Q2061919) (← links)
• A non-PCP approach to succinct quantum-safe zero-knowledge (Q2096535) (← links)
• Practical product proofs for lattice commitments (Q2096537) (← links)
• Covert authentication from lattices (Q2096622) (← links)
• Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices (Q2128574) (← 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)
• More efficient amortization of exact zero-knowledge proofs for LWE (Q2148770) (← links)
• Group signatures and more from isogenies and lattices: generic, simple, and efficient (Q2170040) (← links)
• Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications (Q5087262) (← links)
• Group signatures and more from isogenies and lattices: generic, simple, and efficient (Q6041582) (← links)
• Bicameral and auditably private signatures (Q6562571) (← 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)
• Fully dynamic attribute-based signatures for circuits from codes (Q6635745) (← links)
• Ring/module learning with errors under linear leakage -- hardness and applications (Q6635772) (← links)
• On structure-preserving cryptography and lattices (Q6635826) (← links)
• Two-round threshold signature from algebraic one-more learning with errors (Q6653014) (← links)
• Lattice-based zero-knowledge proofs in action: applications to electronic voting (Q6655871) (← links)
• Greyhound: fast polynomial commitments from lattices (Q6660299) (← links)
• Concretely efficient lattice-based polynomial commitment from standard assumptions (Q6660308) (← links)