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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q56172630 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: New directions in cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure communications over insecure channels / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:02, 18 June 2024

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