Pages that link to "Item:Q2181848"

The following pages link to Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications (Q2181848):

Displaying 25 items.

• Lattice-based zero-knowledge arguments for additive and multiplicative relations (Q831178) (← links)
• Efficient range proofs with transparent setup from bounded integer commitments (Q2056793) (← links)
• Bifurcated signatures: folding the accountability vs. anonymity dilemma into a single private signing scheme (Q2056805) (← links)
• Shorter lattice-based zero-knowledge proofs via one-time commitments (Q2061919) (← links)
• Round-optimal verifiable oblivious pseudorandom functions from ideal lattices (Q2061957) (← links)
• Practical product proofs for lattice commitments (Q2096537) (← links)
• Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices (Q2128574) (← links)
• A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs (Q2128576) (← 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)
• Black-box accumulation based on lattices (Q2149798) (← links)
• \textsf{GM}\textsuperscript{MT}: a revocable group Merkle multi-tree signature scheme (Q2149820) (← links)
• Security analysis of DGM and GM group signature schemes instantiated with XMSS-T (Q2151287) (← links)
• Group signatures and more from isogenies and lattices: generic, simple, and efficient (Q2170040) (← links)
• Lattice-based secret handshakes with reusable credentials (Q2672459) (← links)
• Practical exact proofs from lattices: new techniques to exploit fully-splitting rings (Q2692384) (← links)
• Lattice-based e-cash, revisited (Q2692386) (← links)
• Secret handshakes: full dynamicity, deniability and lattice-based design (Q2699945) (← links)
• Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography (Q5041168) (← links)
• Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment (Q5041225) (← links)
• Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices (Q5918439) (← links)
• Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices (Q5918662) (← links)
• Group signatures and more from isogenies and lattices: generic, simple, and efficient (Q6041582) (← links)
• A new lattice-based online/offline signatures framework for low-power devices (Q6159029) (← links)