Advances in Cryptology - CRYPTO 2003
From MaRDI portal
Publication:5428126
Recommendations
Cited in
(41)- An efficient statistical zero-knowledge authentication protocol for smart cards
- Advances in Cryptology - ASIACRYPT 2003
- SZK proofs for black-box group problems
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
- Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
- Quantum lower bounds for approximate counting via Laurent polynomials
- The Complexity of Zero Knowledge
- Toward non-interactive zero-knowledge proofs for NP from LWE
- Enhancing Code Based Zero-Knowledge Proofs Using Rank Metric
- Lattice-based zero-knowledge arguments for additive and multiplicative relations
- scientific article; zbMATH DE number 1775425 (Why is no real title available?)
- On basing search SIVP on \(\mathbf{NP}\)-hardness
- A novel certificateless multi-signature scheme over NTRU lattices
- Public-coin statistical zero-knowledge batch verification against malicious verifiers
- Searching for ELFs in the cryptographic forest
- Lattice-based inner product argument
- Lattice-based key exchange on small integer solution problem
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Cryptographic functions from worst-case complexity assumptions
- On relationships between statistical zero-knowledge proofs
- (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes
- Zero-knowledge proofs of proximity
- An Equivalence Between Zero Knowledge and Commitments
- Structure versus hardness through the obfuscation lens
- Linkable ring signature scheme with stronger security guarantees
- A lattice-based group signature scheme with verifier-local revocation
- On the complexity of collision resistant hash functions: new and old black-box separations
- A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
- Zero-knowledge interactive proof systems for new lattice problems
- Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
- The inapproximability of lattice and coding problems with preprocessing
- Tightly secure signatures from lossy identification schemes
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- One-message statistical Zero-Knowledge Proofs and space-bounded verifier
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- A framework for non-interactive instance-dependent commitment schemes (NIC)
- A novel identity-based multi-signature scheme over NTRU lattices
- Generating shorter bases for hard random lattices
- New (and old) proof systems for lattice problems
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)
