ارائه مقاله خانم مریم زارع زاده با عنوان "Secure Parameterized Multi-Pattern Matching in Multi-Text Owner Setting" در هجدمین کنفرانس بین المللی انجمن رمز ایران، اصفهان، دانشگاه اصفهان، شهریور 1400 The parameterized pattern matching (PPM) problem is seeking occurrences of one string in another, where both strings are given from two parameter and constant alphabet sets. In this matching paradigm, a consistent renaming of symbols from the parameter alphabet is allowed. The parameterized pattern matching is useful in problems in software engineering, computational biology, and other applications. In this paper, for the first time, we consider the problem of secure parameterized multi-pattern matching (SPMPM) that an owner of a set of patterns allows matching of his/her patterns against the text while pattern owner only learns matching results and the text owner learns nothing. In our setting, a pattern owner can find the matching locations in multiple texts in a privacy-preservi
بهترین و جدیدترین ویدئو های روز
[توقف]
ویدبید