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

Remzi Can Aksoy

dblp:213/7293 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2019
—ORCID · none

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

Security and privacy · 1Software engineering, systems software and programming languages · 1 · 1 first-author

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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%
Network and information security
1 paper
Privacy and data protection · 100%
Databases, data mining, and information retrieval
1 paper
Spatial and temporal data management · 100%

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

TopicWeightPapersLastEvidence papers
Privacy and data protection
privacy-preserving query processing
0.412019
Privacy-Preserving Aggregate Queries for Optimal Location Selection · IEEE Trans. Dependable Secur. Comput. 2019
Distributed systems
consensus
0.412019
Aegean: replication beyond the client-server model · SOSP 2019
Distributed systems › consensus
paxos
0.412019
Aegean: replication beyond the client-server model · SOSP 2019
Distributed systems
replication
0.412019
Aegean: replication beyond the client-server model · SOSP 2019
Distributed systems › replication
replication and fault tolerance
0.412019
Aegean: replication beyond the client-server model · SOSP 2019
Privacy and data protection
differential privacy
0.112019
Privacy-Preserving Aggregate Queries for Optimal Location Selection · IEEE Trans. Dependable Secur. Comput. 2019
Distributed systems › distributed system architecture
client-server systems
0.112019
Aegean: replication beyond the client-server model · SOSP 2019

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

partially homomorphic encryption · 0.8differential privacy · 0.8
YearPublicationVenuePosition
2019 Aegean: replication beyond the client-server model
abstract
This paper presents Aegean, a new approach that allows fault-tolerant replication to be implemented beyond the confines of the client-server model. In today's computing, where services are rarely standalone, traditional replication protocols such as Primary-Backup, Paxos, and PBFT are not directly applicable, as they were designed for the client-server model. When services interact, these protocols run into a number of problems, affecting both correctness and performance. In this paper, we rethink the design of replication protocols in the presence of interactions between services and introduce new techniques that accommodate such interactions safely and efficiently. Our evaluation shows that a prototype implementation of Aegean not only ensures correctness in the presence of service interactions, but can further improve throughput by an order of magnitude.
Remzi Can Aksoy, Manos Kapritsos
SOSP1
2019 Privacy-Preserving Aggregate Queries for Optimal Location Selection
abstract
Today, vast amounts of location data are collected by various service providers. These location data owners have a good idea of where their users are most of the time. Other businesses also want to use this information for location analytics, such as finding the optimal location for a new branch. However, location data owners cannot share their data with other businesses, mainly due to privacy and legal concerns. In this paper, we propose privacy-preserving solutions in which location-based queries can be answered by data owners without sharing their data with other businesses and without accessing sensitive information such as the customer list of the businesses that send the query. We utilize a partially homomorphic cryptosystem as the building block of the proposed protocols. We prove the security of the protocols in semi-honest threat model. We also explain how to achieve differential privacy in the proposed protocols and discuss its impact on utility. We evaluate the performance of the protocols with real and synthetic datasets and show that the proposed solutions are highly practical. The proposed solutions will facilitate an effective sharing of sensitive data between entities and joint analytics in a wide range of applications without violating their customers' privacy.
Emre Yilmaz 0002, Hakan Ferhatosmanoglu, Erman Ayday, Remzi Can Aksoy
IEEE Trans. Dependable Secur. Comput.4