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

Seyed Saeed Sadeghian

dblp:64/7564 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · none

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

Security and privacy · 4Applied, interdisciplinary, general and emerging computing · 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
2 papers
Cryptographic protocols and secure computation · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › secure multiparty computation
private function evaluation
0.422014
Actively Secure Private Function Evaluation · ASIACRYPT (2) 2014
How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation · EUROCRYPT 2013
Cryptographic protocols and secure computation
secure multiparty computation
0.212013
How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation · EUROCRYPT 2013

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

homomorphic encryption · 0.2garbled circuits · 0.2
YearPublicationVenuePosition
2014 Actively Secure Private Function Evaluation
Payman Mohassel, Seyed Saeed Sadeghian, Nigel P. Smart
ASIACRYPT (2)2
2014 ZIDS: A Privacy-Preserving Intrusion Detection System Using Secure Two-Party Computation Protocols
abstract
We introduce ZIDS, a client-server solution for private detection of intrusions that is suitable for private detection of zero-day attacks in input data. The system includes an intrusion detection system (IDS) server that has a set of sensitive signatures for zero-day attacks and IDS clients that possess some sensitive data (e.g. files, logs). Using ZIDS, each IDS client learns whether its input data matche any of the zero-day signatures, but neither party learns about any additional information. In other words, the IDS client learns nothing about the zero-day signatures and the IDS server learns nothing about the input data and the analysis results. To solve this problem, we reduce privacy-preserving intrusion detection to an instance of secure two-party oblivious deterministic finite automata (ODFA) evaluation. Then, motivated by the fact that the DFAs associated with attack signature are often sparse, we propose a new and efficient ODFA protocol that takes advantage of this sparsity. Our new construction is considerably more efficient than the existing solutions and, at the same time, does not leak any sensitive information about the nature of the sparsity in the private DFA. We provide a full implementation of our privacy-preserving system that includes optimizations that lead to better memory usage and evaluate its performance on rule sets from the Snort IDS.
Salman Niksefat, Babak Sadeghiyan, Payman Mohassel, Seyed Saeed Sadeghian
Comput. J.4
2013 How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation
Payman Mohassel, Seyed Saeed Sadeghian
EUROCRYPT2
2012 An Efficient Protocol for Oblivious DFA Evaluation and Applications
Payman Mohassel, Salman Niksefat, Seyed Saeed Sadeghian, Babak Sadeghiyan
CT-RSA3
2009 MIBS: A New Lightweight Block Cipher
Maryam Izadi, Babak Sadeghiyan, Seyed Saeed Sadeghian, Hossein Arabnezhad Khanooki
CANS3