The following pages link to (Q4472077):
Displayed 14 items.
- A new universal designated verifier transitive signature scheme for big graph data (Q314806) (← links)
- Reasoning about XML update constraints (Q923878) (← links)
- A simple transitive signature scheme for directed trees (Q924159) (← links)
- Computing on authenticated data (Q2344052) (← links)
- Zero-Knowledge Authenticated Order Queries and Order Statistics on a List (Q2794500) (← links)
- Verifiable Pattern Matching on Outsourced Texts (Q2827727) (← links)
- Short Transitive Signatures for Directed Trees (Q2889993) (← links)
- Signatures and Efficient Proofs on Committed Graphs and NP-Statements (Q2948189) (← links)
- Short Redactable Signatures Using Random Trees (Q3623041) (← links)
- Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures (Q4916021) (← links)
- Transitive Signatures from Braid Groups (Q5458209) (← links)
- Separation Results on the “One-More” Computational Problems (Q5458933) (← links)
- Sanitizable Signatures (Q5862665) (← links)
- The One-More Discrete Logarithm Assumption in the Generic Group Model (Q6041299) (← links)