jedisct1 / c-blind-rsa-signaturesLinks
Blind RSA signatures for OpenSSL/BoringSSL.
☆17Updated 3 weeks ago
Alternatives and similar repositories for c-blind-rsa-signatures
Users that are interested in c-blind-rsa-signatures are comparing it to the libraries listed below
Sorting:
- Xoodyak, a lightweight and versatile cryptographic scheme implemented in Rust.☆30Updated 8 months ago
- A standalone AES-KW (AES Key Wrap) implementation.☆14Updated 2 years ago
- ☆19Updated 5 years ago
- Elliptic curves Rust reference implementation☆16Updated last year
- Deterministic/nonce-reuse resistant authenticated encryption scheme using XChaCha20, implemented on libsodium.☆30Updated last year
- Implementation and simulations for the "Reducing Metadata Leakage from Encrypted Data and Communication with PURBs" paper☆31Updated 2 years ago
- Proof-of-concept implementation of the (V)OPRF protocol in https://datatracker.ietf.org/doc/draft-irtf-cfrg-voprf/☆23Updated 5 years ago
- Proof of Device☆21Updated 2 years ago
- Parses https://eprint.iacr.org/eprint-bin/search.pl?last=365&title=1 and sends you an email with the latest papers☆15Updated 5 years ago
- A privacy-preserving digital version of punch cards used in store loyalty programs☆11Updated 4 years ago
- ☆18Updated 2 years ago
- ☆12Updated 4 years ago
- A small and easy to use HPKE implementation in Go.☆20Updated last year
- Reference implementations of post-quantum cryptographic primitives☆33Updated 4 months ago
- C crypto library☆24Updated 2 years ago
- Implementations of do255e and do255s in C and assembly☆25Updated 4 years ago
- High-performance Curve25519/ristretto255 for Go.☆77Updated 2 months ago
- High Speed elliptic curve signature system using a 260-bit Granger Moss Prime.☆14Updated 4 years ago
- Hybrid Public Key Encryption☆51Updated last year
- Stronger and Faster Side-Channel Protections for CSIDH☆20Updated 5 years ago
- Working Copy of the NSEC5 Specification☆15Updated 5 years ago
- U2f implementation with threshold signatures☆16Updated 5 years ago
- VDAF specification☆25Updated this week
- Oblivious Pseudorandom Functions (OPRFs) using Prime-Order Groups☆38Updated last year
- a web page / paper☆18Updated 8 years ago
- Efficient Anonymous Tokens with Private Metadata Bit☆15Updated 2 years ago
- Make AES-GCM safe to use with random nonces, for any practical number of messages.☆18Updated 4 months ago
- A design for doing more private Signal groups using anonymous credentials based on algebraic MACs.☆14Updated 6 years ago
- Infinitely presentable (aeon) rerandomisable (flux) anonymous credentials.☆29Updated 5 years ago
- ☆14Updated 7 years ago