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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yehuda Michelson

dblp:360/1714 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
0009-0007-8924-1896ORCID · reported

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

Security and privacy · 1 · 1 since 2021

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 · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Memory systems · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › oblivious data structures
oblivious RAM
0.712023
FutORAMa: A Concretely Efficient Hierarchical Oblivious RAM · CCS 2023
Memory systems
access pattern hiding
0.212023
FutORAMa: A Concretely Efficient Hierarchical Oblivious RAM · CCS 2023
Memory systems › secure memory
secure memory access
0.212023
FutORAMa: A Concretely Efficient Hierarchical Oblivious RAM · CCS 2023

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

square-root ORAM · 1.3hierarchical ORAM construction · 1.3PathORAM · 1.3
YearPublicationVenuePosition
2023 FutORAMa: A Concretely Efficient Hierarchical Oblivious RAM
abstract
Oblivious RAM (ORAM) is a general-purpose technique for hiding memory access patterns. This is a fundamental task underlying many secure computation applications. While known ORAM schemes provide optimal asymptotic complexity, despite extensive efforts, their concrete costs remain prohibitively expensive for many interesting applications. The current state-of-the-art practical ORAM schemes are suitable only for somewhat small memories (Square-Root ORAM or Path ORAM).
Gilad Asharov, Ilan Komargodski, Yehuda Michelson
CCS3