zk-SNARKs from codes with rank metrics
From MaRDI portal
Publication:6595937
DOI10.1007/978-3-031-47818-5_6zbMATH Open1547.94355MaRDI QIDQ6595937
Dang Truong Mac, Quoc-Huy Vu, Xuan Thanh Do
Publication date: 30 August 2024
Cryptography (94A60) Theory of error-correcting codes and error-detecting codes (94B99) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme
- Arya: nearly linear-time zero-knowledge proofs for correct program execution
- Identity-based encryption from codes with rank metric
- A rank metric code-based group signature scheme
- Succinct arguments in the quantum random oracle model
- Scalable zero knowledge with no trusted setup
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- Formal Treatment of Privacy-Enhancing Credential Systems
- Foundations of Fully Dynamic Group Signatures
- Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes
- Dynamic Fully Anonymous Short Group Signatures
- Square Span Programs with Applications to Succinct NIZK Arguments
- Randomizable Proofs and Delegatable Anonymous Credentials
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- Group Signatures
- The knowledge complexity of interactive proof-systems
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Advances in Cryptology – CRYPTO 2004
- Efficient Encryption From Random Quasi-Cyclic Codes
- On the Size of Pairing-Based Non-interactive Arguments
This page was built for publication: zk-SNARKs from codes with rank metrics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6595937)
