\(1/p\)-secure multiparty computation without an honest majority and the best of both worlds (Q2210437): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q109044449, #quickstatements; #temporary_batch_1711486624475
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s00145-020-09354-z / 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: Towards Characterizing Complete Fairness in Secure Two-Party Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security against covert adversaries: Efficient protocols for realistic adversaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Protocols for Multiparty Coin Toss with Dishonest Majority / 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: Q4536805 / 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: Security and composition of multiparty cryptographic protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3210165 / 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: Practical and provably secure release of a secret and exchange of signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing fully secure protocols for secure two-party computation of constant-domain functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource fairness and composability of cryptographic protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancements of trapdoor permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure multi-party computation without agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete Fairness in Secure Two-Party Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Complete Primitives for Fairness / 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: Partial fairness in secure two-party computation / 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: On Achieving the “Best of Both Worlds” in Secure Multiparty Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Multi-Party Computation with Identifiable Abort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549592 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Classification of Finite Boolean Functions up to Fairness / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimally Fair Coin Toss / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-concurrent secure multi-party computation with a dishonest majority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to share a secret / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00145-020-09354-Z / rank
 
Normal rank

Latest revision as of 12:06, 17 December 2024

scientific article
Language Label Description Also known as
English
\(1/p\)-secure multiparty computation without an honest majority and the best of both worlds
scientific article

    Statements

    \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 November 2020
    0 references
    secure multiparty computation
    0 references
    \(1/p\)-security
    0 references
    partial-fairness
    0 references
    best-of-both-worlds
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers