Pages that link to "Item:Q2938865"
From MaRDI portal
The following pages link to Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures (Q2938865):
Displaying 28 items.
- Lattice-based zero-knowledge arguments for additive and multiplicative relations (Q831178) (← links)
- Efficient lattice-based polynomial evaluation and batch ZK arguments (Q832321) (← links)
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption (Q1711842) (← links)
- Efficient range proofs with transparent setup from bounded integer commitments (Q2056793) (← links)
- Group encryption: full dynamicity, message filtering and code-based instantiation (Q2061981) (← links)
- A non-PCP approach to succinct quantum-safe zero-knowledge (Q2096535) (← links)
- Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP (Q2128571) (← links)
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices (Q2128574) (← links)
- A compressed \(\varSigma \)-protocol theory for lattices (Q2128575) (← links)
- Maliciously secure matrix multiplication with applications to private deep learning (Q2691579) (← links)
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings (Q2692384) (← links)
- A Lattice-Based Group Signature Scheme with Message-Dependent Opening (Q2822670) (← links)
- How to Prove Knowledge of Small Secrets (Q2829957) (← links)
- Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption (Q2953774) (← links)
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions (Q2953783) (← links)
- Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions (Q5041222) (← links)
- Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment (Q5041225) (← links)
- On the Scaled Inverse of $(x^i-x^j)$ modulo Cyclotomic Polynomial of the form $\Phi_{p^s}(x)$ or $\Phi_{p^s q^t}(x)$ (Q5074074) (← links)
- (Q5083085) (← links)
- One-Shot Verifiable Encryption from Lattices (Q5738881) (← 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)
- Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs (Q6108830) (← links)
- Mixed-technique multi-party computations composed of two-party computations (Q6109459) (← links)
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors (Q6110389) (← links)
- Lattice-based inner product argument (Q6160829) (← links)
- Toward practical lattice-based proof of knowledge from Hint-MLWE (Q6190149) (← links)