Skip to main navigation
Skip to search
Skip to main content
Bar-Ilan University Home
Help & FAQ
Home
Researchers
Organisations
Research output
Prizes
Student theses
Courses
Activities
Projects
Press/Media
Datasets
Equipment
Search by expertise, name or affiliation
Distributed algorithms made secure: A graph theoretic approach
Merav Parter,
Eylon Yogev
Weizmann Institute of Science
Technion-Israel Institute of Technology
Research output
:
Contribution to conference
›
Paper
›
peer-review
11
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Distributed algorithms made secure: A graph theoretic approach'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Graph Theoretic Approach
100%
Distributed Algorithms
100%
Compiler
75%
Neighbor-joining Tree
75%
Secure multi-party Computation
50%
Distributed Graph Algorithms
50%
Information Theory
25%
Inherent Properties
25%
Polynomial Time
25%
Semi-honest Adversary
25%
Cryptographic
25%
Private Information
25%
Distributed Network
25%
Maximum Degree
25%
Selfish Agents
25%
Single Node
25%
Local Computation
25%
Local Perspectives
25%
Distributed Model
25%
Distributed Settings
25%
Computational Tasks
25%
Combinatorial Structure
25%
Bitcoin
25%
Graph Functions
25%
Network Entity
25%
Digital Currency
25%
Security Algorithms
25%
Basic Graph
25%
Computer Science
Distributed Algorithm
100%
Theoretic Approach
100%
secure multiparty computation
50%
Graph Algorithms
50%
Distributed Network
25%
Distributed Model
25%
Computational Task
25%
Bitcoin
25%
Secure Algorithm
25%
Digital Currency
25%
Polynomial Time
25%