Pages that link to "Item:Q4916004"
From MaRDI portal
The following pages link to Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications (Q4916004):
Displayed 46 items.
- Policy-based signature scheme from lattices (Q306050) (← links)
- Lattice-based zero-knowledge arguments for additive and multiplicative relations (Q831178) (← links)
- Memory lower bounds of reductions revisited (Q1648781) (← links)
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus (Q1648788) (← links)
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption (Q1711842) (← links)
- A lattice-based group signature scheme with verifier-local revocation (Q1749538) (← links)
- A framework for cryptographic problems from linear algebra (Q2023808) (← links)
- Traceable ring signatures: general framework and post-quantum security (Q2034982) (← links)
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes (Q2055652) (← links)
- Shorter lattice-based zero-knowledge proofs via one-time commitments (Q2061919) (← links)
- Group encryption: full dynamicity, message filtering and code-based instantiation (Q2061981) (← links)
- Revocable hierarchical attribute-based signatures from lattices (Q2096621) (← links)
- Covert authentication from lattices (Q2096622) (← links)
- A gapless code-based hash proof system based on RQC and its applications (Q2099170) (← links)
- Zero-knowledge proofs for committed symmetric Boolean functions (Q2118554) (← links)
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices (Q2128574) (← links)
- More efficient amortization of exact zero-knowledge proofs for LWE (Q2148770) (← links)
- Group signature from lattices preserving forward security in dynamic setting (Q2210634) (← links)
- Almost fully anonymous attribute-based group signatures with verifier-local revocation and member registration from lattice assumptions (Q2235756) (← links)
- Lattice-based group signatures: achieving full dynamicity (and deniability) with ease (Q2317863) (← links)
- A new Gaussian sampling for trapdoor lattices with arbitrary modulus (Q2329396) (← links)
- Toward non-interactive zero-knowledge proofs for NP from LWE (Q2661693) (← links)
- Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge (Q2693627) (← links)
- Secret handshakes: full dynamicity, deniability and lattice-based design (Q2699945) (← 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)
- Lattice-Based Group Signatures with Verifier-Local Revocation: Achieving Shorter Key-Sizes and Explicit Traceability with Ease (Q3297617) (← links)
- Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography (Q5041168) (← links)
- Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions (Q5041222) (← links)
- Efficient Post-quantum SNARKs for RSIS and RLWE and Their Applications to Privacy (Q5041224) (← links)
- A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties (Q5056025) (← links)
- One-Shot Verifiable Encryption from Lattices (Q5738881) (← links)
- Multi-theorem preprocessing NIZKs from lattices (Q5918862) (← links)
- Adaptive oblivious transfer with access control from lattice assumptions (Q5919120) (← links)
- Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy (Q6041283) (← links)
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general (Q6104329) (← links)
- Multimodal private signatures (Q6104359) (← links)
- Verifiable decryption in the head (Q6108795) (← links)
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors (Q6110389) (← links)
- Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection (Q6132417) (← links)
- BLOOM: bimodal lattice one-out-of-many proofs and applications (Q6133965) (← links)
- Forward-secure revocable secret handshakes from lattices (Q6166997) (← links)
- Traceable policy-based signatures and instantiation from lattices (Q6195214) (← links)
- Efficient code-based fully dynamic group signature scheme (Q6201340) (← links)
