The dining cryptographers problem: Unconditional sender and recipient untraceability (Q1109008)

From MaRDI portal
Revision as of 17:25, 17 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q56172630, #quickstatements; #temporary_batch_1705508227706)





scientific article
Language Label Description Also known as
English
The dining cryptographers problem: Unconditional sender and recipient untraceability
scientific article

    Statements

    The dining cryptographers problem: Unconditional sender and recipient untraceability (English)
    0 references
    0 references
    1988
    0 references
    dining cryptographers problem
    0 references
    untraceability
    0 references
    unconditional security
    0 references
    pseudonymity
    0 references
    one-time-use keys
    0 references
    public keys
    0 references

    Identifiers