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

Dazou Sang

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

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%

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 random access machine
multi-client ORAM
0.712023
Tianji: Securing a Practical Asynchronous Multi-User ORAM · IEEE Trans. Dependable Secur. Comput. 2023
Cryptographic protocols and secure computation › oblivious data structures
oblivious random access machine
0.712023
Tianji: Securing a Practical Asynchronous Multi-User ORAM · IEEE Trans. Dependable Secur. Comput. 2023
Cryptographic protocols and secure computation
secret sharing
0.212023
Tianji: Securing a Practical Asynchronous Multi-User ORAM · IEEE Trans. Dependable Secur. Comput. 2023

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

shamir secret sharing · 0.7non-eviction write-back · 0.7homomorphic encryption · 0.7
YearPublicationVenuePosition
2023 Tianji: Securing a Practical Asynchronous Multi-User ORAM
abstract
Oblivious Random Access Machines (ORAMs) allow cloud users to access remote data without leaking access patterns. Current ORAM solutions achieve this goal at expense of either increasing bandwidth consumption by a factor of$O(\log N)$, where$N$is the number of data blocks, or relying on homomorphic encryption for bandwidth amplification reduction to$O(1)$. Furthermore, most ORAMs are only effective for a single user, while the solutions for multi-user scenarios often induce security or performance problems. This article introducesTianji— an asynchronous multi-user Shamir-based ORAM system — which supports asynchronous network access scenarios for multiple users with improved security and performance.Tianjiis implemented on top ofS$^{3}$3ORAM$^+$+—an extension of the state-of-the-art Shamir-based S$^{3}$ORAM with a new non-eviction data write-back scheme to achieve$O(1)$consumption in both bandwidth amplification and storage capacity. Our experimental results show that the proposedTianjiwithS$^{3}$3ORAM$^+$+can significantly outperform the state-of-the-art multi-userTaoStorein terms of access latency and client scalability. Additionally, its average response time is relatively stable when client loads increase.
Wen Cheng 0003, Dazou Sang, Lingfang Zeng, Yang Wang 0006, André Brinkmann
IEEE Trans. Dependable Secur. Comput.2