Pages that link to "Item:Q2061919"

The following pages link to Shorter lattice-based zero-knowledge proofs via one-time commitments (Q2061919):

Displaying 16 items.

• Shorter lattice-based zero-knowledge proofs via one-time commitments (Q2061919) (← links)
• SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions (Q2128577) (← links)
• More efficient amortization of exact zero-knowledge proofs for LWE (Q2148770) (← links)
• Practical non-interactive publicly verifiable secret sharing with thousands of parties (Q2170010) (← links)
• On the hardness of module learning with errors with short distributions (Q2677644) (← links)
• Multilinear Schwartz-Zippel \(\operatorname{mod} \mathrm{N}\) and lattice-based succinct arguments (Q6582225) (← links)
• Non-interactive commitment from non-transitive group actions (Q6595925) (← links)
• Ring/module learning with errors under linear leakage -- hardness and applications (Q6635772) (← links)
• On structure-preserving cryptography and lattices (Q6635826) (← links)
• Lattice-based threshold, accountable, and private signature (Q6636114) (← links)
• SLAP: succinct lattice-based polynomial commitments from standard assumptions (Q6637716) (← links)
• Aggregating Falcon signatures with LaBRADOR (Q6648189) (← links)
• Solving the tensor isomorphism problem for special orbits with low rank points: cryptanalysis and repair of an Asiacrypt 2023 commitment scheme (Q6648191) (← links)
• Polytopes in the Fiat-Shamir with aborts paradigm (Q6648197) (← links)
• An algebraic algorithm for breaking NTRU with multiple keys (Q6651896) (← links)
• Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup (Q6660298) (← links)