Pages that link to "Item:Q2181847"
From MaRDI portal
The following pages link to Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications (Q2181847):
Displaying 38 items.
- Lattice-based zero-knowledge arguments for additive and multiplicative relations (Q831178) (← links)
- Efficient lattice-based polynomial evaluation and batch ZK arguments (Q832321) (← links)
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs (Q1648790) (← links)
- Impossibility results for lattice-based functional encryption schemes (Q2055607) (← links)
- Signatures from sequential-OR proofs (Q2055653) (← links)
- 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)
- DualRing: generic construction of ring signatures with efficient instantiations (Q2120078) (← 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)
- An efficient and generic construction for signal's handshake (X3DH): post-quantum, state leakage secure, and deniable (Q2135524) (← links)
- One-time traceable ring signatures (Q2148766) (← links)
- Group signatures and more from isogenies and lattices: generic, simple, and efficient (Q2170040) (← links)
- One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model (Q2170058) (← links)
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings (Q2692384) (← links)
- Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices (Q2692392) (← links)
- Zero-Knowledge Proofs with Low Amortized Communication from Lattice Assumptions (Q2912785) (← links)
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems (Q3408195) (← links)
- Improved Zero-Knowledge Identification with Lattices (Q4933208) (← links)
- Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications (Q5087262) (← 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)
- Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations (Q6041285) (← links)
- Group signatures and more from isogenies and lattices: generic, simple, and efficient (Q6041582) (← links)
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general (Q6104329) (← links)
- Practical sublinear proofs for R1CS from lattices (Q6104331) (← links)
- Multimodal private signatures (Q6104359) (← links)
- Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs (Q6108830) (← links)
- Efficient lattice-based blind signatures via Gaussian one-time signatures (Q6113967) (← links)
- BLOOM: bimodal lattice one-out-of-many proofs and applications (Q6133965) (← links)
- Orion: zero knowledge proof with linear prover time (Q6166953) (← links)
- Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\) (Q6166955) (← links)
- Post-quantum asynchronous deniable key exchange and the signal handshake (Q6169026) (← links)
- Bicameral and auditably private signatures (Q6562571) (← links)
- Traceable ring signatures from group actions: logarithmic, flexible, and quantum resistant (Q6620043) (← links)
- Ring/module learning with errors under linear leakage -- hardness and applications (Q6635772) (← links)