Polytopes in the Fiat-Shamir with aborts paradigm

DOI10.1007/978-3-031-68376-3_11MaRDI QIDQ6648197

Thomas Ricosset, Éric Sageloli, Hugo Beguinet, Henry Bambury

Publication date: 4 December 2024

zbMATH Keywords

zero-knowledge proofsrejection samplinglattice-based cryptographyFiat-Shamir with abortsintegral polytope uniform sampling

Mathematics Subject Classification ID

Cryptography (94A60) Sampling theory in information and communication theory (94A20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model
• Flush, Gauss, and reload -- a cache attack on the BLISS lattice-based signature scheme
• Shorter lattice-based zero-knowledge proofs via one-time commitments
• Lattice Signatures and Bimodal Gaussians
• Lattice Signatures without Trapdoors
• On the Volume of the Intersection of Two L n p Balls
• Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
• Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
• On the Complexity of Computing the Volume of a Polyhedron
• Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
• Benchmarking Post-quantum Cryptography in TLS
• A key-recovery attack against Mitaka in the \(t\)-probing model
• Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
• On rejection sampling in Lyubashevsky's signature scheme
• A framework for practical anonymous credentials from lattices
• Finding short integer solutions when the modulus is small

This page was built for publication: Polytopes in the Fiat-Shamir with aborts paradigm

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