Recommendations
Cites work
- A classification of computational assumptions in the algebraic group model
- A DAA scheme requiring less TPM resources
- A Proof of Security in O(2 n ) for the Benes Scheme
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- Constant-Size Dynamic k-TAA
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 1952905 (Why is no real title available?)
- scientific article; zbMATH DE number 1952906 (Why is no real title available?)
- Key-alternating ciphers and key-length extension: exact bounds and multi-user security
- Security Analysis of the Strong Diffie-Hellman Problem
- Short randomizable signatures
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Structure-preserving signatures and commitments to group elements
- The algebraic group model and its applications
- Tight security bounds for key-alternating ciphers
- Tight state-restoration soundness in the algebraic group model
- Unifying Zero-Knowledge Proofs of Knowledge
Cited in
(14)- Adaptive UC NIZK for practical applications
- Multi-Holder anonymous credentials from BBS signatures
- Server-aided anonymous credentials
- Lattice-based proof-friendly signatures from vanishing short integer solutions
- Foundations of anonymous signatures: formal definitions, simplified requirements, and a construction based on general assumptions
- On the concrete security of BBS/BBS+ signatures
- Everlasting anonymous rate-limited tokens
- Tight security for BBS signatures
- Device-bound anonymous credentials with(out) trusted hardware
- A short-list of pairing-friendly curves resistant to the special TNFS algorithm at the 192-bit security level
- Revisiting discrete logarithm reductions
- Issuer hiding for BBS-based anonymous credentials
- Efficient construction of threshold BBS+ signatures and its extensions
- Succinctly verifiable computation over additively-homomorphically encrypted data: making privacy-preserving blueprints practical
This page was built for publication: Revisiting BBS signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6083685)