Advances in Cryptology - CRYPTO 2003
From MaRDI portal
Publication:5428126
DOI10.1007/B11817zbMATH Open1122.68448OpenAlexW2480001466MaRDI QIDQ5428126FDOQ5428126
Authors: Daniele Micciancio, Salil Vadhan 
Publication date: 28 November 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11817
Recommendations
Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cited In (39)
- Generating shorter bases for hard random lattices
- A Novel Certificateless Multi-signature Scheme over NTRU Lattices
- Lattice-based zero-knowledge arguments for additive and multiplicative relations
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- On relationships between statistical zero-knowledge proofs
- Lattice-based key exchange on small integer solution problem
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
- An Equivalence Between Zero Knowledge and Commitments
- Toward non-interactive zero-knowledge proofs for NP from LWE
- Searching for ELFs in the cryptographic forest
- Lattice-based inner product argument
- A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- On basing search SIVP on \(\mathbf{NP}\)-hardness
- (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes
- A lattice-based group signature scheme with verifier-local revocation
- Linkable ring signature scheme with stronger security guarantees
- Structure Versus Hardness Through the Obfuscation Lens
- The Complexity of Zero Knowledge
- Tightly secure signatures from lossy identification schemes
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Enhancing Code Based Zero-Knowledge Proofs Using Rank Metric
- Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption
- Cryptographic functions from worst-case complexity assumptions
- The inapproximability of lattice and coding problems with preprocessing
- Advances in Cryptology - ASIACRYPT 2003
- Title not available (Why is that?)
- Public-coin statistical zero-knowledge batch verification against malicious verifiers
- On the complexity of collision resistant hash functions: new and old black-box separations
- A novel identity-based multi-signature scheme over NTRU lattices
- Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
- Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
- Zero-Knowledge Proofs of Proximity
- A framework for non-interactive instance-dependent commitment schemes (NIC)
- SZK proofs for black-box group problems
- Title not available (Why is that?)
- One-message statistical Zero-Knowledge Proofs and space-bounded verifier
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
- Zero-Knowledge Interactive Proof Systems for New Lattice Problems
Uses Software
This page was built for publication: Advances in Cryptology - CRYPTO 2003
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428126)
