On the communication efficiency of statistically secure asynchronous MPC with optimal resilience (Q2697681): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00145-023-09451-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4360983526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience / rank
 
Normal rank
Property / cites work
 
Property / cites work: The resiliency of MPC with low interaction: the benefit of making errors (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A full proof of the BGW protocol for perfectly secure multiparty computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Shunning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple and Efficient Perfectly-Secure Asynchronous MPC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfectly-Secure MPC with Linear Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous secure computations with optimal resilience (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Always have a backup plan: fully secure synchronous MPC with asynchronous fallback / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universally Composable Security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast asynchronous Byzantine agreement with optimal resilience / rank
 
Normal rank
Property / cites work
 
Property / cites work: On communication-efficient asynchronous MPC with adaptive security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the efficiency of optimally-resilient statistically-secure asynchronous multi-party computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Framework for Unconditionally Secure Multiparty Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round and communication efficient unconditionally-secure MPC with \(t<n/3\) in partially synchronous network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous Secure Multiparty Computation in Constant Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalable and Unconditionally Secure Multiparty Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiparty Computation from Somewhat Homomorphic Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536795 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impossibility of distributed consensus with one faulty process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication-efficient unconditional MPC with guaranteed output delivery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guaranteed output delivery comes free in honest majority MPC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic Asynchronous Multi-party Computation with Optimal Resilience / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous Multi-Party Computation with Quadratic Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universally Composable Synchronous Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information-theoretically secure protocols and security under composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronous constructive cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous Byzantine agreement with optimal resilience / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient asynchronous verifiable secret sharing and multiparty computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Hybrid Networks in Multi-Party Computation / 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: How to share a secret / rank
 
Normal rank

Latest revision as of 22:26, 31 July 2024

scientific article
Language Label Description Also known as
English
On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
scientific article

    Statements

    On the communication efficiency of statistically secure asynchronous MPC with optimal resilience (English)
    0 references
    0 references
    0 references
    13 April 2023
    0 references
    secure multiparty computation
    0 references
    verifiable secret sharing
    0 references
    asynchronous network
    0 references
    UC security
    0 references
    unbounded adversary
    0 references
    communication complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references