Pages that link to "Item:Q5428126"
From MaRDI portal
The following pages link to Advances in Cryptology - CRYPTO 2003 (Q5428126):
Displaying 40 items.
- Tightly secure signatures from lossy identification schemes (Q315555) (← links)
- A framework for non-interactive instance-dependent commitment schemes (NIC) (Q500985) (← links)
- Generating shorter bases for hard random lattices (Q537918) (← links)
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer (Q656920) (← links)
- Lattice-based zero-knowledge arguments for additive and multiplicative relations (Q831178) (← links)
- SZK proofs for black-box group problems (Q929290) (← links)
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures (Q1015359) (← links)
- Lattice-based key exchange on small integer solution problem (Q1616180) (← links)
- On basing search SIVP on \(\mathbf{NP}\)-hardness (Q1629401) (← 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)
- New (and old) proof systems for lattice problems (Q1753870) (← links)
- The inapproximability of lattice and coding problems with preprocessing (Q1881262) (← links)
- On relationships between statistical zero-knowledge proofs (Q1975967) (← links)
- (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes (Q2055644) (← links)
- Public-coin statistical zero-knowledge batch verification against malicious verifiers (Q2056790) (← links)
- On the complexity of collision resistant hash functions: new and old black-box separations (Q2175920) (← links)
- Toward non-interactive zero-knowledge proofs for NP from LWE (Q2661693) (← links)
- A novel identity-based multi-signature scheme over NTRU lattices (Q2676475) (← links)
- An efficient statistical zero-knowledge authentication protocol for smart cards (Q2804907) (← links)
- Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption (Q2953774) (← links)
- Zero-Knowledge Interactive Proof Systems for New Lattice Problems (Q3460104) (← links)
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems (Q3600386) (← links)
- (Q4542558) (← links)
- Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications (Q4916004) (← links)
- Zero-Knowledge Proofs of Proximity (Q4993282) (← links)
- A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties (Q5056025) (← links)
- (Q5092454) (← links)
- A Novel Certificateless Multi-signature Scheme over NTRU Lattices (Q5095936) (← links)
- Structure Versus Hardness Through the Obfuscation Lens (Q5149758) (← links)
- Cryptographic Functions from Worst-Case Complexity Assumptions (Q5188549) (← links)
- One-message statistical Zero-Knowledge Proofs and space-bounded verifier (Q5204303) (← links)
- Lattice-Based Identification Schemes Secure Under Active Attacks (Q5445452) (← links)
- An Equivalence Between Zero Knowledge and Commitments (Q5445522) (← links)
- The Complexity of Zero Knowledge (Q5458822) (← links)
- Advances in Cryptology - ASIACRYPT 2003 (Q5902396) (← links)
- Lattice-based inner product argument (Q6160829) (← links)
- Enhancing Code Based Zero-Knowledge Proofs Using Rank Metric (Q6488038) (← links)
- Searching for ELFs in the cryptographic forest (Q6582218) (← links)
- Linkable ring signature scheme with stronger security guarantees (Q6595333) (← links)
