Short Transitive Signatures for Directed Trees
From MaRDI portal
Recommendations
- A simple transitive signature scheme for directed trees
- Ultra-succinct representation of ordered trees
- On gracefulness of directed trees with short diameters
- Succinct representation of labeled trees
- Transitivity of trees
- On succinct representations of binary trees
- Directed tree decompositions
- Ultra-succinct representation of ordered trees with applications
Cites work
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- A simple transitive signature scheme for directed trees
- Advances in Cryptology - EUROCRYPT 2004
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
- Directed Transitive Signature Scheme
- Dynamic accumulators and application to efficient revocation of anonymous credentials
- Homomorphic signature schemes
- Homomorphic signatures for polynomial functions
- Incremental cryptography: The case of hashing and signing
- Security in Communication Networks
- Signing a Linear Subspace: Signature Schemes for Network Coding
- Transitive signature schemes
- Transitive Signatures: New Schemes and Proofs
- Two simplified algorithms for maintaining order in a list
Cited in
(6)- Zero-Knowledge Authenticated Order Queries and Order Statistics on a List
- A new universal designated verifier transitive signature scheme for big graph data
- Transitive signature schemes
- Optimal tree-based one-time digital signature schemes
- Directed Transitive Signature Scheme
- A simple transitive signature scheme for directed trees
This page was built for publication: Short Transitive Signatures for Directed Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2889993)