Correction to: ``Topology-hiding communication from minimal assumptions'' (Q6054730): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Topology-Hiding Computation Beyond Logarithmic Diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology-hiding computation on all graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring the boundaries of topology-hiding computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Is information-theoretic topology-hiding computation possible? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology-hiding communication from minimal assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4343426 / 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: The dining cryptographers problem: Unconditional sender and recipient untraceability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Byzantine generals strike again / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfectly secure message transmission / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing an st-numbering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network-Hiding Communication and Applications to Multi-party Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universally Composable Synchronous Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Byzantine Generals Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology-hiding computation beyond semi-honest adversaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology-hiding computation for networks with unknown delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness for symmetric two-party functionalities: revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology-Hiding 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: Q3719851 / rank
 
Normal rank

Latest revision as of 06:56, 3 August 2024

scientific article; zbMATH DE number 7754300
Language Label Description Also known as
English
Correction to: ``Topology-hiding communication from minimal assumptions''
scientific article; zbMATH DE number 7754300

    Statements

    Correction to: ``Topology-hiding communication from minimal assumptions'' (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 October 2023
    0 references
    foundations
    0 references
    secure multiparty computation
    0 references
    topology-hiding computation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references