Zero-knowledge interactive proof systems for new lattice problems

DOI10.1007/978-3-319-27239-9_9zbMATH Open1376.94030OpenAlexW2398403423MaRDI QIDQ3460104FDOQ3460104

Authors: Claude Crépeau, Raza Ali Kazmi 

Publication date: 12 January 2016

Published in: Cryptography and Coding (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-27239-9_9

Recommendations

• Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
• Advances in Cryptology - CRYPTO 2003
• On the limits of nonapproximability of lattice problems
• scientific article; zbMATH DE number 1775382
• Theory of Cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• On lattices, learning with errors, random linear codes, and cryptography
• Title not available (Why is that?)
• Bonsai trees, or how to delegate a lattice basis
• The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators
• Fast computation of Hermite normal forms of random integer matrices
• Foundations of Cryptography
• Title not available (Why is that?)
• Does co-NP have short interactive proofs ?
• The Knowledge Complexity of Interactive Proof Systems
• Trapdoors for lattices: simpler, tighter, faster, smaller
• Advances in Cryptology - CRYPTO 2003
• Choosing a Point from the Surface of a Sphere
• Title not available (Why is that?)
• Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
• Rational points on the unit sphere
• The hardness of code equivalence over \(\mathbb F_q\) and its application to code-based cryptography
• The Generation of All Rational Orthogonal Matrices
• Is code equivalence easy to decide?
• Title not available (Why is that?)

Cited In (8)

• Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles
• Title not available (Why is that?)
• Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles
• Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
• Advances in Cryptology - CRYPTO 2003
• Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
• Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
• On the lattice isomorphism problem

Uses Software

• McEliece

This page was built for publication: Zero-knowledge interactive proof systems for new lattice problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3460104)