Ursa Minor: the implementation framework for Polaris

DOI10.1007/978-3-031-81824-0_16MaRDI QIDQ6996912zbMATH OpenFDO

Authors Mohammadtaghi Badakhshan, Guiwen Luo, Tanmayi Jandhyala, Guang Gong

Publication date 15 April 2025

Full work available at URL https://doi.org/10.1007/978-3-031-81824-0_16

zbMATH Keywords

post-quantumprivacy-preserving applicationzero-knowledge proof

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Cites work

• \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
• Algebraic methods for interactive proof systems
• Aurora: transparent succinct arguments for R1CS
• Fast Reed-Solomon interactive oracle proofs of proximity
• Functional data structures and algorithms. A proof assistant approach
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• scientific article; zbMATH DE number 5485522 (Why is no real title available?)
• On the size of pairing-based non-interactive arguments
• Quadratic span programs and succinct NIZKs without PCPs
• Scalable zero knowledge with no trusted setup
• Spartan: efficient and general-purpose zkSNARKs without trusted setup

This page was built for publication: Ursa Minor: the implementation framework for Polaris

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