Advances in Cryptology - CRYPTO 2003

DOI10.1007/B11817MaRDI QIDQ5428126zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
• New (and old) proof systems for lattice problems
• Zero knowledge with efficient provers
• Zero-knowledge interactive proof systems for new lattice problems
• A complete problem for statistical zero knowledge

Cited in

(41)

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

Describes a project that uses

Uses Software

• NTRU

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)