Security

Garaga is designed with security as a primary concern. This page documents our security practices, audit history, and important considerations for users.


Audit Status

✅ Audited by CryptoExperts

Garaga has undergone a comprehensive security audit:

Audit
Auditor
Date
Report

Garaga v1.0.1

June 27, 2025


Security Considerations

Signature Verification

EdDSA (Ed25519) Specific

The EdDSA implementation includes protections against common attacks:

  • Small-order point rejection: Explicitly rejects points in small subgroups

  • Cofactor handling: Properly handles the Ed25519 cofactor

  • Canonical encoding: Enforces canonical point encoding

Curve Selection

When using Garaga's curve-agnostic APIs, ensure you:

  1. Use the correct curve_id for your application

  2. Understand the security properties of your chosen curve

  3. Use appropriate key sizes and parameters

Curve
Security Level
Notes

BN254

~100 bits

Widely used in Ethereum ecosystem

BLS12-381

~128 bits

Recommended for new applications

SECP256K1

~128 bits

Bitcoin/Ethereum compatibility

SECP256R1

~128 bits

WebAuthn/TLS compatibility

ED25519

~128 bits

High performance EdDSA


Responsible Disclosure

If you discover a security vulnerability in Garaga:

  1. Do NOT open a public GitHub issue

  2. DO email the maintainers privately

  3. DO provide detailed information about the vulnerability

  4. DO allow reasonable time for a fix before public disclosure

See our Security Policy for contact information.


Cryptographic References

Garaga's implementations are based on peer-reviewed cryptographic research. We recommend understanding these papers if you're building security-critical applications:

Zero-Knowledge Proofs

Paper
Authors
Reference

Groth16

Jens Groth

"On the Size of Pairing-Based Non-interactive Arguments" EUROCRYPT 2016. ePrint 2016/260

PLONK

Gabizon, Williamson, Ciobotaru

"PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge" ePrint 2019/953

Elliptic Curves & Pairings

Paper
Authors
Reference

Efficient Pairings

Youssef El Housni

"Pairings in Rank-1 Constraint Systems" ePrint 2022/1162

ECIP

Liam Eagen

"Zero Knowledge Proofs of Elliptic Curve Inner Products from Principal Divisors and Weil Reciprocity" ePrint 2022/596

On Proving Pairings

Novakovic & Eagen

Fast EC Scalar Multiplications

Eagen, El Housni, Masson, Piellard

Pairing for Beginners

Craig Costello

Signatures

Paper
Authors
Reference

EdDSA

Bernstein et al.

"High-speed high-security signatures" ed25519.cr.yp.to

Taming EdDSAs

Chalkias, Garillot, Nikolaenko

"Taming the Many EdDSAs" SSR 2020. ACM DL

BIP340

Wuille, Nick, Towns

"Schnorr Signatures for secp256k1" BIP340

Randomness

Paper
Authors
Reference

drand

Syta et al.

"Scalable Bias-Resistant Distributed Randomness" IEEE S&P 2017

Time-Lock Encryption

Gailly, Melissaris, Romailler

"tlock: Practical Timelock Encryption from Threshold BLS" ePrint 2023/189


Disclaimer


Security Checklist

Before deploying to production:

Last updated

Was this helpful?