Characterization of secure multiparty computation without broadcast (Q1753172): 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 / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00145-017-9264-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3157356141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious / rank
 
Normal rank
Property / cites work
 
Property / cites work: Protocols for multiparty coin toss with a dishonest majority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair Coin Flipping: Tighter Analysis and the Many-Party Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure multi-party computation without agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of Secure Multiparty Computation Without Broadcast / rank
 
Normal rank
Property / cites work
 
Property / cites work: From fairness to full security in multiparty computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Authenticated Algorithms for Byzantine Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy impossibility proofs for distributed consensus problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detectable byzantine agreement secure against faulty majorities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete Fairness in Multi-party Computation without an Honest Majority / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Almost-Optimally Fair Three-Party Coin-Flipping Protocol / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Weak Byzantine Generals Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Byzantine Generals Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimally Fair Coin Toss / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reaching Agreement in the Presence of Faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unconditional Byzantine agreement for any number of faulty processors / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:00, 15 July 2024

scientific article
Language Label Description Also known as
English
Characterization of secure multiparty computation without broadcast
scientific article

    Statements

    Characterization of secure multiparty computation without broadcast (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 May 2018
    0 references
    broadcast
    0 references
    point-to-point communication
    0 references
    multiparty computation
    0 references
    coin flipping
    0 references
    fairness
    0 references
    impossibility result
    0 references

    Identifiers