Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Amir Daneshgar"'
Autor:
Ali Taherkhani, Amir Daneshgar
Publikováno v:
Discrete Mathematics. 342:96-112
In this article, we introduce the algebra of block-symmetric cylinders and we show that symmetric cylindrical constructions on base-graphs admitting commutative decompositions behave as generalized tensor products. We compute the characteristic polyn
Publikováno v:
Information Sciences. :253-270
A non-malleable encoding scheme is a keyless encoding scheme which is resilient to tampering attacks. Such a scheme is said to be continuously secure if the scheme is resilient to attacks containing more than one tampering procedure. Moreover, such a
Autor:
Behrooz Khadem, Amir Daneshgar
Publikováno v:
Signal Processing: Image Communication. 36:106-114
In this paper, a word based chaotic image encryption scheme for gray images is proposed that can be used in both synchronous and self-synchronous modes. The encryption scheme operates in a finite field where we have also analyzed its performance acco
Publikováno v:
Mathematical Researches. 1:13-36
Autor:
Amir Daneshgar, Fahimeh Mohebbipoor
We follow two main objectives in this article. On the one hand, we introduce a security model called LORBACPA$^+$ for self-synchronized stream ciphers which is stronger than the blockwise LOR-IND-CPA, where we show that standard constructions as dela
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6ae2cc59a48b5b1763a8aa86b90fcada
http://arxiv.org/abs/1709.08613
http://arxiv.org/abs/1709.08613
Publikováno v:
Pattern Recognition. 46:3371-3382
We propose a graph-based data clustering algorithm which is based on exact clustering of a minimum spanning tree in terms of a minimum isoperimetry criteria. We show that our basic clustering algorithm runs in O(nlogn) and with post-processing in alm
Publikováno v:
ISCISC
Non-malleable codes are kind of encoding schemes which are resilient to tampering attacks. The main idea behind the non-malleable coding is that the adversary can't be able to obtain any valuable information about the message. Non-malleable codes are
Publikováno v:
Stochastic Processes and their Applications. 122(4):1748-1776
Let L be a reversible Markovian generator on a finite set V . Relations between the spectral decomposition of L and subpartitions of the state space V into a given number of components which are optimal with respect to min–max or max–min Dirichle
Autor:
Ramin Javadi, Amir Daneshgar
Publikováno v:
Discrete Applied Mathematics. 160(1-2):116-131
This paper is aimed at investigating some computational aspects of different isoperimetric problems on weighted trees. In this regard, we consider different connectivity parameters called minimum normalized cuts/isoperimetric numbers defined through
Publikováno v:
Procedia - Social and Behavioral Sciences. 32:197-203
Trust is needed to facilitate cooperation and delegation among agents in a multi-agent system. This paper proposes a trust model based on Capra cognitive framework. This framework explains social phenomena from the four perspectives of structure (age