Constant-Size Dynamic k-TAA
From MaRDI portal
Recommendations
Cited in
(35)- Efficient redactable signature and application to anonymous credentials
- Group signatures with user-controlled and sequential linkability
- Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms
- Anonymous single-sign-on for \(n\) designated services with traceability
- Rerandomizable signatures under standard assumption
- An \(r\)-hiding revocable group signature scheme: group signatures with the property of hiding the number of revoked users
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- Tight security for signature schemes without random oracles
- MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system
- Efficient attribute-based signature for monotone predicates
- Towards lightweight anonymous entity authentication for IoT applications
- Efficient dynamic k-times anonymous authentication
- Blind attribute-based encryption and oblivious transfer with fine-grained access control
- Towards restricting plaintext space in public key encryption
- Formal analysis of a TTP-free blacklistable anonymous credentials system
- PAChain: private, authenticated and auditable consortium blockchain
- Dynamic k-Times Anonymous Authentication
- Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems
- Efficient oblivious transfers with access control
- k-Times Anonymous Authentication (Extended Abstract)
- An efficient self-blindable attribute-based credential scheme
- Public Key Cryptography - PKC 2006
- Revisiting BBS signatures
- Foundations of adaptor signatures
- Multi-Holder anonymous credentials from BBS signatures
- Server-aided anonymous credentials
- Lattice-based proof-friendly signatures from vanishing short integer solutions
- Compute, but verify: efficient multiparty computation over authenticated inputs
- Foundations of anonymous signatures: formal definitions, simplified requirements, and a construction based on general assumptions
- Everlasting anonymous rate-limited tokens
- Device-bound anonymous credentials with(out) trusted hardware
- Beyond the circuit -- how to minimize foreign arithmetic in ZKP circuits
- Issuer hiding for BBS-based anonymous credentials
- Efficient construction of threshold BBS+ signatures and its extensions
- Balancing privacy and accountability in blockchain identity management
This page was built for publication: Constant-Size Dynamic k-TAA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3541882)
