A full proof of the BGW protocol for perfectly secure multiparty computation (Q514468): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an 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-015-9214-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1245637661 / 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: Perfectly-Secure Multiplication for Any t < n/3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3212258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035733 / 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: Resilient-optimal interactive consistency in constant time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive versus non-adaptive security of multi-party protocols / 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: Q4228521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universally composable two-party and multi-party secure computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536795 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplified VSS and fast-track multiparty computations with applications to threshold cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic encryption / 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: The Byzantine Generals Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential composition of protocols without simultaneous termination / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:45, 13 July 2024

scientific article
Language Label Description Also known as
English
A full proof of the BGW protocol for perfectly secure multiparty computation
scientific article

    Statements

    A full proof of the BGW protocol for perfectly secure multiparty computation (English)
    0 references
    0 references
    0 references
    2 March 2017
    0 references
    multiparty computation
    0 references
    perfect security
    0 references
    BGW
    0 references
    cryptographic protocols
    0 references

    Identifiers