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

Ali Utkan Sahin

dblp:271/0561 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
1since 2021 · last 2023
0009-0008-4067-7880ORCID · reported

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

Security and privacy · 3 · 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 · 91% Cryptographic primitives and cryptanalysis · 9%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › secure computation on encrypted data
multiparty homomorphic encryption
0.712023
PELTA - Shielding Multiparty-FHE against Malicious Adversaries · CCS 2023
Cryptographic protocols and secure computation
secure multiparty computation
0.712023
PELTA - Shielding Multiparty-FHE against Malicious Adversaries · CCS 2023
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs
0.712023
PELTA - Shielding Multiparty-FHE against Malicious Adversaries · CCS 2023

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

zero-knowledge proofs · 0.7lattice-based commitments · 0.7fully homomorphic encryption · 0.7
YearPublicationVenuePosition
2023 PELTA - Shielding Multiparty-FHE against Malicious Adversaries
abstract
Multiparty fully homomorphic encryption (MFHE) schemes enable multiple parties to efficiently compute functions on their sensitive data while retaining confidentiality. However, existing MFHE schemes guarantee data confidentiality and the correctness of the computation result only against honest-but-curious adversaries. In this work, we provide the first practical construction that enables the verification of MFHE operations in zero-knowledge, protecting MFHE from malicious adversaries. Our solution relies on a combination of lattice-based commitment schemes and proof systems which we adapt to support both modern FHE schemes and their implementation optimizations. We implement our construction in PELTA. Our experimental evaluation shows that PELTA is one to two orders of magnitude faster than existing techniques in the literature.
Sylvain Chatel, Christian Mouchet, Ali Utkan Sahin, Apostolos Pyrgelis, Carmela Troncoso, Jean-Pierre Hubaux
CCS3
2020 Demo: A Proof-of-Concept Implementation of Guard Secure Routing Protocol
abstract
Skip Graphs belong to the family of Distributed Hash Table (DHT) structures that are utilized as routing overlays in various peer-to-peer applications including blockchains, cloud storage, and social networks. In a Skip Graph overlay, any misbehavior of peers during the routing of a query compromises the system functionality. Guard is the first authenticated search mechanism for Skip Graphs, enables reliable search operation in a fully decentralized manner. In this demo paper, we present a proof-of-concept implementation of Guard on Skip Graph nodes as well as a deployment demo scenario.
Sanaz Taheri Boshrooyeh, Ali Utkan Sahin, Yahya Hassanzadeh-Nazarabadi, Öznur Özkasap
SRDS2
2020 Demo: Skip Graph Middleware Implementation
abstract
Skip Graphs are Distributed Hash Table (DHT)based data structures that are immensely utilized as routing overlays in Peer-to-Peer (P2P) applications. In this demo paper, we present the software architecture of our open-source implementation of Skip Graph middleware in Java. We also present a demo scenario on configuration and constructing an overlay of Skip Graph processes in a fully decentralized manner. Our implementation is capable of hosting data objects at the Skip Graph processes and serving as a P2P data storage platform as well. Our middleware implementation provides an open-source platform to support Skip Graph-based applications on top of it.
Yahya Hassanzadeh-Nazarabadi, Nazir Nayal, Shadi Sameh Hamdan, Ali Utkan Sahin, Öznur Özkasap, Alptekin Küpçü
SRDS4