Topology-hiding computation on all graphs (Q5919491): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q128218345, #quickstatements; #temporary_batch_1724714016629
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3020973390 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology-hiding computation on all graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology-Hiding Computation Beyond Logarithmic Diameter / 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: Hamilton cycles in random geometric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Interactive Secure Multiparty Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The electrical resistance of a graph captures its commute and cover times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hidden Graph Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphic Encryption with Access Policies: Characterization and New Constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Identity Based Encryption Scheme Based on Quadratic Residues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter and broadcast time of random geometric graphs in arbitrary dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-input Functional Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Multiparty Computation with General Interaction Patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Computation on the Web: Computing without Simultaneous Interaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communications in unknown networks: preserving the secret of topology / 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: Identity-Based Cryptosystems and Quadratic Residuosity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cover time of random walks on graphs / 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: Probability and Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology-Hiding Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lattices, learning with errors, random linear codes, and cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected connectivity in log-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Variant of PMAC: Beyond the Birthday Bound / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128218345 / rank
 
Normal rank

Latest revision as of 01:31, 27 August 2024

scientific article; zbMATH DE number 7176807
Language Label Description Also known as
English
Topology-hiding computation on all graphs
scientific article; zbMATH DE number 7176807

    Statements

    Topology-hiding computation on all graphs (English)
    0 references
    0 references
    0 references
    0 references
    3 March 2020
    0 references
    secure multiparty computation
    0 references
    topology-hiding computation
    0 references
    random walks
    0 references
    networks
    0 references
    broadcast
    0 references
    0 references

    Identifiers