Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Rotem Hemo

dblp:201/6461 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic protocols and secure computation · 56% Blockchain and cryptocurrency security · 44%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › multi-party protocols
byzantine agreement
0.312017
Algorand: Scaling Byzantine Agreements for Cryptocurrencies · SOSP 2017
Blockchain and cryptocurrency security › blockchain scalability
scalable consensus
0.312017
Algorand: Scaling Byzantine Agreements for Cryptocurrencies · SOSP 2017
Distributed systems › fault tolerance
byzantine fault tolerance
0.312017
Algorand: Scaling Byzantine Agreements for Cryptocurrencies · SOSP 2017
Distributed systems
consensus
0.312017
Algorand: Scaling Byzantine Agreements for Cryptocurrencies · SOSP 2017

Methods — techniques the papers use, named apart from their topics

cryptographic sortition · 0.6byzantine agreement · 0.6
YearPublicationVenuePosition
2017 Algorand: Scaling Byzantine Agreements for Cryptocurrencies
abstract
Algorand is a new cryptocurrency that confirms transactions with latency on the order of a minute while scaling to many users. Algorand ensures that users never have divergent views of confirmed transactions, even if some of the users are malicious and the network is temporarily partitioned. In contrast, existing cryptocurrencies allow for temporary forks and therefore require a long time, on the order of an hour, to confirm transactions with high confidence.
Yossi Gilad, Rotem Hemo, Silvio Micali, Georgios Vlachos, Nickolai Zeldovich
SOSP2