The Round Complexity of Two-Party Random Selection (Q3624376)

From MaRDI portal
Revision as of 19:50, 16 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Round Complexity of Two-Party Random Selection
scientific article

    Statements

    The Round Complexity of Two-Party Random Selection (English)
    0 references
    0 references
    0 references
    0 references
    30 April 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    cryptography
    0 references
    distributed computing
    0 references
    coin flipping
    0 references