Pages that link to "Item:Q1796807"
From MaRDI portal
The following pages link to More efficient commitments from structured lattice assumptions (Q1796807):
Displaying 42 items.
- Lattice-based proof of shuffle and applications to electronic voting (Q826259) (← links)
- Lattice-based zero-knowledge arguments for additive and multiplicative relations (Q831178) (← links)
- A sub-linear lattice-based submatrix commitment scheme (Q831634) (← links)
- Efficient lattice-based polynomial evaluation and batch ZK arguments (Q832321) (← links)
- Shorter lattice-based zero-knowledge proofs via one-time commitments (Q2061919) (← links)
- Practical product proofs for lattice commitments (Q2096537) (← links)
- Covert authentication from lattices (Q2096622) (← links)
- Improved lattice-based mix-nets for electronic voting (Q2104424) (← 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)
- More efficient amortization of exact zero-knowledge proofs for LWE (Q2148770) (← links)
- More efficient construction of anonymous signatures (Q2673068) (← links)
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings (Q2692384) (← links)
- Lattice-based e-cash, revisited (Q2692386) (← links)
- Grid-Obstacle Representations with Connections to Staircase Guarding (Q4625102) (← 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)
- Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications (Q5087262) (← links)
- Message-Restriction-Free Commitment Scheme Based on Lattice Assumption (Q5095924) (← 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)
- Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy (Q6041283) (← links)
- Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations (Q6041285) (← links)
- Lattice-based accumulator with constant time list update and constant time verification (Q6057222) (← links)
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general (Q6104329) (← links)
- Practical sublinear proofs for R1CS from lattices (Q6104331) (← links)
- MuSig-L: lattice-based multi-signature with single-round online phase (Q6104337) (← links)
- A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling (Q6104338) (← links)
- BLOOM: bimodal lattice one-out-of-many proofs and applications (Q6133965) (← links)
- Lattice-based inner product argument (Q6160829) (← links)
- Lattice-Based Proof of a Shuffle (Q6166544) (← links)
- Vector commitments over rings and compressed \(\varSigma \)-protocols (Q6169352) (← links)
- Forward-Secure Group Encryptions from Lattices (Q6488399) (← links)
- Commitments with efficient zero-knowledge arguments from subset sum problems (Q6550619) (← 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)
- Lattice-based threshold, accountable, and private signature (Q6636114) (← links)
- Solving the tensor isomorphism problem for special orbits with low rank points: cryptanalysis and repair of an Asiacrypt 2023 commitment scheme (Q6648191) (← links)
- Lattice-based zero-knowledge proofs in action: applications to electronic voting (Q6655871) (← links)
- Concretely efficient lattice-based polynomial commitment from standard assumptions (Q6660308) (← links)
- Hybrid zero-knowledge from garbled circuits and circuit-based composition of \(\Sigma \)-protocols (Q6660381) (← links)
